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-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:51:45,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:45,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:45,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:45,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:45,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:45,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:45,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:45,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:45,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:45,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:45,115 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:45,116 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:45,117 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:45,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:45,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:45,120 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:45,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:45,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:45,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:45,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:45,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:45,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:45,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:45,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:45,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:45,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:45,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:45,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:45,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:45,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:45,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:45,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:45,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:45,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:45,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:45,139 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,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:45,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:45,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:45,156 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:45,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:45,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:45,157 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:45,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:45,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:45,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:45,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:45,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:45,158 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:45,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:45,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:45,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:45,159 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:45,159 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:45,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:45,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:45,160 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:45,160 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:45,160 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:45,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:45,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:45,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:45,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:45,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:45,162 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:45,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:45,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:51:45,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:45,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:45,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:45,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:45,256 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:45,257 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-call_ground.i [2018-11-23 11:51:45,335 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f958993/36110a565647436583dedf08f9ff5944/FLAG59af83e36 [2018-11-23 11:51:45,768 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:45,769 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_false-unreach-call_ground.i [2018-11-23 11:51:45,778 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f958993/36110a565647436583dedf08f9ff5944/FLAG59af83e36 [2018-11-23 11:51:46,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f958993/36110a565647436583dedf08f9ff5944 [2018-11-23 11:51:46,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:46,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:46,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:46,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:46,159 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,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c59c4e 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,163 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,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:46,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:46,379 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,384 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:46,413 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:46,438 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:46,438 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,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:46,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:46,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:46,451 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,461 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,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:46,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:46,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:46,482 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,483 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,485 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,485 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,497 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,505 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,506 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,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:46,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:46,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:46,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:46,512 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,708 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,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:46,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:46,709 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,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:51:46,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:51:46,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:47,409 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:47,410 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:51:47,410 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,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:47,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:47,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:47,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:47,417 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,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512a6115 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,418 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,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512a6115 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,419 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,421 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_false-unreach-call_ground.i [2018-11-23 11:51:47,434 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:47,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:51:47,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:51:47,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:47,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:47,520 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:47,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:47,521 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:47,521 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:47,521 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:47,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:47,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:51:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:47,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,571 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,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1964500077, now seen corresponding path program 1 times [2018-11-23 11:51:47,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:51:47,788 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,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:51:47,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #79#return; {31#true} is VALID [2018-11-23 11:51:47,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret8 := main(); {31#true} is VALID [2018-11-23 11:51:47,789 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,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:51:47,792 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,792 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,792 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,793 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,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 11:51:47,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 11:51:47,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:51:47,797 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,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:47,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:47,805 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:47,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:47,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:51:47,917 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,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:47,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:47,932 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:51:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,200 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2018-11-23 11:51:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:48,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:51:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 11:51:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:51:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 69 transitions. [2018-11-23 11:51:48,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 69 transitions. [2018-11-23 11:51:48,526 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,538 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:51:48,539 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:51:48,542 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,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:51:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:51:48,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:48,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,667 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,667 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,673 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:51:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,674 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,674 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:51:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:48,678 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:51:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:48,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:48,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:48,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:51:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:51:48,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2018-11-23 11:51:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:48,685 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:51:48,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:51:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:51:48,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:48,686 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,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:48,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 900535178, now seen corresponding path program 1 times [2018-11-23 11:51:48,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:48,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:48,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:48,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2018-11-23 11:51:48,779 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,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2018-11-23 11:51:48,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #79#return; {180#true} is VALID [2018-11-23 11:51:48,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret8 := main(); {180#true} is VALID [2018-11-23 11:51:48,781 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,782 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,782 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,782 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,782 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,783 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,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2018-11-23 11:51:48,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2018-11-23 11:51:48,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2018-11-23 11:51:48,785 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,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:48,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:48,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:48,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:48,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:48,842 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,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:48,843 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 3 states. [2018-11-23 11:51:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,016 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 11:51:49,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:49,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:51:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:51:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 11:51:49,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 11:51:49,384 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,387 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:51:49,387 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:51:49,388 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,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:51:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:51:49,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:49,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,438 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,438 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,440 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 11:51:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,442 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,442 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:51:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,445 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-11-23 11:51:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:49,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:49,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:49,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:51:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-23 11:51:49,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 14 [2018-11-23 11:51:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-23 11:51:49,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-11-23 11:51:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:49,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,451 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,451 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash 817144017, now seen corresponding path program 1 times [2018-11-23 11:51:49,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-23 11:51:49,629 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,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-23 11:51:49,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #79#return; {334#true} is VALID [2018-11-23 11:51:49,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2018-11-23 11:51:49,631 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,646 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,652 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,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#false} assume !(0 != ~swapped~0); {335#false} is VALID [2018-11-23 11:51:49,653 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,653 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,653 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,654 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,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2018-11-23 11:51:49,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2018-11-23 11:51:49,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-23 11:51:49,656 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,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:49,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:49,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:49,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:49,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:51:49,696 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,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:49,698 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 3 states. [2018-11-23 11:51:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,103 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 11:51:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:50,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 11:51:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:51:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 11:51:50,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 11:51:50,245 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:50,248 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:51:50,248 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:51:50,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:51:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 11:51:50,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:50,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:50,261 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:50,262 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 11:51:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,264 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:51:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:51:50,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,266 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 11:51:50,266 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 11:51:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:50,269 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-11-23 11:51:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 11:51:50,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:50,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:50,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:50,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:51:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 11:51:50,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-11-23 11:51:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:50,273 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 11:51:50,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 11:51:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:51:50,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:50,274 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:50,274 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:50,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1624563448, now seen corresponding path program 1 times [2018-11-23 11:51:50,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:50,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 11:51:50,368 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,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 11:51:50,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #79#return; {515#true} is VALID [2018-11-23 11:51:50,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret8 := main(); {515#true} is VALID [2018-11-23 11:51:50,369 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,370 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,382 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {517#(= main_~i~0 1)} is VALID [2018-11-23 11:51:50,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {517#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {517#(= main_~i~0 1)} is VALID [2018-11-23 11:51:50,384 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,385 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,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(0 != ~swapped~0); {516#false} is VALID [2018-11-23 11:51:50,385 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,385 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,386 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,386 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,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 11:51:50,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 11:51:50,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 11:51:50,389 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,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:50,389 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,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:50,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:50,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 11:51:50,759 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,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 11:51:50,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #79#return; {515#true} is VALID [2018-11-23 11:51:50,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret8 := main(); {515#true} is VALID [2018-11-23 11:51:50,760 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,769 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,782 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {540#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:50,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {540#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:50,804 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,805 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,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(0 != ~swapped~0); {516#false} is VALID [2018-11-23 11:51:50,805 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,806 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,806 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,806 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,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 11:51:50,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 11:51:50,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 11:51:50,808 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,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:50,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 11:51:50,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:50,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:50,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:51:50,940 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,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:51:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:51:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:51:50,941 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2018-11-23 11:51:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,610 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 11:51:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:51,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:51:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 11:51:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:51:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2018-11-23 11:51:51,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2018-11-23 11:51:51,781 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,784 INFO L225 Difference]: With dead ends: 59 [2018-11-23 11:51:51,784 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:51:51,785 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,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:51:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 11:51:51,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:51,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,803 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,803 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-23 11:51:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,806 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 11:51:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 11:51:51,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,808 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-23 11:51:51,808 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-23 11:51:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,810 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 11:51:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2018-11-23 11:51:51,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:51,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:51,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:51,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:51:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 11:51:51,814 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2018-11-23 11:51:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,814 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 11:51:51,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:51:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 11:51:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:51:51,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,816 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,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1329439089, now seen corresponding path program 2 times [2018-11-23 11:51:51,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:51,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2018-11-23 11:51:51,959 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,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2018-11-23 11:51:51,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #79#return; {781#true} is VALID [2018-11-23 11:51:51,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret8 := main(); {781#true} is VALID [2018-11-23 11:51:51,961 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,968 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,970 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {783#(= main_~i~0 1)} is VALID [2018-11-23 11:51:51,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {783#(= main_~i~0 1)} is VALID [2018-11-23 11:51:51,972 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,974 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:51,977 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,978 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,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {782#false} assume !(0 != ~swapped~0); {782#false} is VALID [2018-11-23 11:51:51,979 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,979 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,979 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,979 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,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {782#false} ~cond := #in~cond; {782#false} is VALID [2018-11-23 11:51:51,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {782#false} assume 0 == ~cond; {782#false} is VALID [2018-11-23 11:51:51,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {782#false} assume !false; {782#false} is VALID [2018-11-23 11:51:51,981 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,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:51,982 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,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:52,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:52,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2018-11-23 11:51:52,122 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:52,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2018-11-23 11:51:52,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #79#return; {781#true} is VALID [2018-11-23 11:51:52,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret8 := main(); {781#true} is VALID [2018-11-23 11:51:52,123 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:52,127 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:52,127 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {807#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {807#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:52,129 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:52,130 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {784#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,131 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:52,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {785#(<= main_~i~0 3)} assume !(~i~0 < 100000); {782#false} is VALID [2018-11-23 11:51:52,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {782#false} assume !(0 != ~swapped~0); {782#false} is VALID [2018-11-23 11:51:52,133 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:52,133 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:52,133 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:52,134 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:52,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {782#false} ~cond := #in~cond; {782#false} is VALID [2018-11-23 11:51:52,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {782#false} assume 0 == ~cond; {782#false} is VALID [2018-11-23 11:51:52,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {782#false} assume !false; {782#false} is VALID [2018-11-23 11:51:52,137 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:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:52,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 11:51:52,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:51:52,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:52,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:51:52,207 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:52,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:51:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:51:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:51:52,209 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2018-11-23 11:51:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,402 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-23 11:51:52,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:52,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 11:51:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:51:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:51:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:51:52,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-23 11:51:52,557 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:52,559 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:51:52,560 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:51:52,560 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:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:51:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-23 11:51:52,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:52,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:52,603 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:52,603 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2018-11-23 11:51:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,605 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:51:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 11:51:52,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,606 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2018-11-23 11:51:52,606 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2018-11-23 11:51:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:52,609 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 11:51:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2018-11-23 11:51:52,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:52,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:52,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:52,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:51:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 11:51:52,612 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 22 [2018-11-23 11:51:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:52,613 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 11:51:52,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:51:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 11:51:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:51:52,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:52,614 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:52,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:52,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 139123816, now seen corresponding path program 3 times [2018-11-23 11:51:52,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:52,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:51:52,767 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,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:51:52,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #79#return; {1092#true} is VALID [2018-11-23 11:51:52,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret8 := main(); {1092#true} is VALID [2018-11-23 11:51:52,768 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,773 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,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1094#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {1094#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1094#(= main_~i~0 1)} is VALID [2018-11-23 11:51:52,778 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,781 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {1095#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:52,783 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,784 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {1096#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:52,789 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,791 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,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(0 != ~swapped~0); {1093#false} is VALID [2018-11-23 11:51:52,791 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,791 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,792 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,792 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,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:51:52,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 11:51:52,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:51:52,794 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,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:52,795 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,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:51:52,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:51:52,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:52,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:52,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2018-11-23 11:51:52,995 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,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2018-11-23 11:51:52,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #79#return; {1092#true} is VALID [2018-11-23 11:51:52,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret8 := main(); {1092#true} is VALID [2018-11-23 11:51:52,996 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:53,001 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:53,004 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1119#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1119#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:53,009 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:53,009 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {1095#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1095#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,011 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:53,013 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {1096#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1096#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,015 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:53,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {1097#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1093#false} is VALID [2018-11-23 11:51:53,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {1093#false} assume !(0 != ~swapped~0); {1093#false} is VALID [2018-11-23 11:51:53,016 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:53,016 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:53,016 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:53,016 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:53,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#false} ~cond := #in~cond; {1093#false} is VALID [2018-11-23 11:51:53,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#false} assume 0 == ~cond; {1093#false} is VALID [2018-11-23 11:51:53,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2018-11-23 11:51:53,018 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:53,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:53,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:51:53,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:53,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:53,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:51:53,142 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:53,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:51:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:51:53,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,144 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2018-11-23 11:51:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,354 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-11-23 11:51:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:51:53,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 11:51:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:51:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:51:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 11:51:53,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 11:51:53,430 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:53,432 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:51:53,432 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:51:53,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:51:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:51:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 11:51:53,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:53,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:53,502 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:53,502 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-23 11:51:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,504 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 11:51:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 11:51:53,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,506 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-23 11:51:53,506 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-23 11:51:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:53,508 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 11:51:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 11:51:53,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:53,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:53,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:53,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:51:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-11-23 11:51:53,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 25 [2018-11-23 11:51:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:53,513 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-11-23 11:51:53,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:51:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 11:51:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:51:53,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:53,514 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:53,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:53,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1293178351, now seen corresponding path program 4 times [2018-11-23 11:51:53,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:53,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:53,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:53,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {1449#true} call ULTIMATE.init(); {1449#true} is VALID [2018-11-23 11:51:53,634 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,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {1449#true} assume true; {1449#true} is VALID [2018-11-23 11:51:53,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1449#true} {1449#true} #79#return; {1449#true} is VALID [2018-11-23 11:51:53,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {1449#true} call #t~ret8 := main(); {1449#true} is VALID [2018-11-23 11:51:53,635 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,635 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:53,636 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1451#(= main_~i~0 1)} is VALID [2018-11-23 11:51:53,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {1451#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1451#(= main_~i~0 1)} is VALID [2018-11-23 11:51:53,637 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:53,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {1452#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:53,640 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,640 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {1453#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:53,643 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,646 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:53,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {1454#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:53,647 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,648 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,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {1450#false} assume !(0 != ~swapped~0); {1450#false} is VALID [2018-11-23 11:51:53,649 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,649 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,650 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,650 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,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#false} ~cond := #in~cond; {1450#false} is VALID [2018-11-23 11:51:53,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#false} assume 0 == ~cond; {1450#false} is VALID [2018-11-23 11:51:53,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {1450#false} assume !false; {1450#false} is VALID [2018-11-23 11:51:53,654 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,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:53,654 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:53,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:51:53,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:51:53,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:53,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {1449#true} call ULTIMATE.init(); {1449#true} is VALID [2018-11-23 11:51:54,052 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:54,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {1449#true} assume true; {1449#true} is VALID [2018-11-23 11:51:54,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1449#true} {1449#true} #79#return; {1449#true} is VALID [2018-11-23 11:51:54,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {1449#true} call #t~ret8 := main(); {1449#true} is VALID [2018-11-23 11:51:54,053 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:54,059 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:54,060 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1477#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {1477#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1477#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,062 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:54,063 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {1452#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1452#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,065 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:54,065 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {1453#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1453#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,067 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:54,068 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {1454#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1454#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,070 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:54,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {1455#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1450#false} is VALID [2018-11-23 11:51:54,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {1450#false} assume !(0 != ~swapped~0); {1450#false} is VALID [2018-11-23 11:51:54,071 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:54,072 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:54,072 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:54,073 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:54,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#false} ~cond := #in~cond; {1450#false} is VALID [2018-11-23 11:51:54,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {1450#false} assume 0 == ~cond; {1450#false} is VALID [2018-11-23 11:51:54,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {1450#false} assume !false; {1450#false} is VALID [2018-11-23 11:51:54,076 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:54,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 11:51:54,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:51:54,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:51:54,143 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:54,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,144 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 8 states. [2018-11-23 11:51:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,425 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2018-11-23 11:51:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:54,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 11:51:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2018-11-23 11:51:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:51:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2018-11-23 11:51:54,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2018-11-23 11:51:54,520 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:54,522 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:51:54,523 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:51:54,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:51:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-23 11:51:54,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:54,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:54,565 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:54,565 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2018-11-23 11:51:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,568 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 11:51:54,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-23 11:51:54,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,569 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2018-11-23 11:51:54,569 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2018-11-23 11:51:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:54,571 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 11:51:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-23 11:51:54,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:54,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:54,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:54,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:51:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-11-23 11:51:54,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 28 [2018-11-23 11:51:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:54,575 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-11-23 11:51:54,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-11-23 11:51:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:54,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:54,576 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:54,577 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:54,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -506949688, now seen corresponding path program 5 times [2018-11-23 11:51:54,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:54,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2018-11-23 11:51:54,713 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,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {1852#true} assume true; {1852#true} is VALID [2018-11-23 11:51:54,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} #79#return; {1852#true} is VALID [2018-11-23 11:51:54,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {1852#true} call #t~ret8 := main(); {1852#true} is VALID [2018-11-23 11:51:54,714 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,715 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,715 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1854#(= main_~i~0 1)} is VALID [2018-11-23 11:51:54,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1854#(= main_~i~0 1)} is VALID [2018-11-23 11:51:54,716 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,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {1855#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,718 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,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {1856#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,720 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,721 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,722 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,723 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {1858#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,725 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,729 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,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {1853#false} assume !(0 != ~swapped~0); {1853#false} is VALID [2018-11-23 11:51:54,730 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,730 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,730 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,730 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,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {1853#false} ~cond := #in~cond; {1853#false} is VALID [2018-11-23 11:51:54,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {1853#false} assume 0 == ~cond; {1853#false} is VALID [2018-11-23 11:51:54,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2018-11-23 11:51:54,732 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,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:54,732 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,743 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:51:54,793 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:51:54,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:54,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:54,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {1852#true} call ULTIMATE.init(); {1852#true} is VALID [2018-11-23 11:51:54,925 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,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {1852#true} assume true; {1852#true} is VALID [2018-11-23 11:51:54,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1852#true} {1852#true} #79#return; {1852#true} is VALID [2018-11-23 11:51:54,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {1852#true} call #t~ret8 := main(); {1852#true} is VALID [2018-11-23 11:51:54,927 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,932 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,933 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1881#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {1881#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1881#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:54,940 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,940 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {1855#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1855#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:54,941 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,941 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {1856#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1856#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:54,942 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,943 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {1857#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1857#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:54,944 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,945 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {1858#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {1858#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:54,946 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,947 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,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {1853#false} assume !(0 != ~swapped~0); {1853#false} is VALID [2018-11-23 11:51:54,948 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,948 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,949 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,949 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,949 INFO L273 TraceCheckUtils]: 28: Hoare triple {1853#false} ~cond := #in~cond; {1853#false} is VALID [2018-11-23 11:51:54,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {1853#false} assume 0 == ~cond; {1853#false} is VALID [2018-11-23 11:51:54,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {1853#false} assume !false; {1853#false} is VALID [2018-11-23 11:51:54,953 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,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:54,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 11:51:54,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:54,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:54,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:51:55,113 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:55,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:51:55,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:51:55,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:51:55,115 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 9 states. [2018-11-23 11:51:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,360 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2018-11-23 11:51:55,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:55,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 11:51:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:51:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:51:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2018-11-23 11:51:55,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2018-11-23 11:51:55,652 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:55,654 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:51:55,654 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:51:55,655 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:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:51:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-23 11:51:55,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:55,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:55,712 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:55,712 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 57 states. [2018-11-23 11:51:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,716 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 11:51:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2018-11-23 11:51:55,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,716 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 61 states. [2018-11-23 11:51:55,716 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 61 states. [2018-11-23 11:51:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:55,718 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 11:51:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2018-11-23 11:51:55,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:55,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:55,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:55,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:51:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2018-11-23 11:51:55,721 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 31 [2018-11-23 11:51:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:55,722 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2018-11-23 11:51:55,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:51:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-23 11:51:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:51:55,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:55,723 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:55,723 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:55,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1574484657, now seen corresponding path program 6 times [2018-11-23 11:51:55,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:55,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:55,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:55,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {2301#true} call ULTIMATE.init(); {2301#true} is VALID [2018-11-23 11:51:55,918 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,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {2301#true} assume true; {2301#true} is VALID [2018-11-23 11:51:55,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2301#true} {2301#true} #79#return; {2301#true} is VALID [2018-11-23 11:51:55,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {2301#true} call #t~ret8 := main(); {2301#true} is VALID [2018-11-23 11:51:55,919 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,920 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,923 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2303#(= main_~i~0 1)} is VALID [2018-11-23 11:51:55,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {2303#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2303#(= main_~i~0 1)} is VALID [2018-11-23 11:51:55,924 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,924 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {2304#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:55,925 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,927 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:55,928 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,929 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {2306#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:55,933 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,933 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:55,935 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,936 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {2308#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:55,938 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,939 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,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {2302#false} assume !(0 != ~swapped~0); {2302#false} is VALID [2018-11-23 11:51:55,940 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,940 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,940 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,941 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,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {2302#false} ~cond := #in~cond; {2302#false} is VALID [2018-11-23 11:51:55,941 INFO L273 TraceCheckUtils]: 32: Hoare triple {2302#false} assume 0 == ~cond; {2302#false} is VALID [2018-11-23 11:51:55,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2018-11-23 11:51:55,944 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,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:55,945 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,953 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:51:55,981 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 11:51:55,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:56,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:56,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {2301#true} call ULTIMATE.init(); {2301#true} is VALID [2018-11-23 11:51:56,131 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:56,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {2301#true} assume true; {2301#true} is VALID [2018-11-23 11:51:56,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2301#true} {2301#true} #79#return; {2301#true} is VALID [2018-11-23 11:51:56,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {2301#true} call #t~ret8 := main(); {2301#true} is VALID [2018-11-23 11:51:56,132 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:56,133 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:56,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2331#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:56,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {2331#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2331#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:56,135 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:56,136 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:56,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {2304#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2304#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:56,137 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:56,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:56,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {2305#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2305#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:56,140 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:56,141 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:56,142 INFO L273 TraceCheckUtils]: 17: Hoare triple {2306#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2306#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:56,143 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:56,149 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:56,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2307#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:56,150 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:56,152 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:56,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {2308#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2308#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:56,153 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:56,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {2309#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2302#false} is VALID [2018-11-23 11:51:56,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {2302#false} assume !(0 != ~swapped~0); {2302#false} is VALID [2018-11-23 11:51:56,154 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:56,154 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:56,154 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:56,155 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:56,155 INFO L273 TraceCheckUtils]: 31: Hoare triple {2302#false} ~cond := #in~cond; {2302#false} is VALID [2018-11-23 11:51:56,155 INFO L273 TraceCheckUtils]: 32: Hoare triple {2302#false} assume 0 == ~cond; {2302#false} is VALID [2018-11-23 11:51:56,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {2302#false} assume !false; {2302#false} is VALID [2018-11-23 11:51:56,157 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:56,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:56,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 11:51:56,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:51:56,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:56,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:51:56,239 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:56,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:51:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:51:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:56,240 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 10 states. [2018-11-23 11:51:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:56,744 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2018-11-23 11:51:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:56,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 11:51:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-11-23 11:51:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:51:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-11-23 11:51:56,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2018-11-23 11:51:57,055 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:57,057 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:51:57,057 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:51:57,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:51:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-23 11:51:57,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:57,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:57,095 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:57,095 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 63 states. [2018-11-23 11:51:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,099 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 11:51:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-11-23 11:51:57,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,099 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 67 states. [2018-11-23 11:51:57,100 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 67 states. [2018-11-23 11:51:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:57,102 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-23 11:51:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-11-23 11:51:57,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:57,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:57,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:57,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:51:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-11-23 11:51:57,105 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 34 [2018-11-23 11:51:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:57,106 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-11-23 11:51:57,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:51:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-11-23 11:51:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:51:57,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:57,107 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:57,107 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:57,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:57,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1152763096, now seen corresponding path program 7 times [2018-11-23 11:51:57,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:57,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:51:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 11:51:58,015 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:58,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 11:51:58,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #79#return; {2796#true} is VALID [2018-11-23 11:51:58,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 11:51:58,016 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:58,016 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:58,018 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2798#(= main_~i~0 1)} is VALID [2018-11-23 11:51:58,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {2798#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2798#(= main_~i~0 1)} is VALID [2018-11-23 11:51:58,022 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:58,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {2799#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,025 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:58,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {2800#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,029 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:58,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {2801#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,032 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:58,034 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {2802#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,037 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:58,040 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {2803#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,043 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:58,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,046 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:58,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2797#false} is VALID [2018-11-23 11:51:58,049 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} assume !(0 != ~swapped~0); {2797#false} is VALID [2018-11-23 11:51:58,049 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:58,049 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:58,049 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:58,049 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:58,050 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 11:51:58,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 11:51:58,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 11:51:58,051 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:58,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:58,051 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:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:58,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:58,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 11:51:58,218 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:58,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 11:51:58,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #79#return; {2796#true} is VALID [2018-11-23 11:51:58,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret8 := main(); {2796#true} is VALID [2018-11-23 11:51:58,219 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:58,220 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:58,221 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2827#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {2827#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2827#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:58,222 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:58,223 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {2799#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2799#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:58,224 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:58,225 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {2800#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2800#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:58,226 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:58,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {2801#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2801#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:58,228 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:58,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {2802#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2802#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:58,230 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:58,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {2803#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2803#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:58,236 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:58,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {2804#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:58,237 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:58,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2797#false} is VALID [2018-11-23 11:51:58,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} assume !(0 != ~swapped~0); {2797#false} is VALID [2018-11-23 11:51:58,238 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:58,238 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:58,238 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:58,238 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:58,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 11:51:58,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} assume 0 == ~cond; {2797#false} is VALID [2018-11-23 11:51:58,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 11:51:58,240 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:58,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:58,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 11:51:58,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:58,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:58,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:51:58,302 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:58,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:51:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:51:58,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:58,303 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 11 states. [2018-11-23 11:51:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:58,972 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2018-11-23 11:51:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:51:58,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 11:51:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 11:51:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:51:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-23 11:51:58,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-23 11:51:59,107 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:59,109 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:51:59,109 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:51:59,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:51:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:51:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-23 11:51:59,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:51:59,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:59,150 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:59,150 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2018-11-23 11:51:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,152 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-23 11:51:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2018-11-23 11:51:59,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,153 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2018-11-23 11:51:59,153 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2018-11-23 11:51:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,155 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-11-23 11:51:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2018-11-23 11:51:59,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:51:59,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:51:59,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:51:59,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:51:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:51:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-11-23 11:51:59,157 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 37 [2018-11-23 11:51:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:59,158 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-11-23 11:51:59,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:51:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-11-23 11:51:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:51:59,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:59,159 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:59,159 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:59,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash -694234287, now seen corresponding path program 8 times [2018-11-23 11:51:59,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:59,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:59,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3337#true} is VALID [2018-11-23 11:51:59,341 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:59,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2018-11-23 11:51:59,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #79#return; {3337#true} is VALID [2018-11-23 11:51:59,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret8 := main(); {3337#true} is VALID [2018-11-23 11:51:59,342 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:59,343 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:59,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3339#(= main_~i~0 1)} is VALID [2018-11-23 11:51:59,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {3339#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3339#(= main_~i~0 1)} is VALID [2018-11-23 11:51:59,344 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:59,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {3340#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,345 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:59,345 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {3341#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,347 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:59,347 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {3342#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,349 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:59,350 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {3343#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,351 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:59,352 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {3344#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,353 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:59,353 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {3345#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,355 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:59,356 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {3346#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,357 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:59,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {3347#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3338#false} is VALID [2018-11-23 11:51:59,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {3338#false} assume !(0 != ~swapped~0); {3338#false} is VALID [2018-11-23 11:51:59,358 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:59,358 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:59,359 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:59,359 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:59,359 INFO L273 TraceCheckUtils]: 37: Hoare triple {3338#false} ~cond := #in~cond; {3338#false} is VALID [2018-11-23 11:51:59,359 INFO L273 TraceCheckUtils]: 38: Hoare triple {3338#false} assume 0 == ~cond; {3338#false} is VALID [2018-11-23 11:51:59,359 INFO L273 TraceCheckUtils]: 39: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2018-11-23 11:51:59,361 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:59,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:59,362 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:59,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:51:59,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:51:59,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:51:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:59,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:59,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3337#true} is VALID [2018-11-23 11:51:59,563 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:59,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2018-11-23 11:51:59,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #79#return; {3337#true} is VALID [2018-11-23 11:51:59,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret8 := main(); {3337#true} is VALID [2018-11-23 11:51:59,564 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:59,565 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:59,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3369#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {3369#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3369#(<= main_~i~0 1)} is VALID [2018-11-23 11:51:59,567 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:59,567 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {3340#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3340#(<= main_~i~0 2)} is VALID [2018-11-23 11:51:59,568 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:59,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {3341#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3341#(<= main_~i~0 3)} is VALID [2018-11-23 11:51:59,570 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:59,571 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {3342#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3342#(<= main_~i~0 4)} is VALID [2018-11-23 11:51:59,572 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:59,573 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {3343#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3343#(<= main_~i~0 5)} is VALID [2018-11-23 11:51:59,578 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:59,578 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {3344#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3344#(<= main_~i~0 6)} is VALID [2018-11-23 11:51:59,579 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:59,579 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {3345#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3345#(<= main_~i~0 7)} is VALID [2018-11-23 11:51:59,580 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:59,581 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {3346#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3346#(<= main_~i~0 8)} is VALID [2018-11-23 11:51:59,582 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:59,583 INFO L273 TraceCheckUtils]: 31: Hoare triple {3347#(<= main_~i~0 9)} assume !(~i~0 < 100000); {3338#false} is VALID [2018-11-23 11:51:59,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {3338#false} assume !(0 != ~swapped~0); {3338#false} is VALID [2018-11-23 11:51:59,583 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:59,584 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:59,584 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:59,584 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:59,585 INFO L273 TraceCheckUtils]: 37: Hoare triple {3338#false} ~cond := #in~cond; {3338#false} is VALID [2018-11-23 11:51:59,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {3338#false} assume 0 == ~cond; {3338#false} is VALID [2018-11-23 11:51:59,585 INFO L273 TraceCheckUtils]: 39: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2018-11-23 11:51:59,587 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:59,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:59,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 11:51:59,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:51:59,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:51:59,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:51:59,659 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:59,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:59,660 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 12 states. [2018-11-23 11:51:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:59,924 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2018-11-23 11:51:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:51:59,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-11-23 11:51:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-23 11:51:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:51:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-23 11:51:59,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-23 11:52:00,051 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:52:00,053 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:52:00,053 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 11:52:00,054 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:52:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 11:52:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-11-23 11:52:00,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:00,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 75 states. [2018-11-23 11:52:00,088 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 75 states. [2018-11-23 11:52:00,088 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 75 states. [2018-11-23 11:52:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,091 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:52:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2018-11-23 11:52:00,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,092 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 79 states. [2018-11-23 11:52:00,092 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 79 states. [2018-11-23 11:52:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:00,094 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2018-11-23 11:52:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2018-11-23 11:52:00,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:00,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:00,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:00,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 11:52:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2018-11-23 11:52:00,098 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 40 [2018-11-23 11:52:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:00,098 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-11-23 11:52:00,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:52:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2018-11-23 11:52:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 11:52:00,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:00,099 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:52:00,100 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:00,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1341513352, now seen corresponding path program 9 times [2018-11-23 11:52:00,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {3924#true} call ULTIMATE.init(); {3924#true} is VALID [2018-11-23 11:52:00,341 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:52:00,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {3924#true} assume true; {3924#true} is VALID [2018-11-23 11:52:00,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3924#true} {3924#true} #79#return; {3924#true} is VALID [2018-11-23 11:52:00,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {3924#true} call #t~ret8 := main(); {3924#true} is VALID [2018-11-23 11:52:00,342 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:52:00,342 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:52:00,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3926#(= main_~i~0 1)} is VALID [2018-11-23 11:52:00,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {3926#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3926#(= main_~i~0 1)} is VALID [2018-11-23 11:52:00,344 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:52:00,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:00,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {3927#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:00,345 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:52:00,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:00,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {3928#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:00,347 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:52:00,348 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:00,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {3929#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:00,349 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:52:00,350 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:00,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {3930#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:00,351 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:52:00,352 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:00,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {3931#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:00,353 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:52:00,354 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:00,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {3932#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:00,355 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:52:00,356 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:00,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {3933#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:00,357 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:52:00,358 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:00,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {3934#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:00,359 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:52:00,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {3935#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3925#false} is VALID [2018-11-23 11:52:00,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {3925#false} assume !(0 != ~swapped~0); {3925#false} is VALID [2018-11-23 11:52:00,361 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:52:00,361 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:52:00,361 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:52:00,361 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:52:00,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {3925#false} ~cond := #in~cond; {3925#false} is VALID [2018-11-23 11:52:00,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {3925#false} assume 0 == ~cond; {3925#false} is VALID [2018-11-23 11:52:00,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {3925#false} assume !false; {3925#false} is VALID [2018-11-23 11:52:00,364 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:52:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:00,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:52:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:00,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:52:00,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:00,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:00,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {3924#true} call ULTIMATE.init(); {3924#true} is VALID [2018-11-23 11:52:00,679 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:52:00,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {3924#true} assume true; {3924#true} is VALID [2018-11-23 11:52:00,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3924#true} {3924#true} #79#return; {3924#true} is VALID [2018-11-23 11:52:00,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {3924#true} call #t~ret8 := main(); {3924#true} is VALID [2018-11-23 11:52:00,680 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:52:00,681 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:52:00,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3957#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:00,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {3957#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3957#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:00,682 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:52:00,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:00,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {3927#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3927#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:00,683 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:52:00,683 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:00,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {3928#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3928#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:00,684 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:52:00,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:00,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {3929#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3929#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:00,691 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:52:00,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:00,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {3930#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3930#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:00,692 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:52:00,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:00,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {3931#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3931#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:00,693 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:52:00,693 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:00,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {3932#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3932#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:00,694 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:52:00,695 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:00,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {3933#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3933#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:00,696 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:52:00,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:00,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {3934#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {3934#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:00,698 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:52:00,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {3935#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3925#false} is VALID [2018-11-23 11:52:00,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {3925#false} assume !(0 != ~swapped~0); {3925#false} is VALID [2018-11-23 11:52:00,699 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:52:00,700 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:52:00,700 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:52:00,700 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:52:00,700 INFO L273 TraceCheckUtils]: 40: Hoare triple {3925#false} ~cond := #in~cond; {3925#false} is VALID [2018-11-23 11:52:00,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {3925#false} assume 0 == ~cond; {3925#false} is VALID [2018-11-23 11:52:00,701 INFO L273 TraceCheckUtils]: 42: Hoare triple {3925#false} assume !false; {3925#false} is VALID [2018-11-23 11:52:00,702 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:52:00,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:00,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 11:52:00,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:52:00,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:00,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:52:00,772 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:52:00,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:52:00,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:52:00,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:52:00,774 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 13 states. [2018-11-23 11:52:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:01,127 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2018-11-23 11:52:01,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:52:01,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 11:52:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 11:52:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:52:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2018-11-23 11:52:01,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 89 transitions. [2018-11-23 11:52:02,070 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:02,074 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:52:02,074 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:52:02,074 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:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:52:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-23 11:52:02,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:02,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:02,125 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:02,125 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2018-11-23 11:52:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,128 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 11:52:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2018-11-23 11:52:02,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,129 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2018-11-23 11:52:02,129 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2018-11-23 11:52:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:02,131 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 11:52:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2018-11-23 11:52:02,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:02,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:02,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:02,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:52:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2018-11-23 11:52:02,134 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 43 [2018-11-23 11:52:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2018-11-23 11:52:02,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:52:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2018-11-23 11:52:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:52:02,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:02,136 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:02,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:02,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -933760015, now seen corresponding path program 10 times [2018-11-23 11:52:02,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:02,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {4557#true} call ULTIMATE.init(); {4557#true} is VALID [2018-11-23 11:52:02,822 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:02,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {4557#true} assume true; {4557#true} is VALID [2018-11-23 11:52:02,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4557#true} {4557#true} #79#return; {4557#true} is VALID [2018-11-23 11:52:02,822 INFO L256 TraceCheckUtils]: 4: Hoare triple {4557#true} call #t~ret8 := main(); {4557#true} is VALID [2018-11-23 11:52:02,822 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:02,823 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:02,824 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4559#(= main_~i~0 1)} is VALID [2018-11-23 11:52:02,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {4559#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4559#(= main_~i~0 1)} is VALID [2018-11-23 11:52:02,825 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:02,825 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:02,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {4560#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:02,826 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:02,826 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:02,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {4561#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:02,828 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:02,829 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:02,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {4562#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:02,830 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:02,831 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:02,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {4563#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:02,832 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:02,833 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:02,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {4564#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:02,834 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:02,835 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:02,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {4565#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:02,836 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:02,837 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:02,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {4566#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:02,838 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:02,839 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:02,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {4567#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:02,840 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:02,841 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:02,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {4568#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:02,842 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:02,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {4569#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4558#false} is VALID [2018-11-23 11:52:02,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#false} assume !(0 != ~swapped~0); {4558#false} is VALID [2018-11-23 11:52:02,844 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:02,844 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:02,844 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:02,845 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:02,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {4558#false} ~cond := #in~cond; {4558#false} is VALID [2018-11-23 11:52:02,845 INFO L273 TraceCheckUtils]: 44: Hoare triple {4558#false} assume 0 == ~cond; {4558#false} is VALID [2018-11-23 11:52:02,845 INFO L273 TraceCheckUtils]: 45: Hoare triple {4558#false} assume !false; {4558#false} is VALID [2018-11-23 11:52:02,848 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,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:02,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 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:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:02,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:02,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:02,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:03,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {4557#true} call ULTIMATE.init(); {4557#true} is VALID [2018-11-23 11:52:03,209 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:03,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {4557#true} assume true; {4557#true} is VALID [2018-11-23 11:52:03,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4557#true} {4557#true} #79#return; {4557#true} is VALID [2018-11-23 11:52:03,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {4557#true} call #t~ret8 := main(); {4557#true} is VALID [2018-11-23 11:52:03,210 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:03,210 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:03,211 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4591#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:03,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {4591#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4591#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:03,213 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:03,216 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:03,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {4560#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4560#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:03,228 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:03,230 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:03,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {4561#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4561#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:03,252 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:03,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:03,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {4562#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4562#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:03,256 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:03,258 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:03,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {4563#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4563#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:03,260 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:03,260 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:03,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {4564#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4564#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:03,262 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:03,265 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:03,265 INFO L273 TraceCheckUtils]: 26: Hoare triple {4565#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4565#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:03,267 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:03,267 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:03,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {4566#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4566#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:03,270 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:03,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:03,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {4567#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4567#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:03,275 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:03,275 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:03,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {4568#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {4568#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:03,277 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:03,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {4569#(<= main_~i~0 11)} assume !(~i~0 < 100000); {4558#false} is VALID [2018-11-23 11:52:03,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#false} assume !(0 != ~swapped~0); {4558#false} is VALID [2018-11-23 11:52:03,280 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:03,280 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:03,280 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:03,280 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:03,280 INFO L273 TraceCheckUtils]: 43: Hoare triple {4558#false} ~cond := #in~cond; {4558#false} is VALID [2018-11-23 11:52:03,281 INFO L273 TraceCheckUtils]: 44: Hoare triple {4558#false} assume 0 == ~cond; {4558#false} is VALID [2018-11-23 11:52:03,281 INFO L273 TraceCheckUtils]: 45: Hoare triple {4558#false} assume !false; {4558#false} is VALID [2018-11-23 11:52:03,282 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:03,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:03,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 11:52:03,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:52:03,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:03,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:52:03,400 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:03,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:52:03,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:52:03,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:52:03,401 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand 14 states. [2018-11-23 11:52:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:03,789 INFO L93 Difference]: Finished difference Result 166 states and 218 transitions. [2018-11-23 11:52:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:52:03,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-11-23 11:52:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2018-11-23 11:52:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:52:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2018-11-23 11:52:03,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 93 transitions. [2018-11-23 11:52:04,301 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:04,305 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:52:04,305 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:52:04,306 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:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:52:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-11-23 11:52:04,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:04,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:04,439 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:04,439 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 87 states. [2018-11-23 11:52:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,444 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-23 11:52:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2018-11-23 11:52:04,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,445 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 91 states. [2018-11-23 11:52:04,446 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 91 states. [2018-11-23 11:52:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:04,448 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-23 11:52:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2018-11-23 11:52:04,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:04,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:04,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:04,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:52:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2018-11-23 11:52:04,452 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 46 [2018-11-23 11:52:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:04,452 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2018-11-23 11:52:04,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:52:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2018-11-23 11:52:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:52:04,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:04,453 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:04,454 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:04,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash -428770840, now seen corresponding path program 11 times [2018-11-23 11:52:04,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:04,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2018-11-23 11:52:05,033 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:05,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {5236#true} assume true; {5236#true} is VALID [2018-11-23 11:52:05,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5236#true} {5236#true} #79#return; {5236#true} is VALID [2018-11-23 11:52:05,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {5236#true} call #t~ret8 := main(); {5236#true} is VALID [2018-11-23 11:52:05,034 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:05,035 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:05,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5238#(= main_~i~0 1)} is VALID [2018-11-23 11:52:05,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {5238#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5238#(= main_~i~0 1)} is VALID [2018-11-23 11:52:05,037 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:05,037 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,039 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:05,039 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,041 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:05,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {5241#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,043 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:05,044 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,045 INFO L273 TraceCheckUtils]: 20: Hoare triple {5242#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,045 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:05,046 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {5243#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,048 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:05,048 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {5244#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,070 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:05,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {5245#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,089 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:05,090 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {5246#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,091 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:05,091 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {5247#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,092 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:05,092 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {5248#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,094 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:05,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5237#false} is VALID [2018-11-23 11:52:05,095 INFO L273 TraceCheckUtils]: 41: Hoare triple {5237#false} assume !(0 != ~swapped~0); {5237#false} is VALID [2018-11-23 11:52:05,095 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:05,096 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:05,096 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:05,096 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:05,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {5237#false} ~cond := #in~cond; {5237#false} is VALID [2018-11-23 11:52:05,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {5237#false} assume 0 == ~cond; {5237#false} is VALID [2018-11-23 11:52:05,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2018-11-23 11:52:05,100 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:05,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:05,101 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:05,113 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:05,167 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:52:05,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:05,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:05,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {5236#true} call ULTIMATE.init(); {5236#true} is VALID [2018-11-23 11:52:05,412 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:05,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {5236#true} assume true; {5236#true} is VALID [2018-11-23 11:52:05,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5236#true} {5236#true} #79#return; {5236#true} is VALID [2018-11-23 11:52:05,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {5236#true} call #t~ret8 := main(); {5236#true} is VALID [2018-11-23 11:52:05,413 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:05,414 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:05,414 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5271#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:05,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {5271#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5271#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:05,415 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:05,415 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {5239#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5239#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:05,416 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:05,417 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,417 INFO L273 TraceCheckUtils]: 14: Hoare triple {5240#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5240#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:05,418 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:05,419 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {5241#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5241#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:05,421 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:05,421 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,422 INFO L273 TraceCheckUtils]: 20: Hoare triple {5242#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5242#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:05,423 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:05,423 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {5243#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5243#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:05,425 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:05,426 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {5244#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5244#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:05,427 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:05,428 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {5245#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5245#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:05,429 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:05,430 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,431 INFO L273 TraceCheckUtils]: 32: Hoare triple {5246#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5246#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:05,431 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:05,453 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {5247#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5247#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:05,475 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:05,489 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,498 INFO L273 TraceCheckUtils]: 38: Hoare triple {5248#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5248#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:05,505 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:05,507 INFO L273 TraceCheckUtils]: 40: Hoare triple {5249#(<= main_~i~0 12)} assume !(~i~0 < 100000); {5237#false} is VALID [2018-11-23 11:52:05,507 INFO L273 TraceCheckUtils]: 41: Hoare triple {5237#false} assume !(0 != ~swapped~0); {5237#false} is VALID [2018-11-23 11:52:05,507 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:05,507 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:05,508 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:05,508 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:05,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {5237#false} ~cond := #in~cond; {5237#false} is VALID [2018-11-23 11:52:05,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {5237#false} assume 0 == ~cond; {5237#false} is VALID [2018-11-23 11:52:05,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {5237#false} assume !false; {5237#false} is VALID [2018-11-23 11:52:05,512 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:05,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:05,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 11:52:05,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:52:05,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:05,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:52:05,619 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:05,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:52:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:52:05,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:05,620 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand 15 states. [2018-11-23 11:52:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:05,887 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2018-11-23 11:52:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:52:05,887 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-11-23 11:52:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-23 11:52:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:52:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 97 transitions. [2018-11-23 11:52:05,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 97 transitions. [2018-11-23 11:52:06,051 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:06,053 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:52:06,053 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:52:06,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:52:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:52:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-23 11:52:06,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:06,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:06,100 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:06,100 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 93 states. [2018-11-23 11:52:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,102 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 11:52:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 11:52:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,102 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 97 states. [2018-11-23 11:52:06,103 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 97 states. [2018-11-23 11:52:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:06,105 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 11:52:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 11:52:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:06,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:06,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:52:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2018-11-23 11:52:06,107 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 49 [2018-11-23 11:52:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:06,108 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2018-11-23 11:52:06,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:52:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2018-11-23 11:52:06,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 11:52:06,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:06,109 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:06,109 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:06,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:06,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1566696303, now seen corresponding path program 12 times [2018-11-23 11:52:06,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:06,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:06,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {5961#true} call ULTIMATE.init(); {5961#true} is VALID [2018-11-23 11:52:06,475 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:06,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {5961#true} assume true; {5961#true} is VALID [2018-11-23 11:52:06,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5961#true} {5961#true} #79#return; {5961#true} is VALID [2018-11-23 11:52:06,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {5961#true} call #t~ret8 := main(); {5961#true} is VALID [2018-11-23 11:52:06,476 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:06,476 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:06,477 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5963#(= main_~i~0 1)} is VALID [2018-11-23 11:52:06,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {5963#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5963#(= main_~i~0 1)} is VALID [2018-11-23 11:52:06,478 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:06,478 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {5964#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,479 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:06,479 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {5965#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,480 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:06,481 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,481 INFO L273 TraceCheckUtils]: 17: Hoare triple {5966#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,482 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:06,483 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {5967#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,484 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:06,485 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:06,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {5968#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:06,486 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:06,487 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:06,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {5969#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:06,488 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:06,489 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:06,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {5970#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:06,490 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:06,491 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:06,491 INFO L273 TraceCheckUtils]: 32: Hoare triple {5971#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:06,492 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:06,492 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:06,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {5972#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:06,494 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:06,494 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:06,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {5973#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:06,496 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:06,496 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:06,497 INFO L273 TraceCheckUtils]: 41: Hoare triple {5974#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:06,498 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:06,498 INFO L273 TraceCheckUtils]: 43: Hoare triple {5975#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5962#false} is VALID [2018-11-23 11:52:06,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {5962#false} assume !(0 != ~swapped~0); {5962#false} is VALID [2018-11-23 11:52:06,499 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:06,499 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:06,499 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:06,500 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:06,500 INFO L273 TraceCheckUtils]: 49: Hoare triple {5962#false} ~cond := #in~cond; {5962#false} is VALID [2018-11-23 11:52:06,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {5962#false} assume 0 == ~cond; {5962#false} is VALID [2018-11-23 11:52:06,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {5962#false} assume !false; {5962#false} is VALID [2018-11-23 11:52:06,503 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:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:06,504 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:06,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:06,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-11-23 11:52:06,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:06,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:06,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {5961#true} call ULTIMATE.init(); {5961#true} is VALID [2018-11-23 11:52:06,863 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:06,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {5961#true} assume true; {5961#true} is VALID [2018-11-23 11:52:06,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5961#true} {5961#true} #79#return; {5961#true} is VALID [2018-11-23 11:52:06,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {5961#true} call #t~ret8 := main(); {5961#true} is VALID [2018-11-23 11:52:06,864 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:06,865 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:06,865 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5997#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {5997#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5997#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:06,866 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:06,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {5964#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5964#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:06,868 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:06,868 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {5965#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5965#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:06,869 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:06,870 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {5966#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5966#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:06,871 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:06,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {5967#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5967#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:06,873 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:06,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:06,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {5968#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5968#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:06,875 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:06,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:06,876 INFO L273 TraceCheckUtils]: 26: Hoare triple {5969#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5969#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:06,877 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:06,878 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:06,878 INFO L273 TraceCheckUtils]: 29: Hoare triple {5970#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5970#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:06,879 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:06,880 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:06,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {5971#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5971#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:06,881 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:06,882 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:06,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {5972#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5972#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:06,883 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:06,883 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:06,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {5973#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5973#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:06,885 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:06,885 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:06,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {5974#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {5974#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:06,887 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:06,887 INFO L273 TraceCheckUtils]: 43: Hoare triple {5975#(<= main_~i~0 13)} assume !(~i~0 < 100000); {5962#false} is VALID [2018-11-23 11:52:06,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {5962#false} assume !(0 != ~swapped~0); {5962#false} is VALID [2018-11-23 11:52:06,888 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:06,888 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:06,888 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:06,888 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:06,889 INFO L273 TraceCheckUtils]: 49: Hoare triple {5962#false} ~cond := #in~cond; {5962#false} is VALID [2018-11-23 11:52:06,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {5962#false} assume 0 == ~cond; {5962#false} is VALID [2018-11-23 11:52:06,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {5962#false} assume !false; {5962#false} is VALID [2018-11-23 11:52:06,892 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:06,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:06,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 11:52:06,911 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:52:06,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:06,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:52:06,973 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:06,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:52:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:52:06,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:06,974 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand 16 states. [2018-11-23 11:52:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,785 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2018-11-23 11:52:07,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:52:07,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-23 11:52:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:52:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:52:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2018-11-23 11:52:07,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 101 transitions. [2018-11-23 11:52:07,944 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:07,946 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:52:07,946 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 11:52:07,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:52:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 11:52:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 11:52:07,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:07,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:07,987 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:07,987 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 99 states. [2018-11-23 11:52:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,989 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2018-11-23 11:52:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2018-11-23 11:52:07,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:07,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:07,990 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 103 states. [2018-11-23 11:52:07,990 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 103 states. [2018-11-23 11:52:07,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:07,992 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2018-11-23 11:52:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2018-11-23 11:52:07,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:07,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:07,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:07,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:52:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2018-11-23 11:52:07,995 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 52 [2018-11-23 11:52:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2018-11-23 11:52:07,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:52:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2018-11-23 11:52:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:52:07,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:07,997 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:07,997 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:07,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:07,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1327297208, now seen corresponding path program 13 times [2018-11-23 11:52:07,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:07,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:07,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:07,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {6732#true} call ULTIMATE.init(); {6732#true} is VALID [2018-11-23 11:52:08,798 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:08,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {6732#true} assume true; {6732#true} is VALID [2018-11-23 11:52:08,799 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6732#true} {6732#true} #79#return; {6732#true} is VALID [2018-11-23 11:52:08,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {6732#true} call #t~ret8 := main(); {6732#true} is VALID [2018-11-23 11:52:08,799 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:08,800 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:08,800 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6734#(= main_~i~0 1)} is VALID [2018-11-23 11:52:08,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {6734#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6734#(= main_~i~0 1)} is VALID [2018-11-23 11:52:08,802 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:08,802 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {6735#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:08,804 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:08,805 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {6736#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:08,806 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:08,806 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {6737#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:08,808 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:08,808 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {6738#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:08,810 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:08,810 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {6739#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:08,811 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:08,812 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:08,813 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:08,814 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {6741#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:08,815 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:08,816 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {6742#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:08,817 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:08,817 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:08,819 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:08,820 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:08,821 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:08,821 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,822 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:08,823 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:08,823 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:08,824 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:08,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {6747#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6733#false} is VALID [2018-11-23 11:52:08,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {6733#false} assume !(0 != ~swapped~0); {6733#false} is VALID [2018-11-23 11:52:08,826 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:08,826 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:08,826 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:08,826 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:08,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {6733#false} ~cond := #in~cond; {6733#false} is VALID [2018-11-23 11:52:08,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {6733#false} assume 0 == ~cond; {6733#false} is VALID [2018-11-23 11:52:08,827 INFO L273 TraceCheckUtils]: 54: Hoare triple {6733#false} assume !false; {6733#false} is VALID [2018-11-23 11:52:08,830 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:08,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:08,830 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:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:08,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:09,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {6732#true} call ULTIMATE.init(); {6732#true} is VALID [2018-11-23 11:52:09,047 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:09,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {6732#true} assume true; {6732#true} is VALID [2018-11-23 11:52:09,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6732#true} {6732#true} #79#return; {6732#true} is VALID [2018-11-23 11:52:09,047 INFO L256 TraceCheckUtils]: 4: Hoare triple {6732#true} call #t~ret8 := main(); {6732#true} is VALID [2018-11-23 11:52:09,048 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:09,048 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:09,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6769#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:09,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {6769#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6769#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:09,050 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:09,050 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:09,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {6735#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6735#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:09,051 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:09,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:09,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {6736#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6736#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:09,053 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:09,054 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:09,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {6737#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6737#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:09,055 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:09,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:09,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {6738#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6738#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:09,057 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:09,057 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:09,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {6739#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6739#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:09,058 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:09,059 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:09,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6740#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:09,060 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:09,061 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:09,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {6741#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6741#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:09,062 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:09,062 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:09,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {6742#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6742#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:09,064 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:09,064 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:09,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6743#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:09,066 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:09,066 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:09,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6744#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:09,068 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:09,068 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:09,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6745#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:09,070 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:09,070 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:09,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {6746#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:09,072 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:09,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {6747#(<= main_~i~0 14)} assume !(~i~0 < 100000); {6733#false} is VALID [2018-11-23 11:52:09,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {6733#false} assume !(0 != ~swapped~0); {6733#false} is VALID [2018-11-23 11:52:09,073 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:09,073 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:09,073 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:09,073 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:09,074 INFO L273 TraceCheckUtils]: 52: Hoare triple {6733#false} ~cond := #in~cond; {6733#false} is VALID [2018-11-23 11:52:09,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {6733#false} assume 0 == ~cond; {6733#false} is VALID [2018-11-23 11:52:09,074 INFO L273 TraceCheckUtils]: 54: Hoare triple {6733#false} assume !false; {6733#false} is VALID [2018-11-23 11:52:09,076 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:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 11:52:09,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:09,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:09,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:52:09,157 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:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:52:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:52:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:52:09,158 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand 17 states. [2018-11-23 11:52:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,636 INFO L93 Difference]: Finished difference Result 202 states and 266 transitions. [2018-11-23 11:52:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:52:09,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 11:52:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 105 transitions. [2018-11-23 11:52:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:52:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 105 transitions. [2018-11-23 11:52:09,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 105 transitions. [2018-11-23 11:52:09,804 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:09,807 INFO L225 Difference]: With dead ends: 202 [2018-11-23 11:52:09,807 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:52:09,808 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:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:52:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-23 11:52:09,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:09,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:09,870 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:09,870 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 105 states. [2018-11-23 11:52:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,874 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2018-11-23 11:52:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-11-23 11:52:09,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,875 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 109 states. [2018-11-23 11:52:09,875 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 109 states. [2018-11-23 11:52:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:09,877 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2018-11-23 11:52:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-11-23 11:52:09,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:09,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:09,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:09,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:52:09,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2018-11-23 11:52:09,880 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 55 [2018-11-23 11:52:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:09,881 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2018-11-23 11:52:09,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:52:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2018-11-23 11:52:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:52:09,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:09,882 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:09,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:09,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash 965430577, now seen corresponding path program 14 times [2018-11-23 11:52:09,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:09,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {7549#true} call ULTIMATE.init(); {7549#true} is VALID [2018-11-23 11:52:10,714 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:10,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {7549#true} assume true; {7549#true} is VALID [2018-11-23 11:52:10,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7549#true} {7549#true} #79#return; {7549#true} is VALID [2018-11-23 11:52:10,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {7549#true} call #t~ret8 := main(); {7549#true} is VALID [2018-11-23 11:52:10,715 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:10,716 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:10,716 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7551#(= main_~i~0 1)} is VALID [2018-11-23 11:52:10,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {7551#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7551#(= main_~i~0 1)} is VALID [2018-11-23 11:52:10,717 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:10,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {7552#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:10,718 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:10,718 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {7553#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:10,719 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:10,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {7554#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:10,721 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:10,722 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {7555#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:10,723 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:10,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:10,725 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:10,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:10,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {7557#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:10,727 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:10,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:10,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {7558#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:10,730 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:10,730 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:10,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {7559#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:10,732 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:10,732 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:10,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {7560#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:10,734 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:10,734 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:10,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {7561#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:10,736 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:10,737 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:10,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {7562#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:10,738 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:10,739 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:10,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {7563#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:10,740 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:10,740 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:10,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {7564#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:10,742 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:10,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {7565#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7550#false} is VALID [2018-11-23 11:52:10,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {7550#false} assume !(0 != ~swapped~0); {7550#false} is VALID [2018-11-23 11:52:10,743 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:10,743 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:10,743 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:10,744 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:10,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {7550#false} ~cond := #in~cond; {7550#false} is VALID [2018-11-23 11:52:10,744 INFO L273 TraceCheckUtils]: 56: Hoare triple {7550#false} assume 0 == ~cond; {7550#false} is VALID [2018-11-23 11:52:10,744 INFO L273 TraceCheckUtils]: 57: Hoare triple {7550#false} assume !false; {7550#false} is VALID [2018-11-23 11:52:10,747 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:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:10,747 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:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:10,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:10,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:10,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:11,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {7549#true} call ULTIMATE.init(); {7549#true} is VALID [2018-11-23 11:52:11,063 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:11,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {7549#true} assume true; {7549#true} is VALID [2018-11-23 11:52:11,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7549#true} {7549#true} #79#return; {7549#true} is VALID [2018-11-23 11:52:11,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {7549#true} call #t~ret8 := main(); {7549#true} is VALID [2018-11-23 11:52:11,064 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:11,065 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:11,066 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7587#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:11,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {7587#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7587#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:11,067 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:11,067 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:11,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {7552#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7552#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:11,068 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:11,068 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:11,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {7553#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7553#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:11,069 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:11,070 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:11,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {7554#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7554#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:11,071 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:11,072 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:11,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {7555#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7555#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:11,073 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:11,073 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:11,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {7556#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7556#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:11,075 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:11,075 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:11,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {7557#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7557#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:11,077 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:11,077 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:11,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {7558#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7558#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:11,078 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:11,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:11,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {7559#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7559#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:11,080 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:11,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:11,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {7560#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7560#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:11,082 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:11,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:11,083 INFO L273 TraceCheckUtils]: 38: Hoare triple {7561#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7561#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:11,084 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:11,085 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:11,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {7562#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7562#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:11,086 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:11,087 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:11,087 INFO L273 TraceCheckUtils]: 44: Hoare triple {7563#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7563#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:11,088 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:11,088 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:11,089 INFO L273 TraceCheckUtils]: 47: Hoare triple {7564#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {7564#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:11,090 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:11,090 INFO L273 TraceCheckUtils]: 49: Hoare triple {7565#(<= main_~i~0 15)} assume !(~i~0 < 100000); {7550#false} is VALID [2018-11-23 11:52:11,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {7550#false} assume !(0 != ~swapped~0); {7550#false} is VALID [2018-11-23 11:52:11,091 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:11,091 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:11,091 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:11,091 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:11,092 INFO L273 TraceCheckUtils]: 55: Hoare triple {7550#false} ~cond := #in~cond; {7550#false} is VALID [2018-11-23 11:52:11,092 INFO L273 TraceCheckUtils]: 56: Hoare triple {7550#false} assume 0 == ~cond; {7550#false} is VALID [2018-11-23 11:52:11,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {7550#false} assume !false; {7550#false} is VALID [2018-11-23 11:52:11,094 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:11,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 11:52:11,114 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:52:11,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:11,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:52:11,180 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:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:52:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:52:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:11,182 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand 18 states. [2018-11-23 11:52:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,032 INFO L93 Difference]: Finished difference Result 214 states and 282 transitions. [2018-11-23 11:52:12,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:52:12,032 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 11:52:12,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2018-11-23 11:52:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:52:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 109 transitions. [2018-11-23 11:52:12,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 109 transitions. [2018-11-23 11:52:12,171 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:12,174 INFO L225 Difference]: With dead ends: 214 [2018-11-23 11:52:12,174 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 11:52:12,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:52:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 11:52:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-23 11:52:12,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:12,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:12,292 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:12,292 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 111 states. [2018-11-23 11:52:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,295 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2018-11-23 11:52:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2018-11-23 11:52:12,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,296 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 115 states. [2018-11-23 11:52:12,296 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 115 states. [2018-11-23 11:52:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:12,299 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2018-11-23 11:52:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2018-11-23 11:52:12,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:12,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:12,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:12,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:52:12,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-11-23 11:52:12,302 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 58 [2018-11-23 11:52:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-23 11:52:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:52:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2018-11-23 11:52:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 11:52:12,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:12,303 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:12,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 753965224, now seen corresponding path program 15 times [2018-11-23 11:52:12,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:12,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {8412#true} call ULTIMATE.init(); {8412#true} is VALID [2018-11-23 11:52:12,677 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:12,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {8412#true} assume true; {8412#true} is VALID [2018-11-23 11:52:12,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8412#true} {8412#true} #79#return; {8412#true} is VALID [2018-11-23 11:52:12,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {8412#true} call #t~ret8 := main(); {8412#true} is VALID [2018-11-23 11:52:12,678 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:12,679 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:12,679 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8414#(= main_~i~0 1)} is VALID [2018-11-23 11:52:12,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {8414#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8414#(= main_~i~0 1)} is VALID [2018-11-23 11:52:12,680 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:12,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {8415#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:12,681 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:12,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {8416#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:12,684 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:12,684 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {8417#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:12,686 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:12,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {8418#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:12,688 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:12,688 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {8419#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:12,690 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:12,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {8420#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:12,692 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:12,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {8421#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:12,694 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:12,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {8422#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:12,696 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:12,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {8423#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:12,698 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:12,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {8424#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:12,700 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:12,700 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,701 INFO L273 TraceCheckUtils]: 41: Hoare triple {8425#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:12,702 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:12,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,703 INFO L273 TraceCheckUtils]: 44: Hoare triple {8426#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:12,703 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:12,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {8427#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:12,705 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:12,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {8428#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:12,707 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:12,708 INFO L273 TraceCheckUtils]: 52: Hoare triple {8429#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8413#false} is VALID [2018-11-23 11:52:12,708 INFO L273 TraceCheckUtils]: 53: Hoare triple {8413#false} assume !(0 != ~swapped~0); {8413#false} is VALID [2018-11-23 11:52:12,709 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:12,709 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:12,709 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:12,709 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:12,710 INFO L273 TraceCheckUtils]: 58: Hoare triple {8413#false} ~cond := #in~cond; {8413#false} is VALID [2018-11-23 11:52:12,710 INFO L273 TraceCheckUtils]: 59: Hoare triple {8413#false} assume 0 == ~cond; {8413#false} is VALID [2018-11-23 11:52:12,710 INFO L273 TraceCheckUtils]: 60: Hoare triple {8413#false} assume !false; {8413#false} is VALID [2018-11-23 11:52:12,713 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:12,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:12,713 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:12,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:12,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-23 11:52:12,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:12,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:13,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {8412#true} call ULTIMATE.init(); {8412#true} is VALID [2018-11-23 11:52:13,112 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:13,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {8412#true} assume true; {8412#true} is VALID [2018-11-23 11:52:13,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8412#true} {8412#true} #79#return; {8412#true} is VALID [2018-11-23 11:52:13,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {8412#true} call #t~ret8 := main(); {8412#true} is VALID [2018-11-23 11:52:13,113 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:13,114 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:13,115 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8451#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:13,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {8451#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8451#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:13,115 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:13,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:13,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {8415#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8415#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:13,117 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:13,117 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:13,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {8416#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8416#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:13,118 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:13,119 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:13,119 INFO L273 TraceCheckUtils]: 17: Hoare triple {8417#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8417#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:13,120 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:13,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:13,122 INFO L273 TraceCheckUtils]: 20: Hoare triple {8418#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8418#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:13,122 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:13,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:13,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {8419#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8419#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:13,124 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:13,125 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:13,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {8420#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8420#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:13,126 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:13,127 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:13,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {8421#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8421#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:13,128 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:13,129 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:13,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {8422#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8422#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:13,130 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:13,131 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:13,132 INFO L273 TraceCheckUtils]: 35: Hoare triple {8423#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8423#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:13,132 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:13,142 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:13,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {8424#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8424#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:13,143 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:13,143 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:13,144 INFO L273 TraceCheckUtils]: 41: Hoare triple {8425#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8425#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:13,144 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:13,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:13,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {8426#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8426#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:13,145 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:13,146 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:13,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {8427#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8427#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:13,148 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:13,148 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:13,149 INFO L273 TraceCheckUtils]: 50: Hoare triple {8428#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {8428#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:13,150 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:13,150 INFO L273 TraceCheckUtils]: 52: Hoare triple {8429#(<= main_~i~0 16)} assume !(~i~0 < 100000); {8413#false} is VALID [2018-11-23 11:52:13,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {8413#false} assume !(0 != ~swapped~0); {8413#false} is VALID [2018-11-23 11:52:13,151 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:13,151 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:13,151 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:13,152 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:13,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {8413#false} ~cond := #in~cond; {8413#false} is VALID [2018-11-23 11:52:13,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {8413#false} assume 0 == ~cond; {8413#false} is VALID [2018-11-23 11:52:13,152 INFO L273 TraceCheckUtils]: 60: Hoare triple {8413#false} assume !false; {8413#false} is VALID [2018-11-23 11:52:13,157 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:13,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:13,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 11:52:13,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:52:13,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:13,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:52:13,278 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:13,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:52:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:52:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:13,280 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand 19 states. [2018-11-23 11:52:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:13,908 INFO L93 Difference]: Finished difference Result 226 states and 298 transitions. [2018-11-23 11:52:13,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:52:13,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-11-23 11:52:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:52:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:52:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:52:13,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 113 transitions. [2018-11-23 11:52:14,051 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:14,054 INFO L225 Difference]: With dead ends: 226 [2018-11-23 11:52:14,054 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:52:14,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:52:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:52:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-23 11:52:14,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:14,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:14,117 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:14,117 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 117 states. [2018-11-23 11:52:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:14,120 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2018-11-23 11:52:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2018-11-23 11:52:14,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:14,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:14,121 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 121 states. [2018-11-23 11:52:14,121 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 121 states. [2018-11-23 11:52:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:14,123 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2018-11-23 11:52:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2018-11-23 11:52:14,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:14,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:14,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:14,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:52:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2018-11-23 11:52:14,126 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 61 [2018-11-23 11:52:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:14,126 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2018-11-23 11:52:14,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:52:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2018-11-23 11:52:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 11:52:14,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:14,127 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:14,127 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:14,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1706657233, now seen corresponding path program 16 times [2018-11-23 11:52:14,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:14,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:14,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:14,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:14,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:15,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 11:52:15,066 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:15,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 11:52:15,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #79#return; {9321#true} is VALID [2018-11-23 11:52:15,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret8 := main(); {9321#true} is VALID [2018-11-23 11:52:15,067 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:15,068 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:15,068 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9323#(= main_~i~0 1)} is VALID [2018-11-23 11:52:15,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {9323#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9323#(= main_~i~0 1)} is VALID [2018-11-23 11:52:15,069 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:15,069 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {9324#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,070 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:15,070 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,071 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:15,072 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {9326#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,073 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:15,074 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {9327#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,075 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:15,076 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {9328#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,077 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:15,077 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {9329#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,079 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:15,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,080 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,080 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:15,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,081 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,082 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:15,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {9332#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,084 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:15,085 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {9333#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,086 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:15,086 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {9334#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,088 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:15,088 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,090 INFO L273 TraceCheckUtils]: 44: Hoare triple {9335#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,091 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:15,091 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,092 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:15,092 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,129 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:15,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,144 INFO L273 TraceCheckUtils]: 53: Hoare triple {9338#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,145 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:15,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {9339#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 11:52:15,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {9322#false} assume !(0 != ~swapped~0); {9322#false} is VALID [2018-11-23 11:52:15,145 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:15,145 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:15,146 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:15,146 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:15,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 11:52:15,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 11:52:15,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 11:52:15,149 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:15,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:15,149 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:15,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:15,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:15,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:15,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:15,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2018-11-23 11:52:15,552 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:15,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2018-11-23 11:52:15,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #79#return; {9321#true} is VALID [2018-11-23 11:52:15,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret8 := main(); {9321#true} is VALID [2018-11-23 11:52:15,553 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:15,553 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:15,553 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9361#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:15,554 INFO L273 TraceCheckUtils]: 8: Hoare triple {9361#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9361#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:15,554 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:15,555 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {9324#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9324#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:15,555 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:15,556 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {9325#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9325#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:15,557 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:15,557 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {9326#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9326#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:15,559 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:15,559 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {9327#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9327#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:15,561 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:15,561 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {9328#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9328#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:15,563 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:15,563 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {9329#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9329#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:15,565 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:15,565 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,566 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9330#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:15,567 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:15,567 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9331#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:15,569 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:15,588 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {9332#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9332#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:15,590 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:15,591 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {9333#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9333#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:15,591 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:15,592 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {9334#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9334#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:15,593 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:15,593 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,593 INFO L273 TraceCheckUtils]: 44: Hoare triple {9335#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9335#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:15,594 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:15,594 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,595 INFO L273 TraceCheckUtils]: 47: Hoare triple {9336#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9336#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:15,595 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:15,596 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,597 INFO L273 TraceCheckUtils]: 50: Hoare triple {9337#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9337#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:15,597 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:15,598 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,599 INFO L273 TraceCheckUtils]: 53: Hoare triple {9338#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {9338#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:15,599 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:15,600 INFO L273 TraceCheckUtils]: 55: Hoare triple {9339#(<= main_~i~0 17)} assume !(~i~0 < 100000); {9322#false} is VALID [2018-11-23 11:52:15,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {9322#false} assume !(0 != ~swapped~0); {9322#false} is VALID [2018-11-23 11:52:15,601 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:15,601 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:15,601 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:15,601 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:15,601 INFO L273 TraceCheckUtils]: 61: Hoare triple {9322#false} ~cond := #in~cond; {9322#false} is VALID [2018-11-23 11:52:15,602 INFO L273 TraceCheckUtils]: 62: Hoare triple {9322#false} assume 0 == ~cond; {9322#false} is VALID [2018-11-23 11:52:15,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2018-11-23 11:52:15,605 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:15,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:15,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 11:52:15,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:52:15,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:15,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:52:15,697 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:15,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:52:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:52:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:15,699 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand 20 states. [2018-11-23 11:52:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,375 INFO L93 Difference]: Finished difference Result 238 states and 314 transitions. [2018-11-23 11:52:16,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:52:16,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 11:52:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2018-11-23 11:52:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:52:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2018-11-23 11:52:16,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 117 transitions. [2018-11-23 11:52:16,508 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:16,510 INFO L225 Difference]: With dead ends: 238 [2018-11-23 11:52:16,510 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:52:16,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:52:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:52:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-11-23 11:52:16,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:16,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:16,576 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:16,576 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 123 states. [2018-11-23 11:52:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,579 INFO L93 Difference]: Finished difference Result 127 states and 166 transitions. [2018-11-23 11:52:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2018-11-23 11:52:16,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,580 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 127 states. [2018-11-23 11:52:16,580 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 127 states. [2018-11-23 11:52:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:16,582 INFO L93 Difference]: Finished difference Result 127 states and 166 transitions. [2018-11-23 11:52:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2018-11-23 11:52:16,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:16,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:16,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:16,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 11:52:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2018-11-23 11:52:16,586 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 64 [2018-11-23 11:52:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:16,586 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2018-11-23 11:52:16,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:52:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2018-11-23 11:52:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 11:52:16,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:16,587 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:16,588 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:16,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2084561912, now seen corresponding path program 17 times [2018-11-23 11:52:16,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2018-11-23 11:52:17,018 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:17,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2018-11-23 11:52:17,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #79#return; {10276#true} is VALID [2018-11-23 11:52:17,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2018-11-23 11:52:17,019 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:17,019 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:17,020 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10278#(= main_~i~0 1)} is VALID [2018-11-23 11:52:17,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {10278#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10278#(= main_~i~0 1)} is VALID [2018-11-23 11:52:17,021 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:17,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {10279#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,022 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:17,023 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {10280#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,023 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:17,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {10281#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,025 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:17,026 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {10282#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,027 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:17,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {10283#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,029 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:17,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {10284#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,031 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:17,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {10285#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,033 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:17,033 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {10286#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,035 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:17,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {10287#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,037 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:17,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,038 INFO L273 TraceCheckUtils]: 38: Hoare triple {10288#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,039 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:17,040 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {10289#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,041 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:17,042 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {10290#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,043 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:17,044 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {10291#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,045 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:17,046 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {10292#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,047 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:17,048 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {10293#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,049 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:17,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,050 INFO L273 TraceCheckUtils]: 56: Hoare triple {10294#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,051 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:17,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {10295#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10277#false} is VALID [2018-11-23 11:52:17,052 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#false} assume !(0 != ~swapped~0); {10277#false} is VALID [2018-11-23 11:52:17,052 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:17,052 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:17,052 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:17,052 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:17,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {10277#false} ~cond := #in~cond; {10277#false} is VALID [2018-11-23 11:52:17,053 INFO L273 TraceCheckUtils]: 65: Hoare triple {10277#false} assume 0 == ~cond; {10277#false} is VALID [2018-11-23 11:52:17,053 INFO L273 TraceCheckUtils]: 66: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2018-11-23 11:52:17,057 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:17,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:17,057 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:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:17,115 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:52:17,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:17,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:17,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {10276#true} call ULTIMATE.init(); {10276#true} is VALID [2018-11-23 11:52:17,318 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:17,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {10276#true} assume true; {10276#true} is VALID [2018-11-23 11:52:17,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10276#true} {10276#true} #79#return; {10276#true} is VALID [2018-11-23 11:52:17,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {10276#true} call #t~ret8 := main(); {10276#true} is VALID [2018-11-23 11:52:17,319 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:17,320 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:17,321 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10317#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:17,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {10317#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10317#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:17,321 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:17,322 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {10279#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10279#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:17,322 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:17,323 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {10280#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10280#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:17,324 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:17,325 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {10281#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10281#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:17,326 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:17,327 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {10282#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10282#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:17,328 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:17,328 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {10283#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10283#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:17,330 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:17,330 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {10284#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10284#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:17,331 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:17,332 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {10285#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10285#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:17,333 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:17,334 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {10286#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10286#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:17,335 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:17,335 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {10287#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10287#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:17,337 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:17,337 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,338 INFO L273 TraceCheckUtils]: 38: Hoare triple {10288#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10288#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:17,339 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:17,339 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {10289#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10289#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:17,340 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:17,341 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {10290#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10290#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:17,342 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:17,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {10291#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10291#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:17,344 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:17,345 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {10292#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10292#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:17,346 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:17,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {10293#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10293#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:17,348 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:17,348 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {10294#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {10294#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:17,350 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:17,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {10295#(<= main_~i~0 18)} assume !(~i~0 < 100000); {10277#false} is VALID [2018-11-23 11:52:17,351 INFO L273 TraceCheckUtils]: 59: Hoare triple {10277#false} assume !(0 != ~swapped~0); {10277#false} is VALID [2018-11-23 11:52:17,351 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:17,351 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:17,351 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:17,351 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:17,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {10277#false} ~cond := #in~cond; {10277#false} is VALID [2018-11-23 11:52:17,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {10277#false} assume 0 == ~cond; {10277#false} is VALID [2018-11-23 11:52:17,352 INFO L273 TraceCheckUtils]: 66: Hoare triple {10277#false} assume !false; {10277#false} is VALID [2018-11-23 11:52:17,355 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:17,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:17,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 11:52:17,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:52:17,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:17,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:52:17,451 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:17,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:52:17,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:52:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:17,452 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand 21 states. [2018-11-23 11:52:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,098 INFO L93 Difference]: Finished difference Result 250 states and 330 transitions. [2018-11-23 11:52:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:52:18,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-23 11:52:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2018-11-23 11:52:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:52:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2018-11-23 11:52:18,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 121 transitions. [2018-11-23 11:52:18,400 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:18,403 INFO L225 Difference]: With dead ends: 250 [2018-11-23 11:52:18,403 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:52:18,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:52:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:52:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-11-23 11:52:18,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:18,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:18,536 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:18,537 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 129 states. [2018-11-23 11:52:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,540 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-23 11:52:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2018-11-23 11:52:18,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:18,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:18,541 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 133 states. [2018-11-23 11:52:18,541 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 133 states. [2018-11-23 11:52:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:18,543 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-23 11:52:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2018-11-23 11:52:18,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:18,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:18,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:18,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 11:52:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2018-11-23 11:52:18,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 67 [2018-11-23 11:52:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:18,546 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2018-11-23 11:52:18,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:52:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2018-11-23 11:52:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 11:52:18,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:18,547 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:18,547 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:18,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1539127695, now seen corresponding path program 18 times [2018-11-23 11:52:18,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:18,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:18,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:18,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:18,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {11277#true} call ULTIMATE.init(); {11277#true} is VALID [2018-11-23 11:52:18,941 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:18,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {11277#true} assume true; {11277#true} is VALID [2018-11-23 11:52:18,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11277#true} {11277#true} #79#return; {11277#true} is VALID [2018-11-23 11:52:18,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {11277#true} call #t~ret8 := main(); {11277#true} is VALID [2018-11-23 11:52:18,942 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:18,943 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:18,943 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11279#(= main_~i~0 1)} is VALID [2018-11-23 11:52:18,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {11279#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11279#(= main_~i~0 1)} is VALID [2018-11-23 11:52:18,944 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:18,945 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {11280#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:18,946 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:18,947 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:18,948 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:18,949 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {11282#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:18,950 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:18,950 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {11283#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:18,951 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:18,952 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {11284#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:18,953 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:18,954 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {11285#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:18,955 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:18,956 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {11286#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:18,957 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:18,957 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {11287#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:18,959 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:18,959 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {11288#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:18,960 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:18,961 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {11289#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:18,962 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:18,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {11290#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:18,964 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:18,964 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {11291#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:18,968 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:18,968 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,968 INFO L273 TraceCheckUtils]: 47: Hoare triple {11292#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:18,969 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:18,969 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {11293#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:18,970 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:18,970 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {11294#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:18,971 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:18,971 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:18,972 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:18,972 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,973 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:18,974 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:18,974 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11278#false} is VALID [2018-11-23 11:52:18,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {11278#false} assume !(0 != ~swapped~0); {11278#false} is VALID [2018-11-23 11:52:18,975 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:18,975 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:18,975 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:18,975 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:18,975 INFO L273 TraceCheckUtils]: 67: Hoare triple {11278#false} ~cond := #in~cond; {11278#false} is VALID [2018-11-23 11:52:18,976 INFO L273 TraceCheckUtils]: 68: Hoare triple {11278#false} assume 0 == ~cond; {11278#false} is VALID [2018-11-23 11:52:18,976 INFO L273 TraceCheckUtils]: 69: Hoare triple {11278#false} assume !false; {11278#false} is VALID [2018-11-23 11:52:18,979 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:18,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:18,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18,988 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:19,043 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-23 11:52:19,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:19,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:19,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {11277#true} call ULTIMATE.init(); {11277#true} is VALID [2018-11-23 11:52:19,258 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:19,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {11277#true} assume true; {11277#true} is VALID [2018-11-23 11:52:19,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11277#true} {11277#true} #79#return; {11277#true} is VALID [2018-11-23 11:52:19,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {11277#true} call #t~ret8 := main(); {11277#true} is VALID [2018-11-23 11:52:19,259 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:19,260 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:19,261 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11319#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:19,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {11319#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11319#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:19,262 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:19,262 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:19,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {11280#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11280#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:19,263 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:19,263 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:19,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {11281#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11281#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:19,264 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:19,265 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:19,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {11282#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11282#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:19,266 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:19,267 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:19,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {11283#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11283#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:19,268 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:19,269 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:19,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {11284#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11284#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:19,270 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:19,271 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:19,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {11285#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11285#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:19,272 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:19,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:19,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {11286#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11286#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:19,274 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:19,275 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:19,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {11287#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11287#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:19,276 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:19,277 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:19,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {11288#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11288#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:19,278 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:19,279 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:19,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {11289#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11289#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:19,280 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:19,281 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:19,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {11290#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11290#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:19,282 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:19,283 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:19,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {11291#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11291#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:19,284 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:19,285 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:19,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {11292#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11292#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:19,286 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:19,287 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:19,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {11293#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11293#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:19,288 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:19,289 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:19,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {11294#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11294#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:19,290 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:19,291 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:19,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11295#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:19,292 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:19,293 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:19,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {11296#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:19,294 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:19,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 19)} assume !(~i~0 < 100000); {11278#false} is VALID [2018-11-23 11:52:19,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {11278#false} assume !(0 != ~swapped~0); {11278#false} is VALID [2018-11-23 11:52:19,295 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:19,296 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:19,296 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:19,296 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:19,296 INFO L273 TraceCheckUtils]: 67: Hoare triple {11278#false} ~cond := #in~cond; {11278#false} is VALID [2018-11-23 11:52:19,297 INFO L273 TraceCheckUtils]: 68: Hoare triple {11278#false} assume 0 == ~cond; {11278#false} is VALID [2018-11-23 11:52:19,297 INFO L273 TraceCheckUtils]: 69: Hoare triple {11278#false} assume !false; {11278#false} is VALID [2018-11-23 11:52:19,301 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:19,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 11:52:19,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:52:19,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:19,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:52:19,398 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:19,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:52:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:52:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:52:19,400 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand 22 states. [2018-11-23 11:52:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:19,768 INFO L93 Difference]: Finished difference Result 262 states and 346 transitions. [2018-11-23 11:52:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:52:19,768 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-11-23 11:52:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 125 transitions. [2018-11-23 11:52:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:52:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 125 transitions. [2018-11-23 11:52:19,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 125 transitions. [2018-11-23 11:52:19,906 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:19,909 INFO L225 Difference]: With dead ends: 262 [2018-11-23 11:52:19,909 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 11:52:19,910 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:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 11:52:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-11-23 11:52:20,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:20,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:20,004 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:20,004 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 135 states. [2018-11-23 11:52:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:20,007 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-11-23 11:52:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2018-11-23 11:52:20,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:20,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:20,008 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 139 states. [2018-11-23 11:52:20,008 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 139 states. [2018-11-23 11:52:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:20,010 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-11-23 11:52:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2018-11-23 11:52:20,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:20,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:20,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:20,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 11:52:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2018-11-23 11:52:20,012 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 70 [2018-11-23 11:52:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:20,012 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2018-11-23 11:52:20,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:52:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2018-11-23 11:52:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 11:52:20,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:20,013 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:20,014 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:20,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash -369649816, now seen corresponding path program 19 times [2018-11-23 11:52:20,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:20,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {12324#true} call ULTIMATE.init(); {12324#true} is VALID [2018-11-23 11:52:20,535 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:20,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {12324#true} assume true; {12324#true} is VALID [2018-11-23 11:52:20,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12324#true} {12324#true} #79#return; {12324#true} is VALID [2018-11-23 11:52:20,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {12324#true} call #t~ret8 := main(); {12324#true} is VALID [2018-11-23 11:52:20,536 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:20,536 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:20,537 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:20,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {12326#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:20,538 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:20,538 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {12327#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,539 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:20,539 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {12328#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,540 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:20,540 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {12329#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,541 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:20,542 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {12330#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,543 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:20,544 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {12331#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,556 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:20,557 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {12332#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,558 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:20,558 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {12333#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,559 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:20,559 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,559 INFO L273 TraceCheckUtils]: 32: Hoare triple {12334#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,560 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:20,560 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,561 INFO L273 TraceCheckUtils]: 35: Hoare triple {12335#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,562 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:20,562 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {12336#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,563 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:20,564 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,565 INFO L273 TraceCheckUtils]: 41: Hoare triple {12337#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,565 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:20,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {12338#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,567 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:20,568 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,568 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,569 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:20,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {12340#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,571 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:20,571 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {12341#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,572 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:20,573 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {12342#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,574 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:20,575 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,575 INFO L273 TraceCheckUtils]: 59: Hoare triple {12343#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,576 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:20,577 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,577 INFO L273 TraceCheckUtils]: 62: Hoare triple {12344#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,578 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:20,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {12345#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12325#false} is VALID [2018-11-23 11:52:20,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {12325#false} assume !(0 != ~swapped~0); {12325#false} is VALID [2018-11-23 11:52:20,579 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:20,579 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:20,579 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:20,580 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:20,580 INFO L273 TraceCheckUtils]: 70: Hoare triple {12325#false} ~cond := #in~cond; {12325#false} is VALID [2018-11-23 11:52:20,580 INFO L273 TraceCheckUtils]: 71: Hoare triple {12325#false} assume 0 == ~cond; {12325#false} is VALID [2018-11-23 11:52:20,580 INFO L273 TraceCheckUtils]: 72: Hoare triple {12325#false} assume !false; {12325#false} is VALID [2018-11-23 11:52:20,584 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:20,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:20,585 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:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:20,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:20,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {12324#true} call ULTIMATE.init(); {12324#true} is VALID [2018-11-23 11:52:20,896 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:20,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {12324#true} assume true; {12324#true} is VALID [2018-11-23 11:52:20,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12324#true} {12324#true} #79#return; {12324#true} is VALID [2018-11-23 11:52:20,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {12324#true} call #t~ret8 := main(); {12324#true} is VALID [2018-11-23 11:52:20,897 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:20,898 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:20,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:20,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {12367#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12367#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:20,900 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:20,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {12327#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:20,902 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:20,902 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {12328#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:20,904 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:20,904 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {12329#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:20,905 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:20,906 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {12330#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:20,907 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:20,908 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {12331#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:20,909 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:20,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {12332#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:20,911 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:20,911 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {12333#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:20,912 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:20,913 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {12334#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:20,914 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:20,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,915 INFO L273 TraceCheckUtils]: 35: Hoare triple {12335#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:20,916 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:20,916 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {12336#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:20,918 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:20,918 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {12337#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:20,919 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:20,920 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {12338#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:20,921 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:20,922 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,922 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:20,923 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:20,924 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {12340#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:20,925 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:20,925 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {12341#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:20,927 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:20,927 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {12342#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:20,928 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:20,929 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {12343#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:20,930 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:20,931 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,931 INFO L273 TraceCheckUtils]: 62: Hoare triple {12344#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {12344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:20,932 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:20,933 INFO L273 TraceCheckUtils]: 64: Hoare triple {12345#(<= main_~i~0 20)} assume !(~i~0 < 100000); {12325#false} is VALID [2018-11-23 11:52:20,933 INFO L273 TraceCheckUtils]: 65: Hoare triple {12325#false} assume !(0 != ~swapped~0); {12325#false} is VALID [2018-11-23 11:52:20,933 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:20,933 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:20,934 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:20,934 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:20,934 INFO L273 TraceCheckUtils]: 70: Hoare triple {12325#false} ~cond := #in~cond; {12325#false} is VALID [2018-11-23 11:52:20,934 INFO L273 TraceCheckUtils]: 71: Hoare triple {12325#false} assume 0 == ~cond; {12325#false} is VALID [2018-11-23 11:52:20,934 INFO L273 TraceCheckUtils]: 72: Hoare triple {12325#false} assume !false; {12325#false} is VALID [2018-11-23 11:52:20,938 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:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 11:52:20,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:52:20,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:20,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:52:21,039 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:21,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:52:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:52:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:21,040 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 23 states. [2018-11-23 11:52:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,703 INFO L93 Difference]: Finished difference Result 274 states and 362 transitions. [2018-11-23 11:52:21,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:52:21,703 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-11-23 11:52:21,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2018-11-23 11:52:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:52:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 129 transitions. [2018-11-23 11:52:21,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 129 transitions. [2018-11-23 11:52:21,853 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:21,856 INFO L225 Difference]: With dead ends: 274 [2018-11-23 11:52:21,857 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:52:21,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:52:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:52:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-23 11:52:21,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:21,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:21,935 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:21,935 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 141 states. [2018-11-23 11:52:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,938 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2018-11-23 11:52:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2018-11-23 11:52:21,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,939 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 145 states. [2018-11-23 11:52:21,939 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 145 states. [2018-11-23 11:52:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:21,942 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2018-11-23 11:52:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2018-11-23 11:52:21,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:21,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:21,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:21,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 11:52:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2018-11-23 11:52:21,946 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 73 [2018-11-23 11:52:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:21,946 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2018-11-23 11:52:21,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:52:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2018-11-23 11:52:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 11:52:21,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:21,947 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:21,948 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:21,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1228861679, now seen corresponding path program 20 times [2018-11-23 11:52:21,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {13417#true} call ULTIMATE.init(); {13417#true} is VALID [2018-11-23 11:52:22,802 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:22,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {13417#true} assume true; {13417#true} is VALID [2018-11-23 11:52:22,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13417#true} {13417#true} #79#return; {13417#true} is VALID [2018-11-23 11:52:22,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {13417#true} call #t~ret8 := main(); {13417#true} is VALID [2018-11-23 11:52:22,803 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:22,803 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:22,804 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13419#(= main_~i~0 1)} is VALID [2018-11-23 11:52:22,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {13419#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13419#(= main_~i~0 1)} is VALID [2018-11-23 11:52:22,805 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:22,805 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:22,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {13420#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:22,806 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:22,806 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:22,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {13421#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:22,807 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:22,807 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:22,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {13422#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:22,809 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:22,809 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:22,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {13423#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:22,811 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:22,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:22,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {13424#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:22,813 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:22,813 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:22,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {13425#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:22,815 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:22,815 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:22,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {13426#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:22,817 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:22,817 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:22,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {13427#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:22,819 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:22,819 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:22,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {13428#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:22,820 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:22,821 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:22,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {13429#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:22,822 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:22,823 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:22,823 INFO L273 TraceCheckUtils]: 41: Hoare triple {13430#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:22,824 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:22,825 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:22,826 INFO L273 TraceCheckUtils]: 44: Hoare triple {13431#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:22,826 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:22,827 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:22,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {13432#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:22,828 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:22,829 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:22,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {13433#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:22,830 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:22,831 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:22,831 INFO L273 TraceCheckUtils]: 53: Hoare triple {13434#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:22,832 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:22,833 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:22,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {13435#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:22,834 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:22,835 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:22,835 INFO L273 TraceCheckUtils]: 59: Hoare triple {13436#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:22,836 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:22,836 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:22,837 INFO L273 TraceCheckUtils]: 62: Hoare triple {13437#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:22,838 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:22,838 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:22,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {13438#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:22,840 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:22,840 INFO L273 TraceCheckUtils]: 67: Hoare triple {13439#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13418#false} is VALID [2018-11-23 11:52:22,841 INFO L273 TraceCheckUtils]: 68: Hoare triple {13418#false} assume !(0 != ~swapped~0); {13418#false} is VALID [2018-11-23 11:52:22,841 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:22,841 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:22,841 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:22,841 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:22,842 INFO L273 TraceCheckUtils]: 73: Hoare triple {13418#false} ~cond := #in~cond; {13418#false} is VALID [2018-11-23 11:52:22,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {13418#false} assume 0 == ~cond; {13418#false} is VALID [2018-11-23 11:52:22,842 INFO L273 TraceCheckUtils]: 75: Hoare triple {13418#false} assume !false; {13418#false} is VALID [2018-11-23 11:52:22,846 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:22,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:22,846 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:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:22,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:22,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:22,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:23,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {13417#true} call ULTIMATE.init(); {13417#true} is VALID [2018-11-23 11:52:23,226 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:23,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {13417#true} assume true; {13417#true} is VALID [2018-11-23 11:52:23,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13417#true} {13417#true} #79#return; {13417#true} is VALID [2018-11-23 11:52:23,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {13417#true} call #t~ret8 := main(); {13417#true} is VALID [2018-11-23 11:52:23,227 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:23,227 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:23,228 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13461#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:23,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {13461#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13461#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:23,229 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:23,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:23,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {13420#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13420#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:23,230 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:23,230 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:23,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {13421#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13421#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:23,232 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:23,232 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:23,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {13422#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13422#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:23,234 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:23,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:23,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {13423#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13423#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:23,235 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:23,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:23,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {13424#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13424#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:23,237 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:23,238 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:23,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {13425#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13425#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:23,239 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:23,240 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:23,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {13426#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13426#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:23,241 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:23,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:23,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {13427#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13427#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:23,243 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:23,243 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:23,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {13428#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13428#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:23,244 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:23,245 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:23,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {13429#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13429#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:23,246 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:23,247 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:23,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {13430#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13430#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:23,248 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:23,248 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:23,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {13431#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13431#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:23,250 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:23,250 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:23,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {13432#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13432#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:23,251 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:23,252 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:23,252 INFO L273 TraceCheckUtils]: 50: Hoare triple {13433#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13433#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:23,253 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:23,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:23,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {13434#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13434#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:23,255 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:23,256 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:23,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {13435#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13435#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:23,257 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:23,257 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:23,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {13436#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13436#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:23,259 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:23,259 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:23,260 INFO L273 TraceCheckUtils]: 62: Hoare triple {13437#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13437#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:23,260 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:23,261 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:23,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {13438#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {13438#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:23,262 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:23,263 INFO L273 TraceCheckUtils]: 67: Hoare triple {13439#(<= main_~i~0 21)} assume !(~i~0 < 100000); {13418#false} is VALID [2018-11-23 11:52:23,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {13418#false} assume !(0 != ~swapped~0); {13418#false} is VALID [2018-11-23 11:52:23,263 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:23,263 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:23,264 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:23,264 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:23,264 INFO L273 TraceCheckUtils]: 73: Hoare triple {13418#false} ~cond := #in~cond; {13418#false} is VALID [2018-11-23 11:52:23,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {13418#false} assume 0 == ~cond; {13418#false} is VALID [2018-11-23 11:52:23,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {13418#false} assume !false; {13418#false} is VALID [2018-11-23 11:52:23,269 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:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:23,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 11:52:23,289 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:52:23,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:23,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:52:23,369 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:23,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:52:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:52:23,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:23,370 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand 24 states. [2018-11-23 11:52:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,132 INFO L93 Difference]: Finished difference Result 286 states and 378 transitions. [2018-11-23 11:52:24,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:52:24,132 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-11-23 11:52:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:52:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:52:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 133 transitions. [2018-11-23 11:52:24,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 133 transitions. [2018-11-23 11:52:24,281 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:24,285 INFO L225 Difference]: With dead ends: 286 [2018-11-23 11:52:24,285 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 11:52:24,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:52:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 11:52:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-11-23 11:52:24,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:24,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:24,349 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:24,349 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 147 states. [2018-11-23 11:52:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,353 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2018-11-23 11:52:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2018-11-23 11:52:24,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,353 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 151 states. [2018-11-23 11:52:24,354 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 151 states. [2018-11-23 11:52:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:24,356 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2018-11-23 11:52:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2018-11-23 11:52:24,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:24,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:24,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:24,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 11:52:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 192 transitions. [2018-11-23 11:52:24,360 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 192 transitions. Word has length 76 [2018-11-23 11:52:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:24,360 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 192 transitions. [2018-11-23 11:52:24,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:52:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 192 transitions. [2018-11-23 11:52:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 11:52:24,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:24,361 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:24,362 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:24,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash -4388152, now seen corresponding path program 21 times [2018-11-23 11:52:24,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:24,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:24,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:24,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:24,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {14556#true} call ULTIMATE.init(); {14556#true} is VALID [2018-11-23 11:52:24,783 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:24,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {14556#true} assume true; {14556#true} is VALID [2018-11-23 11:52:24,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14556#true} {14556#true} #79#return; {14556#true} is VALID [2018-11-23 11:52:24,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {14556#true} call #t~ret8 := main(); {14556#true} is VALID [2018-11-23 11:52:24,784 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:24,785 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:24,785 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14558#(= main_~i~0 1)} is VALID [2018-11-23 11:52:24,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {14558#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14558#(= main_~i~0 1)} is VALID [2018-11-23 11:52:24,786 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:24,787 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {14559#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:24,788 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:24,789 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {14560#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:24,790 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:24,791 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {14561#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:24,792 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:24,792 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {14562#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:24,794 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:24,794 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {14563#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:24,795 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:24,796 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {14564#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:24,797 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:24,798 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {14565#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:24,799 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:24,800 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {14566#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:24,801 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:24,801 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {14567#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:24,803 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:24,803 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {14568#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:24,804 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:24,805 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {14569#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:24,806 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:24,807 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {14570#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:24,808 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:24,808 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,809 INFO L273 TraceCheckUtils]: 47: Hoare triple {14571#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:24,810 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:24,810 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {14572#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:24,812 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:24,812 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {14573#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:24,813 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:24,814 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,814 INFO L273 TraceCheckUtils]: 56: Hoare triple {14574#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:24,815 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:24,816 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {14575#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:24,817 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:24,818 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,818 INFO L273 TraceCheckUtils]: 62: Hoare triple {14576#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:24,819 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:24,819 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,820 INFO L273 TraceCheckUtils]: 65: Hoare triple {14577#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:24,821 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:24,821 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,822 INFO L273 TraceCheckUtils]: 68: Hoare triple {14578#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:24,822 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:24,823 INFO L273 TraceCheckUtils]: 70: Hoare triple {14579#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14557#false} is VALID [2018-11-23 11:52:24,823 INFO L273 TraceCheckUtils]: 71: Hoare triple {14557#false} assume !(0 != ~swapped~0); {14557#false} is VALID [2018-11-23 11:52:24,823 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:24,824 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:24,824 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:24,824 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:24,824 INFO L273 TraceCheckUtils]: 76: Hoare triple {14557#false} ~cond := #in~cond; {14557#false} is VALID [2018-11-23 11:52:24,824 INFO L273 TraceCheckUtils]: 77: Hoare triple {14557#false} assume 0 == ~cond; {14557#false} is VALID [2018-11-23 11:52:24,825 INFO L273 TraceCheckUtils]: 78: Hoare triple {14557#false} assume !false; {14557#false} is VALID [2018-11-23 11:52:24,831 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:24,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:24,831 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:24,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:24,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-11-23 11:52:24,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:24,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:25,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {14556#true} call ULTIMATE.init(); {14556#true} is VALID [2018-11-23 11:52:25,179 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:25,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {14556#true} assume true; {14556#true} is VALID [2018-11-23 11:52:25,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14556#true} {14556#true} #79#return; {14556#true} is VALID [2018-11-23 11:52:25,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {14556#true} call #t~ret8 := main(); {14556#true} is VALID [2018-11-23 11:52:25,180 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:25,181 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:25,181 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14601#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:25,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {14601#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14601#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:25,182 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:25,182 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:25,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {14559#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14559#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:25,183 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:25,184 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:25,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {14560#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14560#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:25,185 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:25,186 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:25,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {14561#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14561#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:25,187 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:25,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:25,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {14562#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14562#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:25,189 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:25,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:25,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {14563#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14563#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:25,191 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:25,192 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:25,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {14564#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14564#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:25,193 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:25,194 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:25,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {14565#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14565#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:25,195 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:25,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:25,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {14566#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14566#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:25,197 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:25,197 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:25,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {14567#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14567#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:25,199 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:25,200 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:25,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {14568#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14568#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:25,201 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:25,202 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:25,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {14569#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14569#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:25,203 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:25,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:25,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {14570#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14570#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:25,205 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:25,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:25,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {14571#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14571#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:25,207 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:25,207 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:25,208 INFO L273 TraceCheckUtils]: 50: Hoare triple {14572#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14572#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:25,209 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:25,209 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:25,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {14573#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14573#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:25,211 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:25,211 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:25,212 INFO L273 TraceCheckUtils]: 56: Hoare triple {14574#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14574#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:25,213 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:25,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:25,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {14575#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14575#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:25,214 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:25,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:25,216 INFO L273 TraceCheckUtils]: 62: Hoare triple {14576#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14576#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:25,216 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:25,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:25,217 INFO L273 TraceCheckUtils]: 65: Hoare triple {14577#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14577#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:25,218 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:25,219 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:25,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {14578#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {14578#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:25,220 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:25,221 INFO L273 TraceCheckUtils]: 70: Hoare triple {14579#(<= main_~i~0 22)} assume !(~i~0 < 100000); {14557#false} is VALID [2018-11-23 11:52:25,221 INFO L273 TraceCheckUtils]: 71: Hoare triple {14557#false} assume !(0 != ~swapped~0); {14557#false} is VALID [2018-11-23 11:52:25,221 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:25,222 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:25,222 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:25,222 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:25,222 INFO L273 TraceCheckUtils]: 76: Hoare triple {14557#false} ~cond := #in~cond; {14557#false} is VALID [2018-11-23 11:52:25,222 INFO L273 TraceCheckUtils]: 77: Hoare triple {14557#false} assume 0 == ~cond; {14557#false} is VALID [2018-11-23 11:52:25,223 INFO L273 TraceCheckUtils]: 78: Hoare triple {14557#false} assume !false; {14557#false} is VALID [2018-11-23 11:52:25,227 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:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:25,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 11:52:25,247 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:52:25,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:25,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:52:25,352 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:25,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:52:25,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:52:25,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:25,353 INFO L87 Difference]: Start difference. First operand 147 states and 192 transitions. Second operand 25 states. [2018-11-23 11:52:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:26,501 INFO L93 Difference]: Finished difference Result 298 states and 394 transitions. [2018-11-23 11:52:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:52:26,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-11-23 11:52:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 137 transitions. [2018-11-23 11:52:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:52:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 137 transitions. [2018-11-23 11:52:26,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 137 transitions. [2018-11-23 11:52:26,658 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:26,661 INFO L225 Difference]: With dead ends: 298 [2018-11-23 11:52:26,661 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 11:52:26,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:52:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 11:52:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-11-23 11:52:26,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:26,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:26,866 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:26,866 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 153 states. [2018-11-23 11:52:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:26,869 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-11-23 11:52:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2018-11-23 11:52:26,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:26,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:26,870 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 157 states. [2018-11-23 11:52:26,870 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 157 states. [2018-11-23 11:52:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:26,872 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2018-11-23 11:52:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2018-11-23 11:52:26,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:26,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:26,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 11:52:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2018-11-23 11:52:26,876 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 79 [2018-11-23 11:52:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:26,876 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2018-11-23 11:52:26,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:52:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2018-11-23 11:52:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 11:52:26,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:26,877 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:26,877 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:26,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:26,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1129209777, now seen corresponding path program 22 times [2018-11-23 11:52:26,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:26,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:26,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:27,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {15741#true} call ULTIMATE.init(); {15741#true} is VALID [2018-11-23 11:52:27,365 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:27,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {15741#true} assume true; {15741#true} is VALID [2018-11-23 11:52:27,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15741#true} {15741#true} #79#return; {15741#true} is VALID [2018-11-23 11:52:27,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {15741#true} call #t~ret8 := main(); {15741#true} is VALID [2018-11-23 11:52:27,366 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:27,366 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:27,367 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15743#(= main_~i~0 1)} is VALID [2018-11-23 11:52:27,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {15743#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15743#(= main_~i~0 1)} is VALID [2018-11-23 11:52:27,369 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:27,369 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:27,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {15744#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:27,370 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:27,371 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:27,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {15745#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:27,372 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:27,373 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:27,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {15746#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:27,374 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:27,375 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:27,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {15747#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:27,376 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:27,377 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:27,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {15748#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:27,378 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:27,379 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:27,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {15749#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:27,380 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:27,381 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:27,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {15750#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:27,382 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:27,382 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:27,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {15751#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:27,384 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:27,384 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:27,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {15752#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:27,386 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:27,386 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:27,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {15753#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:27,387 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:27,388 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:27,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {15754#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:27,389 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:27,390 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:27,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {15755#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:27,391 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:27,392 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:27,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {15756#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:27,393 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:27,394 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:27,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {15757#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:27,395 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:27,395 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:27,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {15758#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:27,397 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:27,397 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:27,398 INFO L273 TraceCheckUtils]: 56: Hoare triple {15759#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:27,399 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:27,399 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:27,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {15760#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:27,401 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:27,402 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:27,402 INFO L273 TraceCheckUtils]: 62: Hoare triple {15761#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:27,403 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:27,404 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:27,404 INFO L273 TraceCheckUtils]: 65: Hoare triple {15762#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:27,405 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:27,405 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:27,406 INFO L273 TraceCheckUtils]: 68: Hoare triple {15763#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:27,407 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:27,407 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:27,408 INFO L273 TraceCheckUtils]: 71: Hoare triple {15764#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:27,409 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:27,409 INFO L273 TraceCheckUtils]: 73: Hoare triple {15765#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15742#false} is VALID [2018-11-23 11:52:27,410 INFO L273 TraceCheckUtils]: 74: Hoare triple {15742#false} assume !(0 != ~swapped~0); {15742#false} is VALID [2018-11-23 11:52:27,410 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:27,410 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:27,410 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:27,410 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:27,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {15742#false} ~cond := #in~cond; {15742#false} is VALID [2018-11-23 11:52:27,411 INFO L273 TraceCheckUtils]: 80: Hoare triple {15742#false} assume 0 == ~cond; {15742#false} is VALID [2018-11-23 11:52:27,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {15742#false} assume !false; {15742#false} is VALID [2018-11-23 11:52:27,416 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:27,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:27,416 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:27,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:27,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:27,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:27,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:27,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {15741#true} call ULTIMATE.init(); {15741#true} is VALID [2018-11-23 11:52:27,771 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:27,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {15741#true} assume true; {15741#true} is VALID [2018-11-23 11:52:27,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15741#true} {15741#true} #79#return; {15741#true} is VALID [2018-11-23 11:52:27,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {15741#true} call #t~ret8 := main(); {15741#true} is VALID [2018-11-23 11:52:27,772 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:27,773 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:27,774 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15787#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:27,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {15787#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15787#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:27,775 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:27,775 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:27,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {15744#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15744#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:27,776 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:27,776 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:27,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {15745#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15745#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:27,777 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:27,778 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:27,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {15746#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15746#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:27,779 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:27,780 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:27,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {15747#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15747#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:27,781 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:27,782 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:27,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {15748#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15748#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:27,783 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:27,784 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:27,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {15749#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15749#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:27,785 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:27,786 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:27,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {15750#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15750#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:27,787 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:27,788 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:27,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {15751#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15751#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:27,789 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:27,790 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:27,790 INFO L273 TraceCheckUtils]: 35: Hoare triple {15752#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15752#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:27,791 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:27,792 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:27,792 INFO L273 TraceCheckUtils]: 38: Hoare triple {15753#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15753#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:27,793 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:27,794 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:27,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {15754#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15754#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:27,795 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:27,796 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:27,797 INFO L273 TraceCheckUtils]: 44: Hoare triple {15755#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15755#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:27,797 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:27,798 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:27,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {15756#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15756#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:27,800 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:27,801 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:27,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {15757#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15757#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:27,802 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:27,803 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:27,803 INFO L273 TraceCheckUtils]: 53: Hoare triple {15758#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15758#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:27,804 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:27,805 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:27,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {15759#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15759#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:27,806 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:27,807 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:27,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {15760#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15760#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:27,809 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:27,809 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:27,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {15761#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15761#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:27,811 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:27,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:27,812 INFO L273 TraceCheckUtils]: 65: Hoare triple {15762#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15762#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:27,813 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:27,814 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:27,814 INFO L273 TraceCheckUtils]: 68: Hoare triple {15763#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15763#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:27,815 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:27,816 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:27,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {15764#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {15764#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:27,817 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:27,818 INFO L273 TraceCheckUtils]: 73: Hoare triple {15765#(<= main_~i~0 23)} assume !(~i~0 < 100000); {15742#false} is VALID [2018-11-23 11:52:27,818 INFO L273 TraceCheckUtils]: 74: Hoare triple {15742#false} assume !(0 != ~swapped~0); {15742#false} is VALID [2018-11-23 11:52:27,819 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:27,819 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:27,819 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:27,820 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:27,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {15742#false} ~cond := #in~cond; {15742#false} is VALID [2018-11-23 11:52:27,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {15742#false} assume 0 == ~cond; {15742#false} is VALID [2018-11-23 11:52:27,820 INFO L273 TraceCheckUtils]: 81: Hoare triple {15742#false} assume !false; {15742#false} is VALID [2018-11-23 11:52:27,829 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:27,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:27,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 11:52:27,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:52:27,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:27,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:52:27,985 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:27,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:52:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:52:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:27,986 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand 26 states. [2018-11-23 11:52:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:28,879 INFO L93 Difference]: Finished difference Result 310 states and 410 transitions. [2018-11-23 11:52:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:52:28,880 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-11-23 11:52:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 141 transitions. [2018-11-23 11:52:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:52:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 141 transitions. [2018-11-23 11:52:28,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 141 transitions. [2018-11-23 11:52:29,033 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:29,036 INFO L225 Difference]: With dead ends: 310 [2018-11-23 11:52:29,036 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 11:52:29,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:52:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 11:52:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-11-23 11:52:29,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:29,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:29,096 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:29,096 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 159 states. [2018-11-23 11:52:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,099 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-11-23 11:52:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2018-11-23 11:52:29,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,099 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 163 states. [2018-11-23 11:52:29,099 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 163 states. [2018-11-23 11:52:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:29,101 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-11-23 11:52:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2018-11-23 11:52:29,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:29,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:29,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:29,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:52:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 208 transitions. [2018-11-23 11:52:29,105 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 208 transitions. Word has length 82 [2018-11-23 11:52:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:29,105 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 208 transitions. [2018-11-23 11:52:29,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:52:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 208 transitions. [2018-11-23 11:52:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 11:52:29,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:29,106 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:29,106 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:29,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 817264168, now seen corresponding path program 23 times [2018-11-23 11:52:29,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:29,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {16972#true} call ULTIMATE.init(); {16972#true} is VALID [2018-11-23 11:52:29,666 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:29,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} assume true; {16972#true} is VALID [2018-11-23 11:52:29,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16972#true} {16972#true} #79#return; {16972#true} is VALID [2018-11-23 11:52:29,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {16972#true} call #t~ret8 := main(); {16972#true} is VALID [2018-11-23 11:52:29,667 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:29,667 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:29,668 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16974#(= main_~i~0 1)} is VALID [2018-11-23 11:52:29,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {16974#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16974#(= main_~i~0 1)} is VALID [2018-11-23 11:52:29,669 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:29,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:29,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {16975#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:29,670 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:29,670 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:29,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {16976#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:29,671 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:29,672 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:29,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {16977#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:29,673 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:29,674 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:29,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {16978#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:29,675 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:29,676 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:29,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {16979#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:29,677 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:29,677 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:29,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {16980#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:29,679 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:29,679 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:29,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {16981#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:29,680 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:29,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:29,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {16982#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:29,682 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:29,683 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:29,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {16983#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:29,684 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:29,685 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:29,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {16984#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:29,686 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:29,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:29,687 INFO L273 TraceCheckUtils]: 41: Hoare triple {16985#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:29,688 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:29,688 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:29,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {16986#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:29,689 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:29,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:29,691 INFO L273 TraceCheckUtils]: 47: Hoare triple {16987#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:29,691 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:29,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:29,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {16988#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:29,693 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:29,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:29,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {16989#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:29,695 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:29,695 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:29,696 INFO L273 TraceCheckUtils]: 56: Hoare triple {16990#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:29,697 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:29,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:29,698 INFO L273 TraceCheckUtils]: 59: Hoare triple {16991#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:29,698 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:29,699 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:29,700 INFO L273 TraceCheckUtils]: 62: Hoare triple {16992#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:29,700 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:29,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:29,701 INFO L273 TraceCheckUtils]: 65: Hoare triple {16993#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:29,702 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:29,703 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:29,703 INFO L273 TraceCheckUtils]: 68: Hoare triple {16994#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:29,704 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:29,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:29,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {16995#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:29,706 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:29,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:29,707 INFO L273 TraceCheckUtils]: 74: Hoare triple {16996#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:29,708 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:29,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {16997#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16973#false} is VALID [2018-11-23 11:52:29,708 INFO L273 TraceCheckUtils]: 77: Hoare triple {16973#false} assume !(0 != ~swapped~0); {16973#false} is VALID [2018-11-23 11:52:29,709 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:29,709 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:29,709 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:29,709 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:29,709 INFO L273 TraceCheckUtils]: 82: Hoare triple {16973#false} ~cond := #in~cond; {16973#false} is VALID [2018-11-23 11:52:29,710 INFO L273 TraceCheckUtils]: 83: Hoare triple {16973#false} assume 0 == ~cond; {16973#false} is VALID [2018-11-23 11:52:29,710 INFO L273 TraceCheckUtils]: 84: Hoare triple {16973#false} assume !false; {16973#false} is VALID [2018-11-23 11:52:29,715 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:29,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:29,715 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:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:29,801 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:52:29,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:29,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:30,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {16972#true} call ULTIMATE.init(); {16972#true} is VALID [2018-11-23 11:52:30,094 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:30,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} assume true; {16972#true} is VALID [2018-11-23 11:52:30,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16972#true} {16972#true} #79#return; {16972#true} is VALID [2018-11-23 11:52:30,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {16972#true} call #t~ret8 := main(); {16972#true} is VALID [2018-11-23 11:52:30,095 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:30,095 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:30,096 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {17019#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:30,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {17019#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {17019#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:30,097 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:30,097 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:30,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {16975#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16975#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:30,098 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:30,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:30,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {16976#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16976#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:30,100 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:30,100 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:30,101 INFO L273 TraceCheckUtils]: 17: Hoare triple {16977#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16977#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:30,102 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:30,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:30,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {16978#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16978#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:30,103 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:30,104 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:30,104 INFO L273 TraceCheckUtils]: 23: Hoare triple {16979#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16979#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:30,105 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:30,106 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:30,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {16980#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16980#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:30,107 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:30,108 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:30,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {16981#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16981#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:30,109 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:30,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:30,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {16982#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16982#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:30,110 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:30,111 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:30,112 INFO L273 TraceCheckUtils]: 35: Hoare triple {16983#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16983#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:30,112 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:30,113 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:30,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {16984#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16984#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:30,114 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:30,114 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:30,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {16985#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16985#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:30,116 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:30,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:30,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {16986#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16986#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:30,118 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:30,118 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:30,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {16987#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16987#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:30,119 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:30,120 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:30,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {16988#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16988#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:30,121 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:30,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:30,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {16989#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16989#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:30,123 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:30,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:30,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {16990#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16990#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:30,125 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:30,126 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:30,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {16991#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16991#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:30,127 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:30,127 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:30,128 INFO L273 TraceCheckUtils]: 62: Hoare triple {16992#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16992#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:30,129 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:30,129 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:30,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {16993#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16993#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:30,130 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:30,131 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:30,131 INFO L273 TraceCheckUtils]: 68: Hoare triple {16994#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16994#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:30,132 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:30,133 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:30,133 INFO L273 TraceCheckUtils]: 71: Hoare triple {16995#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16995#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:30,134 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:30,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:30,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {16996#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {16996#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:30,135 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:30,136 INFO L273 TraceCheckUtils]: 76: Hoare triple {16997#(<= main_~i~0 24)} assume !(~i~0 < 100000); {16973#false} is VALID [2018-11-23 11:52:30,136 INFO L273 TraceCheckUtils]: 77: Hoare triple {16973#false} assume !(0 != ~swapped~0); {16973#false} is VALID [2018-11-23 11:52:30,137 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:30,137 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:30,137 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:30,137 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:30,137 INFO L273 TraceCheckUtils]: 82: Hoare triple {16973#false} ~cond := #in~cond; {16973#false} is VALID [2018-11-23 11:52:30,137 INFO L273 TraceCheckUtils]: 83: Hoare triple {16973#false} assume 0 == ~cond; {16973#false} is VALID [2018-11-23 11:52:30,138 INFO L273 TraceCheckUtils]: 84: Hoare triple {16973#false} assume !false; {16973#false} is VALID [2018-11-23 11:52:30,144 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:30,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:30,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 11:52:30,163 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:52:30,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:30,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:52:30,256 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:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:52:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:52:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:30,258 INFO L87 Difference]: Start difference. First operand 159 states and 208 transitions. Second operand 27 states. [2018-11-23 11:52:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:30,953 INFO L93 Difference]: Finished difference Result 322 states and 426 transitions. [2018-11-23 11:52:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:52:30,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 11:52:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2018-11-23 11:52:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:52:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2018-11-23 11:52:30,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 145 transitions. [2018-11-23 11:52:31,119 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:31,123 INFO L225 Difference]: With dead ends: 322 [2018-11-23 11:52:31,123 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:52:31,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:52:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:52:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-11-23 11:52:31,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:31,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:31,201 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:31,201 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 165 states. [2018-11-23 11:52:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,207 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2018-11-23 11:52:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2018-11-23 11:52:31,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,207 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 169 states. [2018-11-23 11:52:31,208 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 169 states. [2018-11-23 11:52:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:31,211 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2018-11-23 11:52:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2018-11-23 11:52:31,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:31,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:31,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:31,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-23 11:52:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2018-11-23 11:52:31,215 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 85 [2018-11-23 11:52:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:31,215 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2018-11-23 11:52:31,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:52:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2018-11-23 11:52:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 11:52:31,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:31,216 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:31,216 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1954854993, now seen corresponding path program 24 times [2018-11-23 11:52:31,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {18249#true} call ULTIMATE.init(); {18249#true} is VALID [2018-11-23 11:52:32,514 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:32,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {18249#true} assume true; {18249#true} is VALID [2018-11-23 11:52:32,514 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18249#true} {18249#true} #79#return; {18249#true} is VALID [2018-11-23 11:52:32,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {18249#true} call #t~ret8 := main(); {18249#true} is VALID [2018-11-23 11:52:32,515 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:32,516 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:32,516 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18251#(= main_~i~0 1)} is VALID [2018-11-23 11:52:32,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {18251#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18251#(= main_~i~0 1)} is VALID [2018-11-23 11:52:32,517 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:32,518 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {18252#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,519 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:32,520 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {18253#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,521 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:32,522 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {18254#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,523 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:32,524 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {18255#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,525 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:32,526 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,526 INFO L273 TraceCheckUtils]: 23: Hoare triple {18256#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,527 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:32,528 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {18257#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,529 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:32,530 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {18258#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,531 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:32,532 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {18259#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,533 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:32,533 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {18260#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,535 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:32,535 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {18261#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,537 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:32,537 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {18262#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,539 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:32,540 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {18263#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,541 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:32,541 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {18264#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,543 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:32,543 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,544 INFO L273 TraceCheckUtils]: 50: Hoare triple {18265#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,545 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:32,545 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,546 INFO L273 TraceCheckUtils]: 53: Hoare triple {18266#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,546 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:32,547 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {18267#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,548 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:32,549 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {18268#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,550 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:32,551 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,552 INFO L273 TraceCheckUtils]: 62: Hoare triple {18269#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,552 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:32,553 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,553 INFO L273 TraceCheckUtils]: 65: Hoare triple {18270#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:32,554 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:32,555 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,555 INFO L273 TraceCheckUtils]: 68: Hoare triple {18271#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:32,556 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:32,557 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,557 INFO L273 TraceCheckUtils]: 71: Hoare triple {18272#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:32,558 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:32,559 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,559 INFO L273 TraceCheckUtils]: 74: Hoare triple {18273#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:32,560 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:32,561 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,561 INFO L273 TraceCheckUtils]: 77: Hoare triple {18274#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:32,562 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:32,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {18275#(<= main_~i~0 25)} assume !(~i~0 < 100000); {18250#false} is VALID [2018-11-23 11:52:32,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {18250#false} assume !(0 != ~swapped~0); {18250#false} is VALID [2018-11-23 11:52:32,563 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:32,563 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:32,564 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:32,564 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:32,564 INFO L273 TraceCheckUtils]: 85: Hoare triple {18250#false} ~cond := #in~cond; {18250#false} is VALID [2018-11-23 11:52:32,564 INFO L273 TraceCheckUtils]: 86: Hoare triple {18250#false} assume 0 == ~cond; {18250#false} is VALID [2018-11-23 11:52:32,564 INFO L273 TraceCheckUtils]: 87: Hoare triple {18250#false} assume !false; {18250#false} is VALID [2018-11-23 11:52:32,571 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:32,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:32,571 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:32,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:32,656 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-11-23 11:52:32,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:32,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:32,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {18249#true} call ULTIMATE.init(); {18249#true} is VALID [2018-11-23 11:52:32,962 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:32,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {18249#true} assume true; {18249#true} is VALID [2018-11-23 11:52:32,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18249#true} {18249#true} #79#return; {18249#true} is VALID [2018-11-23 11:52:32,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {18249#true} call #t~ret8 := main(); {18249#true} is VALID [2018-11-23 11:52:32,963 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:32,963 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:32,964 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18297#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:32,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {18297#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18297#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:32,965 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:32,965 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {18252#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18252#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:32,966 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:32,966 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {18253#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18253#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:32,968 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:32,968 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {18254#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18254#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:32,970 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:32,971 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {18255#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18255#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:32,972 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:32,973 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {18256#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18256#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:32,974 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:32,975 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {18257#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18257#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:32,976 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:32,977 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {18258#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18258#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:32,978 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:32,979 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {18259#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18259#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:32,980 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:32,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {18260#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18260#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:32,982 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:32,982 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {18261#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18261#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:32,984 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:32,984 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {18262#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18262#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:32,986 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:32,986 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,987 INFO L273 TraceCheckUtils]: 44: Hoare triple {18263#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18263#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:32,987 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:32,988 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {18264#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18264#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:32,989 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:32,990 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {18265#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18265#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:32,991 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:32,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {18266#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18266#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:32,993 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:32,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,994 INFO L273 TraceCheckUtils]: 56: Hoare triple {18267#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18267#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:32,995 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:32,995 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,996 INFO L273 TraceCheckUtils]: 59: Hoare triple {18268#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18268#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:32,997 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:32,997 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {18269#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18269#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:32,999 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:32,999 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:33,000 INFO L273 TraceCheckUtils]: 65: Hoare triple {18270#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18270#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:33,001 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:33,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:33,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {18271#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18271#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:33,003 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:33,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:33,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {18272#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18272#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:33,005 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:33,005 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:33,006 INFO L273 TraceCheckUtils]: 74: Hoare triple {18273#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18273#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:33,007 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:33,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:33,008 INFO L273 TraceCheckUtils]: 77: Hoare triple {18274#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {18274#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:33,009 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:33,009 INFO L273 TraceCheckUtils]: 79: Hoare triple {18275#(<= main_~i~0 25)} assume !(~i~0 < 100000); {18250#false} is VALID [2018-11-23 11:52:33,010 INFO L273 TraceCheckUtils]: 80: Hoare triple {18250#false} assume !(0 != ~swapped~0); {18250#false} is VALID [2018-11-23 11:52:33,010 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:33,010 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:33,010 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:33,010 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:33,011 INFO L273 TraceCheckUtils]: 85: Hoare triple {18250#false} ~cond := #in~cond; {18250#false} is VALID [2018-11-23 11:52:33,011 INFO L273 TraceCheckUtils]: 86: Hoare triple {18250#false} assume 0 == ~cond; {18250#false} is VALID [2018-11-23 11:52:33,011 INFO L273 TraceCheckUtils]: 87: Hoare triple {18250#false} assume !false; {18250#false} is VALID [2018-11-23 11:52:33,016 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:33,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:33,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 11:52:33,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:52:33,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:33,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:52:33,134 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:33,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:52:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:52:33,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:33,135 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand 28 states. [2018-11-23 11:52:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:34,160 INFO L93 Difference]: Finished difference Result 334 states and 442 transitions. [2018-11-23 11:52:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:52:34,160 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2018-11-23 11:52:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2018-11-23 11:52:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:52:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2018-11-23 11:52:34,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 149 transitions. [2018-11-23 11:52:35,258 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:35,261 INFO L225 Difference]: With dead ends: 334 [2018-11-23 11:52:35,261 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 11:52:35,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:52:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 11:52:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-11-23 11:52:35,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:35,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:35,409 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:35,409 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 171 states. [2018-11-23 11:52:35,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,412 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2018-11-23 11:52:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2018-11-23 11:52:35,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,413 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 175 states. [2018-11-23 11:52:35,413 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 175 states. [2018-11-23 11:52:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:35,416 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2018-11-23 11:52:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 230 transitions. [2018-11-23 11:52:35,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:35,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:35,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:35,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 11:52:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2018-11-23 11:52:35,419 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 88 [2018-11-23 11:52:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:35,419 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2018-11-23 11:52:35,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:52:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2018-11-23 11:52:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 11:52:35,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:35,420 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:35,420 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:35,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 336189832, now seen corresponding path program 25 times [2018-11-23 11:52:35,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:35,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {19572#true} call ULTIMATE.init(); {19572#true} is VALID [2018-11-23 11:52:36,315 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:36,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {19572#true} assume true; {19572#true} is VALID [2018-11-23 11:52:36,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19572#true} {19572#true} #79#return; {19572#true} is VALID [2018-11-23 11:52:36,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {19572#true} call #t~ret8 := main(); {19572#true} is VALID [2018-11-23 11:52:36,315 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:36,316 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:36,317 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19574#(= main_~i~0 1)} is VALID [2018-11-23 11:52:36,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {19574#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19574#(= main_~i~0 1)} is VALID [2018-11-23 11:52:36,318 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:36,319 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {19575#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,320 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:36,321 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {19576#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,329 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:36,330 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {19577#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,331 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:36,331 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {19578#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,332 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:36,332 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {19579#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,333 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:36,333 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {19580#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,334 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:36,334 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {19581#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,336 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:36,337 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {19582#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,338 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:36,339 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {19583#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,340 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:36,341 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {19584#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,342 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:36,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {19585#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,344 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:36,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {19586#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,346 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:36,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {19587#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,347 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:36,348 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {19588#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,349 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:36,350 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {19589#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,351 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:36,352 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,352 INFO L273 TraceCheckUtils]: 56: Hoare triple {19590#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,353 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:36,353 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,354 INFO L273 TraceCheckUtils]: 59: Hoare triple {19591#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,355 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:36,355 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,356 INFO L273 TraceCheckUtils]: 62: Hoare triple {19592#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,357 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:36,357 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,358 INFO L273 TraceCheckUtils]: 65: Hoare triple {19593#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,358 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:36,359 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {19594#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,360 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:36,361 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,361 INFO L273 TraceCheckUtils]: 71: Hoare triple {19595#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,362 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:36,363 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,363 INFO L273 TraceCheckUtils]: 74: Hoare triple {19596#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,364 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:36,367 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,367 INFO L273 TraceCheckUtils]: 77: Hoare triple {19597#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,369 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:36,370 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,370 INFO L273 TraceCheckUtils]: 80: Hoare triple {19598#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,370 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:36,371 INFO L273 TraceCheckUtils]: 82: Hoare triple {19599#(<= main_~i~0 26)} assume !(~i~0 < 100000); {19573#false} is VALID [2018-11-23 11:52:36,371 INFO L273 TraceCheckUtils]: 83: Hoare triple {19573#false} assume !(0 != ~swapped~0); {19573#false} is VALID [2018-11-23 11:52:36,371 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:36,371 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:36,371 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:36,372 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:36,372 INFO L273 TraceCheckUtils]: 88: Hoare triple {19573#false} ~cond := #in~cond; {19573#false} is VALID [2018-11-23 11:52:36,372 INFO L273 TraceCheckUtils]: 89: Hoare triple {19573#false} assume 0 == ~cond; {19573#false} is VALID [2018-11-23 11:52:36,372 INFO L273 TraceCheckUtils]: 90: Hoare triple {19573#false} assume !false; {19573#false} is VALID [2018-11-23 11:52:36,378 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:36,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:36,379 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:36,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:36,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:36,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {19572#true} call ULTIMATE.init(); {19572#true} is VALID [2018-11-23 11:52:36,754 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:36,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {19572#true} assume true; {19572#true} is VALID [2018-11-23 11:52:36,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19572#true} {19572#true} #79#return; {19572#true} is VALID [2018-11-23 11:52:36,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {19572#true} call #t~ret8 := main(); {19572#true} is VALID [2018-11-23 11:52:36,755 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:36,756 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:36,757 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19621#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:36,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {19621#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19621#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:36,758 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:36,758 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {19575#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19575#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:36,759 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:36,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {19576#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19576#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:36,760 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:36,761 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {19577#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19577#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:36,762 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:36,762 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {19578#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19578#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:36,764 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:36,764 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {19579#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19579#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:36,792 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:36,793 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {19580#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19580#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:36,796 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:36,796 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {19581#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19581#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:36,797 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:36,798 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {19582#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19582#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:36,798 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:36,799 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {19583#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19583#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:36,800 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:36,800 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {19584#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19584#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:36,802 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:36,802 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {19585#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19585#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:36,803 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:36,804 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {19586#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19586#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:36,805 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:36,806 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {19587#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19587#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:36,807 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:36,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {19588#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19588#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:36,812 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:36,812 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {19589#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19589#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:36,813 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:36,814 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,814 INFO L273 TraceCheckUtils]: 56: Hoare triple {19590#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19590#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:36,814 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:36,815 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,815 INFO L273 TraceCheckUtils]: 59: Hoare triple {19591#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19591#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:36,816 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:36,817 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {19592#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19592#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:36,818 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:36,818 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {19593#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19593#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:36,820 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:36,820 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,821 INFO L273 TraceCheckUtils]: 68: Hoare triple {19594#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19594#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:36,821 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:36,822 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {19595#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19595#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:36,823 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:36,824 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,824 INFO L273 TraceCheckUtils]: 74: Hoare triple {19596#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19596#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:36,825 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:36,825 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,826 INFO L273 TraceCheckUtils]: 77: Hoare triple {19597#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19597#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:36,826 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:36,827 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,828 INFO L273 TraceCheckUtils]: 80: Hoare triple {19598#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {19598#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:36,828 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:36,829 INFO L273 TraceCheckUtils]: 82: Hoare triple {19599#(<= main_~i~0 26)} assume !(~i~0 < 100000); {19573#false} is VALID [2018-11-23 11:52:36,829 INFO L273 TraceCheckUtils]: 83: Hoare triple {19573#false} assume !(0 != ~swapped~0); {19573#false} is VALID [2018-11-23 11:52:36,829 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:36,829 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:36,830 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:36,830 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:36,830 INFO L273 TraceCheckUtils]: 88: Hoare triple {19573#false} ~cond := #in~cond; {19573#false} is VALID [2018-11-23 11:52:36,830 INFO L273 TraceCheckUtils]: 89: Hoare triple {19573#false} assume 0 == ~cond; {19573#false} is VALID [2018-11-23 11:52:36,830 INFO L273 TraceCheckUtils]: 90: Hoare triple {19573#false} assume !false; {19573#false} is VALID [2018-11-23 11:52:36,837 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:36,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:36,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 11:52:36,855 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:52:36,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:36,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:52:36,977 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:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:52:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:52:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:36,978 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand 29 states. [2018-11-23 11:52:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:37,566 INFO L93 Difference]: Finished difference Result 346 states and 458 transitions. [2018-11-23 11:52:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:52:37,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-11-23 11:52:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 153 transitions. [2018-11-23 11:52:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:52:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 153 transitions. [2018-11-23 11:52:37,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 153 transitions. [2018-11-23 11:52:37,748 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:37,752 INFO L225 Difference]: With dead ends: 346 [2018-11-23 11:52:37,752 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 11:52:37,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:52:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 11:52:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-11-23 11:52:38,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:38,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:38,115 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:38,115 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 177 states. [2018-11-23 11:52:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:38,119 INFO L93 Difference]: Finished difference Result 181 states and 238 transitions. [2018-11-23 11:52:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 238 transitions. [2018-11-23 11:52:38,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:38,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:38,120 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 181 states. [2018-11-23 11:52:38,120 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 181 states. [2018-11-23 11:52:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:38,123 INFO L93 Difference]: Finished difference Result 181 states and 238 transitions. [2018-11-23 11:52:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 238 transitions. [2018-11-23 11:52:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:38,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:38,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:38,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-23 11:52:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-11-23 11:52:38,126 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 91 [2018-11-23 11:52:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:38,127 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-11-23 11:52:38,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:52:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-11-23 11:52:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 11:52:38,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:38,127 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:38,127 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:38,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:38,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1719789327, now seen corresponding path program 26 times [2018-11-23 11:52:38,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:38,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:38,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:38,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:38,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:39,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {20941#true} call ULTIMATE.init(); {20941#true} is VALID [2018-11-23 11:52:39,208 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:39,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {20941#true} assume true; {20941#true} is VALID [2018-11-23 11:52:39,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20941#true} {20941#true} #79#return; {20941#true} is VALID [2018-11-23 11:52:39,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {20941#true} call #t~ret8 := main(); {20941#true} is VALID [2018-11-23 11:52:39,209 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:39,210 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:39,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20943#(= main_~i~0 1)} is VALID [2018-11-23 11:52:39,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {20943#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20943#(= main_~i~0 1)} is VALID [2018-11-23 11:52:39,212 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:39,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {20944#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,213 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:39,214 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {20945#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,214 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:39,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {20946#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,216 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:39,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {20947#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,218 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:39,218 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {20948#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,219 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:39,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {20949#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,221 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:39,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {20950#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,223 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:39,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {20951#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,225 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:39,226 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {20952#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,227 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:39,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {20953#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,229 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:39,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {20954#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,231 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:39,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {20955#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,233 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:39,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {20956#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,235 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:39,235 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {20957#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,237 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:39,237 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {20958#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,238 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:39,239 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {20959#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,240 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:39,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {20960#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,242 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:39,242 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {20961#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,244 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:39,244 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,245 INFO L273 TraceCheckUtils]: 65: Hoare triple {20962#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,246 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:39,246 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {20963#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,247 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:39,248 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {20964#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,249 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:39,250 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {20965#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,251 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:39,252 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,252 INFO L273 TraceCheckUtils]: 77: Hoare triple {20966#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,253 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:39,253 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,254 INFO L273 TraceCheckUtils]: 80: Hoare triple {20967#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,255 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:39,255 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {20968#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,257 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:39,257 INFO L273 TraceCheckUtils]: 85: Hoare triple {20969#(<= main_~i~0 27)} assume !(~i~0 < 100000); {20942#false} is VALID [2018-11-23 11:52:39,257 INFO L273 TraceCheckUtils]: 86: Hoare triple {20942#false} assume !(0 != ~swapped~0); {20942#false} is VALID [2018-11-23 11:52:39,258 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:39,258 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:39,258 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:39,258 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:39,258 INFO L273 TraceCheckUtils]: 91: Hoare triple {20942#false} ~cond := #in~cond; {20942#false} is VALID [2018-11-23 11:52:39,259 INFO L273 TraceCheckUtils]: 92: Hoare triple {20942#false} assume 0 == ~cond; {20942#false} is VALID [2018-11-23 11:52:39,259 INFO L273 TraceCheckUtils]: 93: Hoare triple {20942#false} assume !false; {20942#false} is VALID [2018-11-23 11:52:39,265 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:39,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:39,266 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:39,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:39,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:39,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:39,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:39,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {20941#true} call ULTIMATE.init(); {20941#true} is VALID [2018-11-23 11:52:39,609 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:39,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {20941#true} assume true; {20941#true} is VALID [2018-11-23 11:52:39,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20941#true} {20941#true} #79#return; {20941#true} is VALID [2018-11-23 11:52:39,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {20941#true} call #t~ret8 := main(); {20941#true} is VALID [2018-11-23 11:52:39,610 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:39,610 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:39,611 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20991#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:39,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {20991#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20991#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:39,612 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:39,612 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {20944#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20944#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:39,613 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:39,613 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {20945#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20945#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:39,615 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:39,615 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {20946#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20946#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:39,617 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:39,617 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {20947#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20947#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:39,619 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:39,619 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {20948#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20948#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:39,621 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:39,621 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {20949#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20949#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:39,622 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:39,623 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {20950#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20950#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:39,624 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:39,625 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {20951#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20951#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:39,626 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:39,626 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,627 INFO L273 TraceCheckUtils]: 35: Hoare triple {20952#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20952#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:39,628 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:39,628 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,629 INFO L273 TraceCheckUtils]: 38: Hoare triple {20953#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20953#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:39,629 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:39,630 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,630 INFO L273 TraceCheckUtils]: 41: Hoare triple {20954#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20954#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:39,631 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:39,631 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {20955#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20955#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:39,633 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:39,633 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,634 INFO L273 TraceCheckUtils]: 47: Hoare triple {20956#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20956#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:39,635 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:39,635 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,636 INFO L273 TraceCheckUtils]: 50: Hoare triple {20957#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20957#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:39,636 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:39,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {20958#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20958#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:39,638 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:39,639 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {20959#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20959#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:39,640 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:39,641 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,641 INFO L273 TraceCheckUtils]: 59: Hoare triple {20960#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20960#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:39,642 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:39,643 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,643 INFO L273 TraceCheckUtils]: 62: Hoare triple {20961#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20961#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:39,644 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:39,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {20962#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20962#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:39,646 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:39,646 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {20963#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20963#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:39,648 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:39,648 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {20964#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20964#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:39,650 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:39,650 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,651 INFO L273 TraceCheckUtils]: 74: Hoare triple {20965#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20965#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:39,651 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:39,652 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,653 INFO L273 TraceCheckUtils]: 77: Hoare triple {20966#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20966#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:39,653 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:39,654 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,655 INFO L273 TraceCheckUtils]: 80: Hoare triple {20967#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20967#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:39,655 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:39,656 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {20968#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {20968#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:39,657 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:39,658 INFO L273 TraceCheckUtils]: 85: Hoare triple {20969#(<= main_~i~0 27)} assume !(~i~0 < 100000); {20942#false} is VALID [2018-11-23 11:52:39,658 INFO L273 TraceCheckUtils]: 86: Hoare triple {20942#false} assume !(0 != ~swapped~0); {20942#false} is VALID [2018-11-23 11:52:39,658 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:39,658 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:39,659 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:39,659 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:39,659 INFO L273 TraceCheckUtils]: 91: Hoare triple {20942#false} ~cond := #in~cond; {20942#false} is VALID [2018-11-23 11:52:39,659 INFO L273 TraceCheckUtils]: 92: Hoare triple {20942#false} assume 0 == ~cond; {20942#false} is VALID [2018-11-23 11:52:39,659 INFO L273 TraceCheckUtils]: 93: Hoare triple {20942#false} assume !false; {20942#false} is VALID [2018-11-23 11:52:39,666 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:39,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 11:52:39,686 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:52:39,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:39,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:52:39,786 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:39,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:52:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:52:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:39,787 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 30 states. [2018-11-23 11:52:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,560 INFO L93 Difference]: Finished difference Result 358 states and 474 transitions. [2018-11-23 11:52:40,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:52:40,560 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-23 11:52:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 157 transitions. [2018-11-23 11:52:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:52:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 157 transitions. [2018-11-23 11:52:40,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 157 transitions. [2018-11-23 11:52:40,729 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:40,733 INFO L225 Difference]: With dead ends: 358 [2018-11-23 11:52:40,733 INFO L226 Difference]: Without dead ends: 187 [2018-11-23 11:52:40,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:52:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-23 11:52:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-11-23 11:52:40,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:40,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:40,842 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:40,842 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 183 states. [2018-11-23 11:52:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,846 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2018-11-23 11:52:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2018-11-23 11:52:40,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:40,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:40,846 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 187 states. [2018-11-23 11:52:40,846 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 187 states. [2018-11-23 11:52:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:40,849 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2018-11-23 11:52:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 246 transitions. [2018-11-23 11:52:40,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:40,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:40,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:40,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 11:52:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2018-11-23 11:52:40,852 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 94 [2018-11-23 11:52:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:40,852 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2018-11-23 11:52:40,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:52:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2018-11-23 11:52:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 11:52:40,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:40,853 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:40,853 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:40,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -866306840, now seen corresponding path program 27 times [2018-11-23 11:52:40,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:40,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:41,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {22356#true} call ULTIMATE.init(); {22356#true} is VALID [2018-11-23 11:52:41,871 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:41,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {22356#true} assume true; {22356#true} is VALID [2018-11-23 11:52:41,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22356#true} {22356#true} #79#return; {22356#true} is VALID [2018-11-23 11:52:41,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {22356#true} call #t~ret8 := main(); {22356#true} is VALID [2018-11-23 11:52:41,872 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:41,873 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:41,873 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22358#(= main_~i~0 1)} is VALID [2018-11-23 11:52:41,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {22358#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22358#(= main_~i~0 1)} is VALID [2018-11-23 11:52:41,874 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:41,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {22359#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:41,875 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:41,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {22360#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:41,877 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:41,877 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {22361#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:41,879 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:41,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {22362#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:41,881 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:41,882 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {22363#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:41,883 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:41,883 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,884 INFO L273 TraceCheckUtils]: 26: Hoare triple {22364#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:41,885 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:41,885 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,886 INFO L273 TraceCheckUtils]: 29: Hoare triple {22365#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:41,887 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:41,889 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:41,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {22366#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:41,890 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:41,891 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:41,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {22367#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:41,892 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:41,893 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:41,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {22368#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:41,894 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:41,894 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:41,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:41,896 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:41,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:41,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {22370#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:41,898 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:41,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:41,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {22371#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:41,900 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:41,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:41,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {22372#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:41,902 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:41,902 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:41,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {22373#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:41,903 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:41,904 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:41,905 INFO L273 TraceCheckUtils]: 56: Hoare triple {22374#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:41,905 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:41,906 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:41,906 INFO L273 TraceCheckUtils]: 59: Hoare triple {22375#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:41,907 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:41,908 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:41,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {22376#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:41,909 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:41,910 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:41,910 INFO L273 TraceCheckUtils]: 65: Hoare triple {22377#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:41,911 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:41,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:41,912 INFO L273 TraceCheckUtils]: 68: Hoare triple {22378#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:41,913 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:41,913 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:41,914 INFO L273 TraceCheckUtils]: 71: Hoare triple {22379#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:41,915 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:41,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:41,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {22380#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:41,916 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:41,917 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:41,918 INFO L273 TraceCheckUtils]: 77: Hoare triple {22381#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:41,918 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:41,919 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:41,920 INFO L273 TraceCheckUtils]: 80: Hoare triple {22382#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:41,920 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:41,921 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:41,921 INFO L273 TraceCheckUtils]: 83: Hoare triple {22383#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:41,922 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:41,922 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:41,923 INFO L273 TraceCheckUtils]: 86: Hoare triple {22384#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:41,924 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:41,924 INFO L273 TraceCheckUtils]: 88: Hoare triple {22385#(<= main_~i~0 28)} assume !(~i~0 < 100000); {22357#false} is VALID [2018-11-23 11:52:41,925 INFO L273 TraceCheckUtils]: 89: Hoare triple {22357#false} assume !(0 != ~swapped~0); {22357#false} is VALID [2018-11-23 11:52:41,925 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:41,925 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:41,925 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:41,925 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:41,926 INFO L273 TraceCheckUtils]: 94: Hoare triple {22357#false} ~cond := #in~cond; {22357#false} is VALID [2018-11-23 11:52:41,926 INFO L273 TraceCheckUtils]: 95: Hoare triple {22357#false} assume 0 == ~cond; {22357#false} is VALID [2018-11-23 11:52:41,926 INFO L273 TraceCheckUtils]: 96: Hoare triple {22357#false} assume !false; {22357#false} is VALID [2018-11-23 11:52:41,933 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:41,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:41,934 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:41,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:42,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-11-23 11:52:42,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:42,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:42,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {22356#true} call ULTIMATE.init(); {22356#true} is VALID [2018-11-23 11:52:42,327 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:42,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {22356#true} assume true; {22356#true} is VALID [2018-11-23 11:52:42,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22356#true} {22356#true} #79#return; {22356#true} is VALID [2018-11-23 11:52:42,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {22356#true} call #t~ret8 := main(); {22356#true} is VALID [2018-11-23 11:52:42,328 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:42,331 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:42,331 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22407#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {22407#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22407#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:42,332 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:42,333 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {22359#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22359#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:42,333 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:42,334 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {22360#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22360#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:42,335 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:42,336 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {22361#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22361#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:42,337 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:42,338 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {22362#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22362#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:42,339 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:42,340 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:42,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {22363#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22363#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:42,341 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:42,342 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:42,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {22364#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22364#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:42,343 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:42,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:42,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {22365#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22365#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:42,345 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:42,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:42,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {22366#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22366#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:42,347 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:42,347 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:42,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {22367#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22367#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:42,349 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:42,349 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:42,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {22368#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22368#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:42,351 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:42,351 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:42,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22369#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:42,352 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:42,353 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:42,354 INFO L273 TraceCheckUtils]: 44: Hoare triple {22370#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22370#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:42,354 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:42,355 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:42,355 INFO L273 TraceCheckUtils]: 47: Hoare triple {22371#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22371#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:42,356 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:42,357 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:42,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {22372#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22372#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:42,358 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:42,359 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:42,359 INFO L273 TraceCheckUtils]: 53: Hoare triple {22373#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22373#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:42,360 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:42,361 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:42,361 INFO L273 TraceCheckUtils]: 56: Hoare triple {22374#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22374#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:42,362 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:42,363 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:42,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {22375#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22375#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:42,364 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:42,365 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:42,365 INFO L273 TraceCheckUtils]: 62: Hoare triple {22376#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22376#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:42,366 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:42,366 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:42,367 INFO L273 TraceCheckUtils]: 65: Hoare triple {22377#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22377#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:42,368 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:42,368 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:42,369 INFO L273 TraceCheckUtils]: 68: Hoare triple {22378#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22378#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:42,370 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:42,370 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:42,371 INFO L273 TraceCheckUtils]: 71: Hoare triple {22379#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22379#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:42,372 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:42,372 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:42,373 INFO L273 TraceCheckUtils]: 74: Hoare triple {22380#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22380#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:42,374 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:42,374 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:42,375 INFO L273 TraceCheckUtils]: 77: Hoare triple {22381#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22381#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:42,376 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:42,376 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:42,377 INFO L273 TraceCheckUtils]: 80: Hoare triple {22382#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22382#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:42,377 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:42,378 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:42,379 INFO L273 TraceCheckUtils]: 83: Hoare triple {22383#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22383#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:42,379 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:42,380 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:42,381 INFO L273 TraceCheckUtils]: 86: Hoare triple {22384#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {22384#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:42,381 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:42,382 INFO L273 TraceCheckUtils]: 88: Hoare triple {22385#(<= main_~i~0 28)} assume !(~i~0 < 100000); {22357#false} is VALID [2018-11-23 11:52:42,382 INFO L273 TraceCheckUtils]: 89: Hoare triple {22357#false} assume !(0 != ~swapped~0); {22357#false} is VALID [2018-11-23 11:52:42,382 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:42,383 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:42,383 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:42,383 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:42,383 INFO L273 TraceCheckUtils]: 94: Hoare triple {22357#false} ~cond := #in~cond; {22357#false} is VALID [2018-11-23 11:52:42,383 INFO L273 TraceCheckUtils]: 95: Hoare triple {22357#false} assume 0 == ~cond; {22357#false} is VALID [2018-11-23 11:52:42,384 INFO L273 TraceCheckUtils]: 96: Hoare triple {22357#false} assume !false; {22357#false} is VALID [2018-11-23 11:52:42,391 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:42,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 11:52:42,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:52:42,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:42,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:52:42,516 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:42,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:52:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:52:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:52:42,517 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 31 states. [2018-11-23 11:52:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,413 INFO L93 Difference]: Finished difference Result 370 states and 490 transitions. [2018-11-23 11:52:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:52:43,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-11-23 11:52:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 161 transitions. [2018-11-23 11:52:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:52:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 161 transitions. [2018-11-23 11:52:43,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 161 transitions. [2018-11-23 11:52:43,588 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:43,592 INFO L225 Difference]: With dead ends: 370 [2018-11-23 11:52:43,593 INFO L226 Difference]: Without dead ends: 193 [2018-11-23 11:52:43,594 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:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-23 11:52:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-23 11:52:43,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:43,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:43,779 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:43,779 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 189 states. [2018-11-23 11:52:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,783 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2018-11-23 11:52:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2018-11-23 11:52:43,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,783 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 193 states. [2018-11-23 11:52:43,783 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 193 states. [2018-11-23 11:52:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:43,787 INFO L93 Difference]: Finished difference Result 193 states and 254 transitions. [2018-11-23 11:52:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2018-11-23 11:52:43,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:43,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:43,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:43,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 11:52:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 248 transitions. [2018-11-23 11:52:43,790 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 248 transitions. Word has length 97 [2018-11-23 11:52:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:43,791 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 248 transitions. [2018-11-23 11:52:43,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:52:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 248 transitions. [2018-11-23 11:52:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 11:52:43,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:43,792 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:43,792 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:43,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -975928943, now seen corresponding path program 28 times [2018-11-23 11:52:43,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:44,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {23817#true} call ULTIMATE.init(); {23817#true} is VALID [2018-11-23 11:52:44,836 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:44,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {23817#true} assume true; {23817#true} is VALID [2018-11-23 11:52:44,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23817#true} {23817#true} #79#return; {23817#true} is VALID [2018-11-23 11:52:44,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {23817#true} call #t~ret8 := main(); {23817#true} is VALID [2018-11-23 11:52:44,837 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:44,838 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:44,838 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23819#(= main_~i~0 1)} is VALID [2018-11-23 11:52:44,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {23819#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23819#(= main_~i~0 1)} is VALID [2018-11-23 11:52:44,840 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:44,840 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:44,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {23820#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:44,842 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:44,843 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:44,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {23821#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:44,847 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:44,847 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:44,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {23822#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:44,848 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:44,848 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {23823#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:44,849 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:44,849 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {23824#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:44,851 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:44,851 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,852 INFO L273 TraceCheckUtils]: 26: Hoare triple {23825#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:44,853 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:44,853 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {23826#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:44,855 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:44,855 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {23827#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:44,857 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:44,857 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {23828#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:44,859 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:44,859 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,860 INFO L273 TraceCheckUtils]: 38: Hoare triple {23829#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:44,861 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:44,861 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {23830#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:44,863 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:44,863 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,864 INFO L273 TraceCheckUtils]: 44: Hoare triple {23831#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:44,864 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:44,865 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,866 INFO L273 TraceCheckUtils]: 47: Hoare triple {23832#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:44,866 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:44,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {23833#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:44,868 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:44,869 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,869 INFO L273 TraceCheckUtils]: 53: Hoare triple {23834#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:44,870 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:44,870 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {23835#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:44,872 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:44,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {23836#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:44,874 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:44,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,875 INFO L273 TraceCheckUtils]: 62: Hoare triple {23837#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:44,876 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:44,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,877 INFO L273 TraceCheckUtils]: 65: Hoare triple {23838#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:44,877 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:44,878 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {23839#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:44,879 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:44,880 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {23840#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:44,881 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:44,882 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,882 INFO L273 TraceCheckUtils]: 74: Hoare triple {23841#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:44,883 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:44,884 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,884 INFO L273 TraceCheckUtils]: 77: Hoare triple {23842#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:44,885 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:44,886 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,886 INFO L273 TraceCheckUtils]: 80: Hoare triple {23843#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:44,887 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:44,888 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,888 INFO L273 TraceCheckUtils]: 83: Hoare triple {23844#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:44,889 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:44,889 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,890 INFO L273 TraceCheckUtils]: 86: Hoare triple {23845#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:44,891 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:44,891 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,892 INFO L273 TraceCheckUtils]: 89: Hoare triple {23846#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:44,893 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:44,893 INFO L273 TraceCheckUtils]: 91: Hoare triple {23847#(<= main_~i~0 29)} assume !(~i~0 < 100000); {23818#false} is VALID [2018-11-23 11:52:44,894 INFO L273 TraceCheckUtils]: 92: Hoare triple {23818#false} assume !(0 != ~swapped~0); {23818#false} is VALID [2018-11-23 11:52:44,894 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:44,894 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:44,894 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:44,894 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:44,895 INFO L273 TraceCheckUtils]: 97: Hoare triple {23818#false} ~cond := #in~cond; {23818#false} is VALID [2018-11-23 11:52:44,895 INFO L273 TraceCheckUtils]: 98: Hoare triple {23818#false} assume 0 == ~cond; {23818#false} is VALID [2018-11-23 11:52:44,895 INFO L273 TraceCheckUtils]: 99: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2018-11-23 11:52:44,904 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:44,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:44,904 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:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:52:44,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:52:44,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:45,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:45,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {23817#true} call ULTIMATE.init(); {23817#true} is VALID [2018-11-23 11:52:45,416 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:45,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {23817#true} assume true; {23817#true} is VALID [2018-11-23 11:52:45,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23817#true} {23817#true} #79#return; {23817#true} is VALID [2018-11-23 11:52:45,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {23817#true} call #t~ret8 := main(); {23817#true} is VALID [2018-11-23 11:52:45,416 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:45,417 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:45,418 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:45,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {23869#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23869#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:45,418 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:45,419 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:45,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {23820#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23820#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:45,420 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:45,420 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:45,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {23821#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23821#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:45,422 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:45,422 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:45,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {23822#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23822#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:45,423 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:45,424 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:45,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {23823#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23823#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:45,425 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:45,426 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:45,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {23824#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23824#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:45,427 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:45,428 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:45,428 INFO L273 TraceCheckUtils]: 26: Hoare triple {23825#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23825#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:45,429 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:45,430 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:45,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {23826#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23826#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:45,431 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:45,431 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:45,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {23827#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23827#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:45,432 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:45,433 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:45,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {23828#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23828#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:45,434 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:45,435 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:45,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {23829#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23829#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:45,436 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:45,437 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:45,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {23830#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23830#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:45,438 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:45,438 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:45,439 INFO L273 TraceCheckUtils]: 44: Hoare triple {23831#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23831#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:45,439 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:45,440 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:45,440 INFO L273 TraceCheckUtils]: 47: Hoare triple {23832#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23832#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:45,441 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:45,442 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:45,442 INFO L273 TraceCheckUtils]: 50: Hoare triple {23833#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23833#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:45,443 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:45,453 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:45,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {23834#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23834#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:45,455 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:45,455 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:45,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {23835#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23835#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:45,456 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:45,456 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:45,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {23836#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23836#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:45,457 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:45,457 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:45,457 INFO L273 TraceCheckUtils]: 62: Hoare triple {23837#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23837#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:45,458 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:45,458 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:45,458 INFO L273 TraceCheckUtils]: 65: Hoare triple {23838#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23838#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:45,459 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:45,459 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:45,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {23839#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23839#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:45,461 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:45,461 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:45,462 INFO L273 TraceCheckUtils]: 71: Hoare triple {23840#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23840#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:45,462 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:45,463 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:45,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {23841#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23841#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:45,464 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:45,465 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:45,465 INFO L273 TraceCheckUtils]: 77: Hoare triple {23842#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23842#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:45,466 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:45,467 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:45,467 INFO L273 TraceCheckUtils]: 80: Hoare triple {23843#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23843#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:45,468 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:45,469 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:45,469 INFO L273 TraceCheckUtils]: 83: Hoare triple {23844#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23844#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:45,470 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:45,470 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:45,471 INFO L273 TraceCheckUtils]: 86: Hoare triple {23845#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23845#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:45,472 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:45,472 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:45,473 INFO L273 TraceCheckUtils]: 89: Hoare triple {23846#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {23846#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:45,473 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:45,474 INFO L273 TraceCheckUtils]: 91: Hoare triple {23847#(<= main_~i~0 29)} assume !(~i~0 < 100000); {23818#false} is VALID [2018-11-23 11:52:45,474 INFO L273 TraceCheckUtils]: 92: Hoare triple {23818#false} assume !(0 != ~swapped~0); {23818#false} is VALID [2018-11-23 11:52:45,474 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:45,475 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:45,475 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:45,475 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:45,475 INFO L273 TraceCheckUtils]: 97: Hoare triple {23818#false} ~cond := #in~cond; {23818#false} is VALID [2018-11-23 11:52:45,475 INFO L273 TraceCheckUtils]: 98: Hoare triple {23818#false} assume 0 == ~cond; {23818#false} is VALID [2018-11-23 11:52:45,475 INFO L273 TraceCheckUtils]: 99: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2018-11-23 11:52:45,483 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:45,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:45,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 11:52:45,501 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:52:45,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:45,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:52:45,648 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:45,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:52:45,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:52:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:45,650 INFO L87 Difference]: Start difference. First operand 189 states and 248 transitions. Second operand 32 states. [2018-11-23 11:52:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,508 INFO L93 Difference]: Finished difference Result 382 states and 506 transitions. [2018-11-23 11:52:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:52:46,508 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2018-11-23 11:52:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 165 transitions. [2018-11-23 11:52:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:52:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 165 transitions. [2018-11-23 11:52:46,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 165 transitions. [2018-11-23 11:52:46,703 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:46,707 INFO L225 Difference]: With dead ends: 382 [2018-11-23 11:52:46,707 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 11:52:46,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:52:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 11:52:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-11-23 11:52:46,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:46,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:46,786 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:46,786 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 195 states. [2018-11-23 11:52:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,790 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2018-11-23 11:52:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2018-11-23 11:52:46,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:46,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:46,790 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 199 states. [2018-11-23 11:52:46,790 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 199 states. [2018-11-23 11:52:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:46,794 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2018-11-23 11:52:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2018-11-23 11:52:46,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:46,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:46,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:46,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 11:52:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 256 transitions. [2018-11-23 11:52:46,799 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 256 transitions. Word has length 100 [2018-11-23 11:52:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:46,799 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 256 transitions. [2018-11-23 11:52:46,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:52:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 256 transitions. [2018-11-23 11:52:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 11:52:46,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:46,800 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:46,800 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:46,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1742112840, now seen corresponding path program 29 times [2018-11-23 11:52:46,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:46,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:46,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:47,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {25324#true} call ULTIMATE.init(); {25324#true} is VALID [2018-11-23 11:52:47,678 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:47,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {25324#true} assume true; {25324#true} is VALID [2018-11-23 11:52:47,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25324#true} {25324#true} #79#return; {25324#true} is VALID [2018-11-23 11:52:47,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {25324#true} call #t~ret8 := main(); {25324#true} is VALID [2018-11-23 11:52:47,679 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:47,679 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:47,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:47,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {25326#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25326#(= main_~i~0 1)} is VALID [2018-11-23 11:52:47,681 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:47,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {25327#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:47,682 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:47,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {25328#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:47,684 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:47,684 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {25329#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:47,686 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:47,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {25330#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:47,687 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:47,688 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {25331#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:47,689 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:47,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,691 INFO L273 TraceCheckUtils]: 26: Hoare triple {25332#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:47,691 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:47,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {25333#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:47,693 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:47,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {25334#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:47,695 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:47,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {25335#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:47,697 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:47,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {25336#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:47,698 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:47,699 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,699 INFO L273 TraceCheckUtils]: 41: Hoare triple {25337#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:47,700 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:47,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,701 INFO L273 TraceCheckUtils]: 44: Hoare triple {25338#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:47,702 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:47,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,703 INFO L273 TraceCheckUtils]: 47: Hoare triple {25339#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:47,704 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:47,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {25340#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:47,706 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:47,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {25341#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:47,708 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:47,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,709 INFO L273 TraceCheckUtils]: 56: Hoare triple {25342#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:47,710 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:47,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,711 INFO L273 TraceCheckUtils]: 59: Hoare triple {25343#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:47,712 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:47,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,713 INFO L273 TraceCheckUtils]: 62: Hoare triple {25344#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:47,714 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:47,714 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,715 INFO L273 TraceCheckUtils]: 65: Hoare triple {25345#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:47,716 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:47,716 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,717 INFO L273 TraceCheckUtils]: 68: Hoare triple {25346#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:47,717 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:47,718 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,719 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:47,719 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:47,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,721 INFO L273 TraceCheckUtils]: 74: Hoare triple {25348#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:47,721 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:47,722 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,723 INFO L273 TraceCheckUtils]: 77: Hoare triple {25349#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:47,723 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:47,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,725 INFO L273 TraceCheckUtils]: 80: Hoare triple {25350#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:47,725 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:47,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {25351#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:47,727 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:47,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,728 INFO L273 TraceCheckUtils]: 86: Hoare triple {25352#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:47,729 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:47,730 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,730 INFO L273 TraceCheckUtils]: 89: Hoare triple {25353#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:47,731 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:47,731 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,732 INFO L273 TraceCheckUtils]: 92: Hoare triple {25354#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:47,733 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:47,734 INFO L273 TraceCheckUtils]: 94: Hoare triple {25355#(<= main_~i~0 30)} assume !(~i~0 < 100000); {25325#false} is VALID [2018-11-23 11:52:47,734 INFO L273 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(0 != ~swapped~0); {25325#false} is VALID [2018-11-23 11:52:47,734 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:47,734 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:47,734 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:47,735 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:47,735 INFO L273 TraceCheckUtils]: 100: Hoare triple {25325#false} ~cond := #in~cond; {25325#false} is VALID [2018-11-23 11:52:47,735 INFO L273 TraceCheckUtils]: 101: Hoare triple {25325#false} assume 0 == ~cond; {25325#false} is VALID [2018-11-23 11:52:47,736 INFO L273 TraceCheckUtils]: 102: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2018-11-23 11:52:47,745 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:47,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:47,746 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:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:52:47,858 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:52:47,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:47,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:48,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {25324#true} call ULTIMATE.init(); {25324#true} is VALID [2018-11-23 11:52:48,188 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:48,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {25324#true} assume true; {25324#true} is VALID [2018-11-23 11:52:48,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25324#true} {25324#true} #79#return; {25324#true} is VALID [2018-11-23 11:52:48,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {25324#true} call #t~ret8 := main(); {25324#true} is VALID [2018-11-23 11:52:48,189 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:48,190 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:48,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25377#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:48,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {25377#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25377#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:48,191 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:48,191 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:48,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {25327#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25327#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:48,192 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:48,192 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:48,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {25328#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25328#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:48,193 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:48,194 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:48,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {25329#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25329#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:48,195 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:48,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:48,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {25330#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25330#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:48,197 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:48,198 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:48,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {25331#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25331#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:48,199 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:48,199 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:48,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {25332#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25332#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:48,200 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:48,201 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:48,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {25333#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25333#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:48,202 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:48,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:48,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {25334#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25334#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:48,204 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:48,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:48,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {25335#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25335#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:48,206 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:48,207 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:48,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {25336#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25336#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:48,208 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:48,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:48,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {25337#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25337#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:48,210 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:48,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:48,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {25338#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25338#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:48,212 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:48,212 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:48,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {25339#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25339#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:48,214 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:48,214 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:48,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {25340#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25340#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:48,220 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:48,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:48,220 INFO L273 TraceCheckUtils]: 53: Hoare triple {25341#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25341#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:48,221 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:48,221 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:48,221 INFO L273 TraceCheckUtils]: 56: Hoare triple {25342#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25342#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:48,222 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:48,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:48,222 INFO L273 TraceCheckUtils]: 59: Hoare triple {25343#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25343#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:48,223 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:48,223 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:48,224 INFO L273 TraceCheckUtils]: 62: Hoare triple {25344#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25344#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:48,225 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:48,225 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:48,226 INFO L273 TraceCheckUtils]: 65: Hoare triple {25345#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25345#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:48,226 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:48,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:48,228 INFO L273 TraceCheckUtils]: 68: Hoare triple {25346#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25346#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:48,228 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:48,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:48,229 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25347#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:48,230 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:48,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:48,231 INFO L273 TraceCheckUtils]: 74: Hoare triple {25348#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25348#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:48,232 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:48,232 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:48,233 INFO L273 TraceCheckUtils]: 77: Hoare triple {25349#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25349#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:48,233 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:48,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:48,235 INFO L273 TraceCheckUtils]: 80: Hoare triple {25350#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25350#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:48,235 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:48,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:48,236 INFO L273 TraceCheckUtils]: 83: Hoare triple {25351#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25351#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:48,237 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:48,238 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:48,238 INFO L273 TraceCheckUtils]: 86: Hoare triple {25352#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25352#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:48,239 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:48,240 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:48,240 INFO L273 TraceCheckUtils]: 89: Hoare triple {25353#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25353#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:48,241 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:48,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:48,242 INFO L273 TraceCheckUtils]: 92: Hoare triple {25354#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {25354#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:48,243 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:48,243 INFO L273 TraceCheckUtils]: 94: Hoare triple {25355#(<= main_~i~0 30)} assume !(~i~0 < 100000); {25325#false} is VALID [2018-11-23 11:52:48,244 INFO L273 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(0 != ~swapped~0); {25325#false} is VALID [2018-11-23 11:52:48,244 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:48,244 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:48,244 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:48,244 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:48,244 INFO L273 TraceCheckUtils]: 100: Hoare triple {25325#false} ~cond := #in~cond; {25325#false} is VALID [2018-11-23 11:52:48,245 INFO L273 TraceCheckUtils]: 101: Hoare triple {25325#false} assume 0 == ~cond; {25325#false} is VALID [2018-11-23 11:52:48,245 INFO L273 TraceCheckUtils]: 102: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2018-11-23 11:52:48,253 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:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 11:52:48,272 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:52:48,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:48,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:52:48,387 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:48,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:52:48,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:52:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:52:48,388 INFO L87 Difference]: Start difference. First operand 195 states and 256 transitions. Second operand 33 states. [2018-11-23 11:52:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,054 INFO L93 Difference]: Finished difference Result 394 states and 522 transitions. [2018-11-23 11:52:49,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:52:49,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-11-23 11:52:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:52:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2018-11-23 11:52:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:52:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 169 transitions. [2018-11-23 11:52:49,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 169 transitions. [2018-11-23 11:52:49,312 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:49,315 INFO L225 Difference]: With dead ends: 394 [2018-11-23 11:52:49,315 INFO L226 Difference]: Without dead ends: 205 [2018-11-23 11:52:49,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:52:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-23 11:52:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2018-11-23 11:52:49,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:49,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:49,465 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:49,465 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 201 states. [2018-11-23 11:52:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,469 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2018-11-23 11:52:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2018-11-23 11:52:49,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,469 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 205 states. [2018-11-23 11:52:49,469 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 205 states. [2018-11-23 11:52:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:49,472 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2018-11-23 11:52:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2018-11-23 11:52:49,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:49,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:49,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:49,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 11:52:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 264 transitions. [2018-11-23 11:52:49,476 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 264 transitions. Word has length 103 [2018-11-23 11:52:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:49,476 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 264 transitions. [2018-11-23 11:52:49,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:52:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 264 transitions. [2018-11-23 11:52:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:52:49,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:49,477 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:49,477 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:49,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1906438705, now seen corresponding path program 30 times [2018-11-23 11:52:49,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {26877#true} call ULTIMATE.init(); {26877#true} is VALID [2018-11-23 11:52:50,463 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:50,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {26877#true} assume true; {26877#true} is VALID [2018-11-23 11:52:50,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26877#true} {26877#true} #79#return; {26877#true} is VALID [2018-11-23 11:52:50,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {26877#true} call #t~ret8 := main(); {26877#true} is VALID [2018-11-23 11:52:50,464 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:50,464 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:50,465 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26879#(= main_~i~0 1)} is VALID [2018-11-23 11:52:50,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {26879#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26879#(= main_~i~0 1)} is VALID [2018-11-23 11:52:50,466 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:50,467 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {26880#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,467 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:50,468 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {26881#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,469 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:50,469 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {26882#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,471 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:50,471 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {26883#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,472 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:50,473 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {26884#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,474 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:50,475 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {26885#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,476 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:50,476 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {26886#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,477 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:50,478 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {26887#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,479 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:50,480 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {26888#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,481 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:50,482 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {26889#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,483 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:50,483 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,484 INFO L273 TraceCheckUtils]: 41: Hoare triple {26890#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,485 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:50,485 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,486 INFO L273 TraceCheckUtils]: 44: Hoare triple {26891#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,486 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:50,487 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {26892#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,488 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:50,489 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,489 INFO L273 TraceCheckUtils]: 50: Hoare triple {26893#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,490 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:50,490 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {26894#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,491 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:50,492 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,492 INFO L273 TraceCheckUtils]: 56: Hoare triple {26895#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:50,493 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:50,494 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,494 INFO L273 TraceCheckUtils]: 59: Hoare triple {26896#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:50,495 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:50,495 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,496 INFO L273 TraceCheckUtils]: 62: Hoare triple {26897#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:50,497 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:50,497 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {26898#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:50,498 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:50,499 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {26899#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:50,500 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:50,501 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,501 INFO L273 TraceCheckUtils]: 71: Hoare triple {26900#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:50,502 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:50,502 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,503 INFO L273 TraceCheckUtils]: 74: Hoare triple {26901#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:50,504 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:50,504 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,505 INFO L273 TraceCheckUtils]: 77: Hoare triple {26902#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:50,505 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:50,506 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,506 INFO L273 TraceCheckUtils]: 80: Hoare triple {26903#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:50,507 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:50,508 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,508 INFO L273 TraceCheckUtils]: 83: Hoare triple {26904#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:50,509 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:50,509 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,510 INFO L273 TraceCheckUtils]: 86: Hoare triple {26905#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:50,510 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:50,511 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,511 INFO L273 TraceCheckUtils]: 89: Hoare triple {26906#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:50,512 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:50,513 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,513 INFO L273 TraceCheckUtils]: 92: Hoare triple {26907#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:50,514 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:50,514 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,515 INFO L273 TraceCheckUtils]: 95: Hoare triple {26908#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:50,516 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:50,516 INFO L273 TraceCheckUtils]: 97: Hoare triple {26909#(<= main_~i~0 31)} assume !(~i~0 < 100000); {26878#false} is VALID [2018-11-23 11:52:50,516 INFO L273 TraceCheckUtils]: 98: Hoare triple {26878#false} assume !(0 != ~swapped~0); {26878#false} is VALID [2018-11-23 11:52:50,517 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:50,517 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:50,517 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:50,517 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:50,517 INFO L273 TraceCheckUtils]: 103: Hoare triple {26878#false} ~cond := #in~cond; {26878#false} is VALID [2018-11-23 11:52:50,518 INFO L273 TraceCheckUtils]: 104: Hoare triple {26878#false} assume 0 == ~cond; {26878#false} is VALID [2018-11-23 11:52:50,518 INFO L273 TraceCheckUtils]: 105: Hoare triple {26878#false} assume !false; {26878#false} is VALID [2018-11-23 11:52:50,526 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:50,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:50,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50,535 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:52:50,637 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-11-23 11:52:50,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:50,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:50,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {26877#true} call ULTIMATE.init(); {26877#true} is VALID [2018-11-23 11:52:50,972 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:50,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {26877#true} assume true; {26877#true} is VALID [2018-11-23 11:52:50,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26877#true} {26877#true} #79#return; {26877#true} is VALID [2018-11-23 11:52:50,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {26877#true} call #t~ret8 := main(); {26877#true} is VALID [2018-11-23 11:52:50,973 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:50,974 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:50,974 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26931#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:50,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {26931#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26931#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:50,975 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:50,975 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {26880#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26880#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:50,976 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:50,977 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {26881#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26881#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:50,978 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:50,978 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {26882#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26882#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:50,980 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:50,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {26883#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26883#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:50,981 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:50,982 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {26884#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26884#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:50,983 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:50,984 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,984 INFO L273 TraceCheckUtils]: 26: Hoare triple {26885#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26885#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:50,985 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:50,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {26886#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26886#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:50,986 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:50,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {26887#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26887#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:50,988 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:50,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {26888#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26888#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:50,990 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:50,990 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {26889#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26889#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:50,992 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:50,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {26890#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26890#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:50,993 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:50,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {26891#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26891#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:50,995 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:50,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {26892#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26892#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:50,997 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:50,997 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {26893#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26893#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:50,998 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:50,999 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:50,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {26894#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26894#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:51,000 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:51,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:51,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {26895#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26895#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:51,002 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:51,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:51,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {26896#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26896#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:51,005 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:51,005 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:51,006 INFO L273 TraceCheckUtils]: 62: Hoare triple {26897#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26897#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:51,006 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:51,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:51,007 INFO L273 TraceCheckUtils]: 65: Hoare triple {26898#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26898#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:51,008 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:51,009 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:51,009 INFO L273 TraceCheckUtils]: 68: Hoare triple {26899#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26899#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:51,010 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:51,010 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:51,011 INFO L273 TraceCheckUtils]: 71: Hoare triple {26900#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26900#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:51,012 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:51,012 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:51,013 INFO L273 TraceCheckUtils]: 74: Hoare triple {26901#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26901#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:51,013 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:51,014 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:51,014 INFO L273 TraceCheckUtils]: 77: Hoare triple {26902#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26902#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:51,015 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:51,016 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:51,016 INFO L273 TraceCheckUtils]: 80: Hoare triple {26903#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26903#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:51,017 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:51,017 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:51,018 INFO L273 TraceCheckUtils]: 83: Hoare triple {26904#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26904#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:51,018 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:51,019 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:51,019 INFO L273 TraceCheckUtils]: 86: Hoare triple {26905#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26905#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:51,020 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:51,021 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:51,021 INFO L273 TraceCheckUtils]: 89: Hoare triple {26906#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26906#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:51,022 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:51,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:51,023 INFO L273 TraceCheckUtils]: 92: Hoare triple {26907#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26907#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:51,024 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:51,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:51,025 INFO L273 TraceCheckUtils]: 95: Hoare triple {26908#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {26908#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:51,025 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:51,026 INFO L273 TraceCheckUtils]: 97: Hoare triple {26909#(<= main_~i~0 31)} assume !(~i~0 < 100000); {26878#false} is VALID [2018-11-23 11:52:51,026 INFO L273 TraceCheckUtils]: 98: Hoare triple {26878#false} assume !(0 != ~swapped~0); {26878#false} is VALID [2018-11-23 11:52:51,026 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:51,027 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:51,027 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:51,027 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:51,027 INFO L273 TraceCheckUtils]: 103: Hoare triple {26878#false} ~cond := #in~cond; {26878#false} is VALID [2018-11-23 11:52:51,027 INFO L273 TraceCheckUtils]: 104: Hoare triple {26878#false} assume 0 == ~cond; {26878#false} is VALID [2018-11-23 11:52:51,027 INFO L273 TraceCheckUtils]: 105: Hoare triple {26878#false} assume !false; {26878#false} is VALID [2018-11-23 11:52:51,036 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:51,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:51,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 11:52:51,056 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:52:51,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:51,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:52:51,169 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:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:52:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:52:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:51,171 INFO L87 Difference]: Start difference. First operand 201 states and 264 transitions. Second operand 34 states. [2018-11-23 11:52:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:52,101 INFO L93 Difference]: Finished difference Result 406 states and 538 transitions. [2018-11-23 11:52:52,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:52:52,101 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2018-11-23 11:52:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 173 transitions. [2018-11-23 11:52:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:52:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 173 transitions. [2018-11-23 11:52:52,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 173 transitions. [2018-11-23 11:52:52,334 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:52,339 INFO L225 Difference]: With dead ends: 406 [2018-11-23 11:52:52,339 INFO L226 Difference]: Without dead ends: 211 [2018-11-23 11:52:52,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:52:52,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-23 11:52:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2018-11-23 11:52:52,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:52,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:52,422 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:52,423 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 207 states. [2018-11-23 11:52:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:52,427 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2018-11-23 11:52:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2018-11-23 11:52:52,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:52,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:52,428 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 211 states. [2018-11-23 11:52:52,428 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 211 states. [2018-11-23 11:52:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:52,432 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2018-11-23 11:52:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2018-11-23 11:52:52,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:52,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:52,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:52,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 11:52:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2018-11-23 11:52:52,438 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 106 [2018-11-23 11:52:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:52,438 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2018-11-23 11:52:52,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:52:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2018-11-23 11:52:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 11:52:52,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:52,439 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:52,439 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:52,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1075565480, now seen corresponding path program 31 times [2018-11-23 11:52:52,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:52,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:53,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {28476#true} call ULTIMATE.init(); {28476#true} is VALID [2018-11-23 11:52:53,130 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:53,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {28476#true} assume true; {28476#true} is VALID [2018-11-23 11:52:53,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28476#true} {28476#true} #79#return; {28476#true} is VALID [2018-11-23 11:52:53,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {28476#true} call #t~ret8 := main(); {28476#true} is VALID [2018-11-23 11:52:53,131 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:53,132 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:53,132 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28478#(= main_~i~0 1)} is VALID [2018-11-23 11:52:53,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {28478#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28478#(= main_~i~0 1)} is VALID [2018-11-23 11:52:53,134 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:53,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:53,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {28479#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:53,135 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:53,135 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:53,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {28480#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:53,136 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:53,137 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:53,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {28481#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:53,138 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:53,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {28482#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,140 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:53,140 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {28483#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,142 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:53,142 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {28484#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,143 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:53,144 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {28485#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,145 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:53,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {28486#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,147 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:53,168 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {28487#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,203 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:53,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {28488#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,206 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:53,206 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {28489#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,207 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:53,207 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {28490#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,208 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:53,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {28491#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,209 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:53,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {28492#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,211 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:53,211 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,212 INFO L273 TraceCheckUtils]: 53: Hoare triple {28493#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,212 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:53,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,213 INFO L273 TraceCheckUtils]: 56: Hoare triple {28494#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,214 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:53,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {28495#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,216 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:53,216 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,217 INFO L273 TraceCheckUtils]: 62: Hoare triple {28496#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,218 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:53,218 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,219 INFO L273 TraceCheckUtils]: 65: Hoare triple {28497#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,219 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:53,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,221 INFO L273 TraceCheckUtils]: 68: Hoare triple {28498#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,221 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:53,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {28499#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,223 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:53,223 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,224 INFO L273 TraceCheckUtils]: 74: Hoare triple {28500#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,225 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:53,225 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,226 INFO L273 TraceCheckUtils]: 77: Hoare triple {28501#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,226 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:53,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,227 INFO L273 TraceCheckUtils]: 80: Hoare triple {28502#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,228 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:53,228 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {28503#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,230 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:53,230 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,231 INFO L273 TraceCheckUtils]: 86: Hoare triple {28504#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,231 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:53,232 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,232 INFO L273 TraceCheckUtils]: 89: Hoare triple {28505#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,233 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:53,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,234 INFO L273 TraceCheckUtils]: 92: Hoare triple {28506#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,235 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:53,235 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,236 INFO L273 TraceCheckUtils]: 95: Hoare triple {28507#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,237 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:53,237 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,238 INFO L273 TraceCheckUtils]: 98: Hoare triple {28508#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,239 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:53,239 INFO L273 TraceCheckUtils]: 100: Hoare triple {28509#(<= main_~i~0 32)} assume !(~i~0 < 100000); {28477#false} is VALID [2018-11-23 11:52:53,239 INFO L273 TraceCheckUtils]: 101: Hoare triple {28477#false} assume !(0 != ~swapped~0); {28477#false} is VALID [2018-11-23 11:52:53,240 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:53,240 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:53,240 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:53,240 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:53,240 INFO L273 TraceCheckUtils]: 106: Hoare triple {28477#false} ~cond := #in~cond; {28477#false} is VALID [2018-11-23 11:52:53,241 INFO L273 TraceCheckUtils]: 107: Hoare triple {28477#false} assume 0 == ~cond; {28477#false} is VALID [2018-11-23 11:52:53,241 INFO L273 TraceCheckUtils]: 108: Hoare triple {28477#false} assume !false; {28477#false} is VALID [2018-11-23 11:52:53,250 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:53,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:53,250 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:53,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:53,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:53,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {28476#true} call ULTIMATE.init(); {28476#true} is VALID [2018-11-23 11:52:53,655 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:53,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {28476#true} assume true; {28476#true} is VALID [2018-11-23 11:52:53,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28476#true} {28476#true} #79#return; {28476#true} is VALID [2018-11-23 11:52:53,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {28476#true} call #t~ret8 := main(); {28476#true} is VALID [2018-11-23 11:52:53,656 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:53,657 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:53,657 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28531#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:53,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {28531#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28531#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:53,658 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:53,659 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:53,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {28479#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28479#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:53,660 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:53,661 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:53,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {28480#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28480#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:53,662 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:53,663 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:53,663 INFO L273 TraceCheckUtils]: 17: Hoare triple {28481#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28481#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:53,664 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:53,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {28482#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28482#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:53,666 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:53,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {28483#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28483#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:53,667 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:53,668 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {28484#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28484#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:53,669 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:53,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {28485#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28485#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:53,671 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:53,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {28486#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28486#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:53,673 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:53,673 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {28487#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28487#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:53,674 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:53,675 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {28488#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28488#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:53,676 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:53,677 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {28489#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28489#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:53,678 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:53,678 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {28490#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28490#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:53,680 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:53,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,681 INFO L273 TraceCheckUtils]: 47: Hoare triple {28491#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28491#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:53,681 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:53,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {28492#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28492#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:53,683 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:53,684 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {28493#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28493#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:53,685 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:53,685 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,686 INFO L273 TraceCheckUtils]: 56: Hoare triple {28494#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28494#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:53,686 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:53,687 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {28495#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28495#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:53,688 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:53,689 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,689 INFO L273 TraceCheckUtils]: 62: Hoare triple {28496#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28496#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:53,690 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:53,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {28497#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28497#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:53,692 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:53,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,693 INFO L273 TraceCheckUtils]: 68: Hoare triple {28498#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28498#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:53,693 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:53,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,695 INFO L273 TraceCheckUtils]: 71: Hoare triple {28499#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28499#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:53,695 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:53,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {28500#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28500#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:53,697 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:53,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,698 INFO L273 TraceCheckUtils]: 77: Hoare triple {28501#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28501#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:53,699 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:53,699 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {28502#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28502#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:53,700 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:53,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,701 INFO L273 TraceCheckUtils]: 83: Hoare triple {28503#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28503#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:53,702 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:53,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,703 INFO L273 TraceCheckUtils]: 86: Hoare triple {28504#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28504#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:53,704 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:53,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,705 INFO L273 TraceCheckUtils]: 89: Hoare triple {28505#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28505#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:53,705 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:53,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,706 INFO L273 TraceCheckUtils]: 92: Hoare triple {28506#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28506#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:53,707 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:53,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,708 INFO L273 TraceCheckUtils]: 95: Hoare triple {28507#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28507#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:53,709 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:53,714 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,715 INFO L273 TraceCheckUtils]: 98: Hoare triple {28508#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {28508#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:53,715 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:53,716 INFO L273 TraceCheckUtils]: 100: Hoare triple {28509#(<= main_~i~0 32)} assume !(~i~0 < 100000); {28477#false} is VALID [2018-11-23 11:52:53,716 INFO L273 TraceCheckUtils]: 101: Hoare triple {28477#false} assume !(0 != ~swapped~0); {28477#false} is VALID [2018-11-23 11:52:53,716 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:53,716 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:53,716 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:53,716 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:53,716 INFO L273 TraceCheckUtils]: 106: Hoare triple {28477#false} ~cond := #in~cond; {28477#false} is VALID [2018-11-23 11:52:53,716 INFO L273 TraceCheckUtils]: 107: Hoare triple {28477#false} assume 0 == ~cond; {28477#false} is VALID [2018-11-23 11:52:53,717 INFO L273 TraceCheckUtils]: 108: Hoare triple {28477#false} assume !false; {28477#false} is VALID [2018-11-23 11:52:53,724 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:53,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:53,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 11:52:53,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:52:53,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:53,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:52:53,857 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:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:52:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:52:53,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:52:53,858 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand 35 states. [2018-11-23 11:52:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:54,882 INFO L93 Difference]: Finished difference Result 418 states and 554 transitions. [2018-11-23 11:52:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:52:54,882 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-11-23 11:52:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:52:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 177 transitions. [2018-11-23 11:52:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:52:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 177 transitions. [2018-11-23 11:52:54,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 177 transitions. [2018-11-23 11:52:55,083 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:55,087 INFO L225 Difference]: With dead ends: 418 [2018-11-23 11:52:55,087 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 11:52:55,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:52:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 11:52:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-11-23 11:52:55,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:55,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:55,189 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:55,189 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 213 states. [2018-11-23 11:52:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:55,194 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2018-11-23 11:52:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 286 transitions. [2018-11-23 11:52:55,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:55,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:55,194 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 217 states. [2018-11-23 11:52:55,194 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 217 states. [2018-11-23 11:52:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:55,197 INFO L93 Difference]: Finished difference Result 217 states and 286 transitions. [2018-11-23 11:52:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 286 transitions. [2018-11-23 11:52:55,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:55,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:55,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:55,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 11:52:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2018-11-23 11:52:55,201 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 109 [2018-11-23 11:52:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:55,202 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2018-11-23 11:52:55,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:52:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2018-11-23 11:52:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 11:52:55,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:55,203 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:55,203 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:55,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash 427846353, now seen corresponding path program 32 times [2018-11-23 11:52:55,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:55,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:52:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:56,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {30121#true} call ULTIMATE.init(); {30121#true} is VALID [2018-11-23 11:52:56,019 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:56,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {30121#true} assume true; {30121#true} is VALID [2018-11-23 11:52:56,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30121#true} {30121#true} #79#return; {30121#true} is VALID [2018-11-23 11:52:56,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {30121#true} call #t~ret8 := main(); {30121#true} is VALID [2018-11-23 11:52:56,019 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:56,020 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:56,021 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30123#(= main_~i~0 1)} is VALID [2018-11-23 11:52:56,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {30123#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30123#(= main_~i~0 1)} is VALID [2018-11-23 11:52:56,022 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:56,023 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {30124#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,024 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:56,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {30125#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,026 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:56,026 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {30126#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,027 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:56,028 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {30127#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,029 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:56,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {30128#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,031 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:56,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {30129#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,032 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:56,033 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {30130#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,034 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:56,035 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,035 INFO L273 TraceCheckUtils]: 32: Hoare triple {30131#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,036 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:56,037 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,037 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,038 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:56,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,039 INFO L273 TraceCheckUtils]: 38: Hoare triple {30133#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,039 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:56,040 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {30134#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,041 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:56,042 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {30135#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,043 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:56,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {30136#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,045 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:56,045 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {30137#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,046 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:56,047 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {30138#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,048 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:56,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {30139#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,050 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:56,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,051 INFO L273 TraceCheckUtils]: 59: Hoare triple {30140#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,052 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:56,074 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,084 INFO L273 TraceCheckUtils]: 62: Hoare triple {30141#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,089 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:56,089 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,089 INFO L273 TraceCheckUtils]: 65: Hoare triple {30142#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,090 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:56,090 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,091 INFO L273 TraceCheckUtils]: 68: Hoare triple {30143#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,091 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:56,091 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,092 INFO L273 TraceCheckUtils]: 71: Hoare triple {30144#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,093 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:56,093 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,094 INFO L273 TraceCheckUtils]: 74: Hoare triple {30145#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,095 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:56,095 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,096 INFO L273 TraceCheckUtils]: 77: Hoare triple {30146#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,096 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:56,097 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,097 INFO L273 TraceCheckUtils]: 80: Hoare triple {30147#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,098 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:56,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,099 INFO L273 TraceCheckUtils]: 83: Hoare triple {30148#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,100 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:56,100 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,101 INFO L273 TraceCheckUtils]: 86: Hoare triple {30149#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,102 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:56,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,103 INFO L273 TraceCheckUtils]: 89: Hoare triple {30150#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,103 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:56,104 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {30151#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,105 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:56,106 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,106 INFO L273 TraceCheckUtils]: 95: Hoare triple {30152#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,107 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:56,107 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,108 INFO L273 TraceCheckUtils]: 98: Hoare triple {30153#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,109 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:56,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {30154#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,110 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:56,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {30155#(<= main_~i~0 33)} assume !(~i~0 < 100000); {30122#false} is VALID [2018-11-23 11:52:56,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {30122#false} assume !(0 != ~swapped~0); {30122#false} is VALID [2018-11-23 11:52:56,111 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:56,111 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:56,112 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:56,112 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:56,112 INFO L273 TraceCheckUtils]: 109: Hoare triple {30122#false} ~cond := #in~cond; {30122#false} is VALID [2018-11-23 11:52:56,112 INFO L273 TraceCheckUtils]: 110: Hoare triple {30122#false} assume 0 == ~cond; {30122#false} is VALID [2018-11-23 11:52:56,112 INFO L273 TraceCheckUtils]: 111: Hoare triple {30122#false} assume !false; {30122#false} is VALID [2018-11-23 11:52:56,121 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:56,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:56,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 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:56,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:52:56,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:52:56,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:56,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:52:56,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {30121#true} call ULTIMATE.init(); {30121#true} is VALID [2018-11-23 11:52:56,564 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:56,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {30121#true} assume true; {30121#true} is VALID [2018-11-23 11:52:56,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30121#true} {30121#true} #79#return; {30121#true} is VALID [2018-11-23 11:52:56,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {30121#true} call #t~ret8 := main(); {30121#true} is VALID [2018-11-23 11:52:56,565 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:56,566 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:56,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30177#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:56,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {30177#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30177#(<= main_~i~0 1)} is VALID [2018-11-23 11:52:56,567 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:56,568 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {30124#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30124#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:56,568 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:56,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {30125#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30125#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:56,569 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:56,570 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {30126#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30126#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:56,571 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:56,572 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {30127#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30127#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:56,573 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:56,573 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {30128#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30128#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:56,575 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:56,575 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,576 INFO L273 TraceCheckUtils]: 26: Hoare triple {30129#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30129#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:56,576 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:56,577 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {30130#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30130#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:56,578 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:56,579 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {30131#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30131#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:56,580 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:56,580 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30132#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:56,582 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:56,582 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {30133#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30133#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:56,583 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:56,584 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {30134#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30134#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:56,585 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:56,585 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {30135#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30135#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:56,587 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:56,587 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {30136#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30136#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:56,588 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:56,589 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,589 INFO L273 TraceCheckUtils]: 50: Hoare triple {30137#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30137#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:56,590 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:56,591 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {30138#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30138#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:56,592 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:56,592 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {30139#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30139#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:56,594 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:56,594 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {30140#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30140#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:56,595 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:56,596 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,596 INFO L273 TraceCheckUtils]: 62: Hoare triple {30141#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30141#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:56,597 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:56,598 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,598 INFO L273 TraceCheckUtils]: 65: Hoare triple {30142#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30142#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:56,599 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:56,599 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,600 INFO L273 TraceCheckUtils]: 68: Hoare triple {30143#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30143#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:56,601 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:56,601 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,602 INFO L273 TraceCheckUtils]: 71: Hoare triple {30144#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30144#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:56,603 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:56,603 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,604 INFO L273 TraceCheckUtils]: 74: Hoare triple {30145#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30145#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:56,604 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:56,605 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,606 INFO L273 TraceCheckUtils]: 77: Hoare triple {30146#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30146#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:56,606 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:56,607 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,607 INFO L273 TraceCheckUtils]: 80: Hoare triple {30147#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30147#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:56,608 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:56,609 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,609 INFO L273 TraceCheckUtils]: 83: Hoare triple {30148#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30148#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:56,610 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:56,610 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,611 INFO L273 TraceCheckUtils]: 86: Hoare triple {30149#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30149#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:56,612 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:56,612 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,613 INFO L273 TraceCheckUtils]: 89: Hoare triple {30150#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30150#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:56,614 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:56,614 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,615 INFO L273 TraceCheckUtils]: 92: Hoare triple {30151#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30151#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:56,615 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:56,616 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,616 INFO L273 TraceCheckUtils]: 95: Hoare triple {30152#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30152#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:56,617 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:56,618 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,618 INFO L273 TraceCheckUtils]: 98: Hoare triple {30153#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30153#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:56,619 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:56,619 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,620 INFO L273 TraceCheckUtils]: 101: Hoare triple {30154#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {30154#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:56,620 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:56,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {30155#(<= main_~i~0 33)} assume !(~i~0 < 100000); {30122#false} is VALID [2018-11-23 11:52:56,621 INFO L273 TraceCheckUtils]: 104: Hoare triple {30122#false} assume !(0 != ~swapped~0); {30122#false} is VALID [2018-11-23 11:52:56,621 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:56,622 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:56,622 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:56,622 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:56,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {30122#false} ~cond := #in~cond; {30122#false} is VALID [2018-11-23 11:52:56,622 INFO L273 TraceCheckUtils]: 110: Hoare triple {30122#false} assume 0 == ~cond; {30122#false} is VALID [2018-11-23 11:52:56,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {30122#false} assume !false; {30122#false} is VALID [2018-11-23 11:52:56,631 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:56,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:52:56,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 11:52:56,650 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:52:56,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:52:56,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:52:56,771 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:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:52:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:52:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:56,772 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand 36 states. [2018-11-23 11:52:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,434 INFO L93 Difference]: Finished difference Result 430 states and 570 transitions. [2018-11-23 11:52:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:52:57,434 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2018-11-23 11:52:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:52:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 181 transitions. [2018-11-23 11:52:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:52:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 181 transitions. [2018-11-23 11:52:57,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 181 transitions. [2018-11-23 11:52:57,626 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:57,631 INFO L225 Difference]: With dead ends: 430 [2018-11-23 11:52:57,631 INFO L226 Difference]: Without dead ends: 223 [2018-11-23 11:52:57,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:52:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-23 11:52:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2018-11-23 11:52:57,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:52:57,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:57,768 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:57,768 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 219 states. [2018-11-23 11:52:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,773 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2018-11-23 11:52:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2018-11-23 11:52:57,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,774 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 223 states. [2018-11-23 11:52:57,774 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 223 states. [2018-11-23 11:52:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:52:57,779 INFO L93 Difference]: Finished difference Result 223 states and 294 transitions. [2018-11-23 11:52:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2018-11-23 11:52:57,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:52:57,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:52:57,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:52:57,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:52:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-23 11:52:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2018-11-23 11:52:57,786 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 112 [2018-11-23 11:52:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:52:57,787 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2018-11-23 11:52:57,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:52:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2018-11-23 11:52:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 11:52:57,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:52:57,788 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:57,788 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:52:57,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:52:57,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1515394824, now seen corresponding path program 33 times [2018-11-23 11:52:57,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:52:57,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:52:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:57,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:52:57,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:52:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:59,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {31812#true} call ULTIMATE.init(); {31812#true} is VALID [2018-11-23 11:52:59,099 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:59,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {31812#true} assume true; {31812#true} is VALID [2018-11-23 11:52:59,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31812#true} {31812#true} #79#return; {31812#true} is VALID [2018-11-23 11:52:59,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {31812#true} call #t~ret8 := main(); {31812#true} is VALID [2018-11-23 11:52:59,100 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:59,100 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:59,100 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31814#(= main_~i~0 1)} is VALID [2018-11-23 11:52:59,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {31814#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31814#(= main_~i~0 1)} is VALID [2018-11-23 11:52:59,101 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:59,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:59,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {31815#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:52:59,103 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:59,104 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:59,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {31816#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:52:59,105 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:59,106 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:59,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {31817#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:52:59,107 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:59,108 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:59,108 INFO L273 TraceCheckUtils]: 20: Hoare triple {31818#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:52:59,109 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:59,110 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:59,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {31819#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:52:59,111 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:59,111 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:59,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {31820#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:52:59,113 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:59,113 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:59,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {31821#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:52:59,114 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:59,115 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:59,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {31822#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:52:59,116 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:59,117 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:59,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {31823#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:52:59,118 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:59,119 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:59,119 INFO L273 TraceCheckUtils]: 38: Hoare triple {31824#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:52:59,120 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:59,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:59,121 INFO L273 TraceCheckUtils]: 41: Hoare triple {31825#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:52:59,122 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:59,122 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:59,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {31826#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:52:59,124 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:59,124 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:59,125 INFO L273 TraceCheckUtils]: 47: Hoare triple {31827#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:52:59,126 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:59,126 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:59,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {31828#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:52:59,128 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:59,128 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:59,129 INFO L273 TraceCheckUtils]: 53: Hoare triple {31829#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:52:59,130 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:59,130 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:59,131 INFO L273 TraceCheckUtils]: 56: Hoare triple {31830#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:52:59,131 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:59,132 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:59,132 INFO L273 TraceCheckUtils]: 59: Hoare triple {31831#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:52:59,133 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:59,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:59,134 INFO L273 TraceCheckUtils]: 62: Hoare triple {31832#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:52:59,135 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:59,135 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:59,136 INFO L273 TraceCheckUtils]: 65: Hoare triple {31833#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:52:59,136 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:59,137 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:59,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {31834#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:52:59,138 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:59,139 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:59,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {31835#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:52:59,140 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:59,140 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:59,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {31836#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:52:59,142 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:59,142 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:59,143 INFO L273 TraceCheckUtils]: 77: Hoare triple {31837#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:52:59,143 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:59,144 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:59,144 INFO L273 TraceCheckUtils]: 80: Hoare triple {31838#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:52:59,145 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:59,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:59,146 INFO L273 TraceCheckUtils]: 83: Hoare triple {31839#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:52:59,147 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:59,147 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:59,148 INFO L273 TraceCheckUtils]: 86: Hoare triple {31840#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:52:59,148 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:59,149 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:59,149 INFO L273 TraceCheckUtils]: 89: Hoare triple {31841#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:52:59,150 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:59,151 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:59,151 INFO L273 TraceCheckUtils]: 92: Hoare triple {31842#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:52:59,152 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:59,152 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:59,153 INFO L273 TraceCheckUtils]: 95: Hoare triple {31843#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:52:59,153 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:59,154 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:59,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {31844#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:52:59,155 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:59,156 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:59,156 INFO L273 TraceCheckUtils]: 101: Hoare triple {31845#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:52:59,157 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:59,157 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:59,158 INFO L273 TraceCheckUtils]: 104: Hoare triple {31846#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:52:59,159 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:59,159 INFO L273 TraceCheckUtils]: 106: Hoare triple {31847#(<= main_~i~0 34)} assume !(~i~0 < 100000); {31813#false} is VALID [2018-11-23 11:52:59,159 INFO L273 TraceCheckUtils]: 107: Hoare triple {31813#false} assume !(0 != ~swapped~0); {31813#false} is VALID [2018-11-23 11:52:59,160 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:59,160 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:59,160 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:59,160 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:59,160 INFO L273 TraceCheckUtils]: 112: Hoare triple {31813#false} ~cond := #in~cond; {31813#false} is VALID [2018-11-23 11:52:59,161 INFO L273 TraceCheckUtils]: 113: Hoare triple {31813#false} assume 0 == ~cond; {31813#false} is VALID [2018-11-23 11:52:59,161 INFO L273 TraceCheckUtils]: 114: Hoare triple {31813#false} assume !false; {31813#false} is VALID [2018-11-23 11:52:59,170 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:59,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:52:59,170 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:59,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:52:59,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-11-23 11:52:59,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:52:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:52:59,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:00,762 INFO L256 TraceCheckUtils]: 0: Hoare triple {31812#true} call ULTIMATE.init(); {31812#true} is VALID [2018-11-23 11:53:00,763 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:53:00,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {31812#true} assume true; {31812#true} is VALID [2018-11-23 11:53:00,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31812#true} {31812#true} #79#return; {31812#true} is VALID [2018-11-23 11:53:00,763 INFO L256 TraceCheckUtils]: 4: Hoare triple {31812#true} call #t~ret8 := main(); {31812#true} is VALID [2018-11-23 11:53:00,763 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:53:00,764 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:53:00,765 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31869#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {31869#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31869#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:00,765 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:53:00,766 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {31815#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31815#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:00,767 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:53:00,767 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {31816#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31816#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:00,768 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:53:00,769 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {31817#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31817#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:00,770 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:53:00,771 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {31818#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31818#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:00,772 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:53:00,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {31819#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31819#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:00,774 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:53:00,774 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {31820#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31820#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:00,775 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:53:00,776 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {31821#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31821#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:00,777 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:53:00,778 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {31822#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31822#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:00,779 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:53:00,779 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {31823#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31823#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:00,781 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:53:00,781 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {31824#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31824#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:00,782 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:53:00,783 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {31825#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31825#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:00,784 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:53:00,785 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,785 INFO L273 TraceCheckUtils]: 44: Hoare triple {31826#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31826#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:00,786 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:53:00,786 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {31827#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31827#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:00,787 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:53:00,788 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {31828#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31828#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:00,789 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:53:00,790 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {31829#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31829#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:00,791 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:53:00,792 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,792 INFO L273 TraceCheckUtils]: 56: Hoare triple {31830#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31830#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:00,793 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:53:00,793 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,794 INFO L273 TraceCheckUtils]: 59: Hoare triple {31831#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31831#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:00,794 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:53:00,795 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,796 INFO L273 TraceCheckUtils]: 62: Hoare triple {31832#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31832#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:00,796 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:53:00,797 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,797 INFO L273 TraceCheckUtils]: 65: Hoare triple {31833#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31833#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:00,798 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:53:00,799 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,799 INFO L273 TraceCheckUtils]: 68: Hoare triple {31834#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31834#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:00,800 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:53:00,800 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {31835#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31835#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:00,802 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:53:00,802 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,803 INFO L273 TraceCheckUtils]: 74: Hoare triple {31836#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31836#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:00,803 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:53:00,804 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,804 INFO L273 TraceCheckUtils]: 77: Hoare triple {31837#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31837#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:00,805 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:53:00,805 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,806 INFO L273 TraceCheckUtils]: 80: Hoare triple {31838#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31838#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:00,807 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:53:00,807 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {31839#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31839#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:00,808 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:53:00,809 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,809 INFO L273 TraceCheckUtils]: 86: Hoare triple {31840#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31840#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:00,810 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:53:00,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {31841#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31841#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:00,812 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:53:00,812 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,813 INFO L273 TraceCheckUtils]: 92: Hoare triple {31842#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31842#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:00,814 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:53:00,814 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,815 INFO L273 TraceCheckUtils]: 95: Hoare triple {31843#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31843#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:00,816 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:53:00,816 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,817 INFO L273 TraceCheckUtils]: 98: Hoare triple {31844#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31844#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:00,817 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:53:00,818 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,818 INFO L273 TraceCheckUtils]: 101: Hoare triple {31845#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31845#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:00,819 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:53:00,820 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,820 INFO L273 TraceCheckUtils]: 104: Hoare triple {31846#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {31846#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:00,821 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:53:00,821 INFO L273 TraceCheckUtils]: 106: Hoare triple {31847#(<= main_~i~0 34)} assume !(~i~0 < 100000); {31813#false} is VALID [2018-11-23 11:53:00,822 INFO L273 TraceCheckUtils]: 107: Hoare triple {31813#false} assume !(0 != ~swapped~0); {31813#false} is VALID [2018-11-23 11:53:00,822 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:53:00,822 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:53:00,822 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:53:00,822 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:53:00,822 INFO L273 TraceCheckUtils]: 112: Hoare triple {31813#false} ~cond := #in~cond; {31813#false} is VALID [2018-11-23 11:53:00,823 INFO L273 TraceCheckUtils]: 113: Hoare triple {31813#false} assume 0 == ~cond; {31813#false} is VALID [2018-11-23 11:53:00,823 INFO L273 TraceCheckUtils]: 114: Hoare triple {31813#false} assume !false; {31813#false} is VALID [2018-11-23 11:53:00,832 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:53:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 11:53:00,851 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:53:00,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:00,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:53:00,974 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:53:00,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:53:00,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:53:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:53:00,976 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand 37 states. [2018-11-23 11:53:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,053 INFO L93 Difference]: Finished difference Result 442 states and 586 transitions. [2018-11-23 11:53:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:53:02,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-11-23 11:53:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:53:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 185 transitions. [2018-11-23 11:53:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:53:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 185 transitions. [2018-11-23 11:53:02,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 185 transitions. [2018-11-23 11:53:02,263 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:53:02,268 INFO L225 Difference]: With dead ends: 442 [2018-11-23 11:53:02,268 INFO L226 Difference]: Without dead ends: 229 [2018-11-23 11:53:02,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:53:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-23 11:53:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-11-23 11:53:02,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:02,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 225 states. [2018-11-23 11:53:02,375 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 225 states. [2018-11-23 11:53:02,375 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 225 states. [2018-11-23 11:53:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,379 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2018-11-23 11:53:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 302 transitions. [2018-11-23 11:53:02,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,380 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 229 states. [2018-11-23 11:53:02,380 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 229 states. [2018-11-23 11:53:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:02,384 INFO L93 Difference]: Finished difference Result 229 states and 302 transitions. [2018-11-23 11:53:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 302 transitions. [2018-11-23 11:53:02,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:02,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:02,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:02,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-23 11:53:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 296 transitions. [2018-11-23 11:53:02,389 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 296 transitions. Word has length 115 [2018-11-23 11:53:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:02,390 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 296 transitions. [2018-11-23 11:53:02,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:53:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 296 transitions. [2018-11-23 11:53:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 11:53:02,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:02,391 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:53:02,391 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:02,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -561386639, now seen corresponding path program 34 times [2018-11-23 11:53:02,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {33549#true} call ULTIMATE.init(); {33549#true} is VALID [2018-11-23 11:53:03,619 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:03,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {33549#true} assume true; {33549#true} is VALID [2018-11-23 11:53:03,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33549#true} {33549#true} #79#return; {33549#true} is VALID [2018-11-23 11:53:03,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {33549#true} call #t~ret8 := main(); {33549#true} is VALID [2018-11-23 11:53:03,619 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:03,620 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:03,621 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33551#(= main_~i~0 1)} is VALID [2018-11-23 11:53:03,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {33551#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33551#(= main_~i~0 1)} is VALID [2018-11-23 11:53:03,621 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:03,622 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:03,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {33552#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:03,622 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:03,623 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:03,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {33553#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:03,624 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:03,625 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:03,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {33554#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:03,626 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:03,627 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:03,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {33555#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:03,628 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:03,628 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:03,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {33556#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:03,630 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:03,630 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:03,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {33557#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:03,632 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:03,632 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:03,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {33558#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:03,633 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:03,634 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:03,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {33559#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:03,635 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:03,636 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:03,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {33560#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:03,637 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:03,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:03,638 INFO L273 TraceCheckUtils]: 38: Hoare triple {33561#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:03,639 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:03,639 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:03,640 INFO L273 TraceCheckUtils]: 41: Hoare triple {33562#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:03,641 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:03,641 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:03,642 INFO L273 TraceCheckUtils]: 44: Hoare triple {33563#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:03,643 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:03,643 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:03,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {33564#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:03,644 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:03,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:03,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {33565#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:03,646 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:03,647 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:03,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {33566#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:03,648 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:03,649 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:03,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {33567#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:03,650 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:03,650 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:03,651 INFO L273 TraceCheckUtils]: 59: Hoare triple {33568#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:03,652 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:03,652 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:03,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {33569#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:03,653 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:03,654 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:03,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {33570#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:03,655 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:03,655 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:03,656 INFO L273 TraceCheckUtils]: 68: Hoare triple {33571#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:03,657 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:03,657 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:03,658 INFO L273 TraceCheckUtils]: 71: Hoare triple {33572#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:03,658 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:03,659 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:03,659 INFO L273 TraceCheckUtils]: 74: Hoare triple {33573#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:03,660 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:03,660 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:03,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {33574#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:03,662 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:03,662 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:03,663 INFO L273 TraceCheckUtils]: 80: Hoare triple {33575#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:03,663 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:03,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:03,664 INFO L273 TraceCheckUtils]: 83: Hoare triple {33576#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:03,665 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:03,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:03,666 INFO L273 TraceCheckUtils]: 86: Hoare triple {33577#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:03,667 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:03,667 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:03,668 INFO L273 TraceCheckUtils]: 89: Hoare triple {33578#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:03,668 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:03,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:03,669 INFO L273 TraceCheckUtils]: 92: Hoare triple {33579#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:03,670 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:03,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:03,671 INFO L273 TraceCheckUtils]: 95: Hoare triple {33580#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:03,672 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:03,672 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:03,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {33581#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:03,674 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:03,674 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:03,675 INFO L273 TraceCheckUtils]: 101: Hoare triple {33582#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:03,675 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:03,676 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:03,677 INFO L273 TraceCheckUtils]: 104: Hoare triple {33583#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:03,677 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:03,678 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:03,678 INFO L273 TraceCheckUtils]: 107: Hoare triple {33584#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:03,679 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:03,680 INFO L273 TraceCheckUtils]: 109: Hoare triple {33585#(<= main_~i~0 35)} assume !(~i~0 < 100000); {33550#false} is VALID [2018-11-23 11:53:03,680 INFO L273 TraceCheckUtils]: 110: Hoare triple {33550#false} assume !(0 != ~swapped~0); {33550#false} is VALID [2018-11-23 11:53:03,680 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:03,680 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:03,681 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:03,681 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:03,681 INFO L273 TraceCheckUtils]: 115: Hoare triple {33550#false} ~cond := #in~cond; {33550#false} is VALID [2018-11-23 11:53:03,681 INFO L273 TraceCheckUtils]: 116: Hoare triple {33550#false} assume 0 == ~cond; {33550#false} is VALID [2018-11-23 11:53:03,681 INFO L273 TraceCheckUtils]: 117: Hoare triple {33550#false} assume !false; {33550#false} is VALID [2018-11-23 11:53:03,691 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:03,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:03,691 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:03,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:03,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:03,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:03,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:04,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {33549#true} call ULTIMATE.init(); {33549#true} is VALID [2018-11-23 11:53:04,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:04,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {33549#true} assume true; {33549#true} is VALID [2018-11-23 11:53:04,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33549#true} {33549#true} #79#return; {33549#true} is VALID [2018-11-23 11:53:04,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {33549#true} call #t~ret8 := main(); {33549#true} is VALID [2018-11-23 11:53:04,148 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:04,149 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:04,149 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33607#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:04,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {33607#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33607#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:04,151 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:04,151 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:04,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {33552#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33552#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:04,152 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:04,153 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:04,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {33553#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33553#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:04,154 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:04,155 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:04,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {33554#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33554#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:04,156 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:04,156 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:04,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {33555#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33555#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:04,158 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:04,158 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:04,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {33556#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33556#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:04,159 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:04,160 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:04,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {33557#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33557#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:04,161 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:04,162 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:04,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {33558#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33558#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:04,163 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:04,163 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:04,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {33559#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33559#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:04,165 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:04,165 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:04,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {33560#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33560#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:04,166 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:04,167 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:04,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {33561#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33561#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:04,168 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:04,169 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:04,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {33562#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33562#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:04,170 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:04,170 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:04,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {33563#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33563#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:04,172 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:04,172 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:04,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {33564#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33564#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:04,173 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:04,174 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:04,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {33565#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33565#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:04,175 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:04,175 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:04,176 INFO L273 TraceCheckUtils]: 53: Hoare triple {33566#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33566#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:04,177 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:04,177 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:04,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {33567#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33567#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:04,179 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:04,179 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:04,180 INFO L273 TraceCheckUtils]: 59: Hoare triple {33568#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33568#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:04,180 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:04,181 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:04,182 INFO L273 TraceCheckUtils]: 62: Hoare triple {33569#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33569#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:04,182 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:04,183 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:04,183 INFO L273 TraceCheckUtils]: 65: Hoare triple {33570#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33570#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:04,184 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:04,185 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:04,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {33571#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33571#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:04,186 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:04,186 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:04,187 INFO L273 TraceCheckUtils]: 71: Hoare triple {33572#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33572#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:04,188 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:04,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:04,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {33573#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33573#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:04,190 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:04,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:04,191 INFO L273 TraceCheckUtils]: 77: Hoare triple {33574#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33574#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:04,191 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:04,192 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:04,192 INFO L273 TraceCheckUtils]: 80: Hoare triple {33575#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33575#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:04,193 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:04,194 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:04,194 INFO L273 TraceCheckUtils]: 83: Hoare triple {33576#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33576#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:04,195 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:04,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:04,196 INFO L273 TraceCheckUtils]: 86: Hoare triple {33577#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33577#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:04,197 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:04,197 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:04,198 INFO L273 TraceCheckUtils]: 89: Hoare triple {33578#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33578#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:04,198 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:04,199 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:04,200 INFO L273 TraceCheckUtils]: 92: Hoare triple {33579#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33579#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:04,200 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:04,201 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:04,201 INFO L273 TraceCheckUtils]: 95: Hoare triple {33580#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33580#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:04,202 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:04,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:04,203 INFO L273 TraceCheckUtils]: 98: Hoare triple {33581#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33581#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:04,204 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:04,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:04,205 INFO L273 TraceCheckUtils]: 101: Hoare triple {33582#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33582#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:04,205 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:04,206 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:04,207 INFO L273 TraceCheckUtils]: 104: Hoare triple {33583#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33583#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:04,207 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:04,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:04,208 INFO L273 TraceCheckUtils]: 107: Hoare triple {33584#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {33584#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:04,209 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:04,210 INFO L273 TraceCheckUtils]: 109: Hoare triple {33585#(<= main_~i~0 35)} assume !(~i~0 < 100000); {33550#false} is VALID [2018-11-23 11:53:04,210 INFO L273 TraceCheckUtils]: 110: Hoare triple {33550#false} assume !(0 != ~swapped~0); {33550#false} is VALID [2018-11-23 11:53:04,210 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:04,210 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:04,210 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:04,211 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:04,211 INFO L273 TraceCheckUtils]: 115: Hoare triple {33550#false} ~cond := #in~cond; {33550#false} is VALID [2018-11-23 11:53:04,211 INFO L273 TraceCheckUtils]: 116: Hoare triple {33550#false} assume 0 == ~cond; {33550#false} is VALID [2018-11-23 11:53:04,211 INFO L273 TraceCheckUtils]: 117: Hoare triple {33550#false} assume !false; {33550#false} is VALID [2018-11-23 11:53:04,222 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:04,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:04,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 11:53:04,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:53:04,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:04,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:53:04,375 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:04,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:53:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:53:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:53:04,376 INFO L87 Difference]: Start difference. First operand 225 states and 296 transitions. Second operand 38 states. [2018-11-23 11:53:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,604 INFO L93 Difference]: Finished difference Result 454 states and 602 transitions. [2018-11-23 11:53:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:53:05,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 118 [2018-11-23 11:53:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 189 transitions. [2018-11-23 11:53:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:53:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 189 transitions. [2018-11-23 11:53:05,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 189 transitions. [2018-11-23 11:53:05,811 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:05,815 INFO L225 Difference]: With dead ends: 454 [2018-11-23 11:53:05,815 INFO L226 Difference]: Without dead ends: 235 [2018-11-23 11:53:05,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:53:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-23 11:53:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-11-23 11:53:05,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:05,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:05,920 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:05,920 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 231 states. [2018-11-23 11:53:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,926 INFO L93 Difference]: Finished difference Result 235 states and 310 transitions. [2018-11-23 11:53:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2018-11-23 11:53:05,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:05,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:05,926 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand 235 states. [2018-11-23 11:53:05,926 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 235 states. [2018-11-23 11:53:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:05,930 INFO L93 Difference]: Finished difference Result 235 states and 310 transitions. [2018-11-23 11:53:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2018-11-23 11:53:05,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:05,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:05,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:05,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-23 11:53:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2018-11-23 11:53:05,934 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 118 [2018-11-23 11:53:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:05,934 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2018-11-23 11:53:05,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:53:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2018-11-23 11:53:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 11:53:05,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:05,935 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:05,935 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:05,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash -954051992, now seen corresponding path program 35 times [2018-11-23 11:53:05,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2018-11-23 11:53:08,287 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:08,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2018-11-23 11:53:08,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #79#return; {35332#true} is VALID [2018-11-23 11:53:08,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2018-11-23 11:53:08,288 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:08,289 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:08,289 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35334#(= main_~i~0 1)} is VALID [2018-11-23 11:53:08,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {35334#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35334#(= main_~i~0 1)} is VALID [2018-11-23 11:53:08,291 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:08,291 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:08,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {35335#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:08,293 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:08,293 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:08,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {35336#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:08,294 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:08,295 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:08,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {35337#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:08,296 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:08,297 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:08,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {35338#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:08,298 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:08,299 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:08,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {35339#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:08,300 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:08,300 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:08,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {35340#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:08,302 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:08,302 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:08,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {35341#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:08,303 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:08,304 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:08,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {35342#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:08,305 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:08,306 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:08,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {35343#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:08,307 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:08,308 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:08,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {35344#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:08,309 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:08,309 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:08,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {35345#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:08,311 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:08,311 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:08,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {35346#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:08,313 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:08,313 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:08,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {35347#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:08,314 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:08,315 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:08,315 INFO L273 TraceCheckUtils]: 50: Hoare triple {35348#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:08,316 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:08,317 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:08,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {35349#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:08,318 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:08,318 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:08,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {35350#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:08,319 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:08,320 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:08,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {35351#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:08,321 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:08,322 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:08,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {35352#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:08,323 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:08,324 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:08,324 INFO L273 TraceCheckUtils]: 65: Hoare triple {35353#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:08,325 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:08,326 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:08,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {35354#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:08,327 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:08,327 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:08,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {35355#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:08,328 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:08,329 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:08,330 INFO L273 TraceCheckUtils]: 74: Hoare triple {35356#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:08,330 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:08,331 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:08,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {35357#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:08,332 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:08,332 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:08,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {35358#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:08,334 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:08,334 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:08,335 INFO L273 TraceCheckUtils]: 83: Hoare triple {35359#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:08,335 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:08,336 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:08,336 INFO L273 TraceCheckUtils]: 86: Hoare triple {35360#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:08,337 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:08,338 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:08,338 INFO L273 TraceCheckUtils]: 89: Hoare triple {35361#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:08,339 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:08,339 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:08,340 INFO L273 TraceCheckUtils]: 92: Hoare triple {35362#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:08,341 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:08,341 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:08,342 INFO L273 TraceCheckUtils]: 95: Hoare triple {35363#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:08,342 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:08,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:08,343 INFO L273 TraceCheckUtils]: 98: Hoare triple {35364#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:08,344 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:08,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:08,345 INFO L273 TraceCheckUtils]: 101: Hoare triple {35365#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:08,346 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:08,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:08,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {35366#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:08,348 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:08,348 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:08,349 INFO L273 TraceCheckUtils]: 107: Hoare triple {35367#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:08,350 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:08,350 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:08,351 INFO L273 TraceCheckUtils]: 110: Hoare triple {35368#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:08,351 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:08,352 INFO L273 TraceCheckUtils]: 112: Hoare triple {35369#(<= main_~i~0 36)} assume !(~i~0 < 100000); {35333#false} is VALID [2018-11-23 11:53:08,352 INFO L273 TraceCheckUtils]: 113: Hoare triple {35333#false} assume !(0 != ~swapped~0); {35333#false} is VALID [2018-11-23 11:53:08,352 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:08,353 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:08,353 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:08,353 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:08,353 INFO L273 TraceCheckUtils]: 118: Hoare triple {35333#false} ~cond := #in~cond; {35333#false} is VALID [2018-11-23 11:53:08,353 INFO L273 TraceCheckUtils]: 119: Hoare triple {35333#false} assume 0 == ~cond; {35333#false} is VALID [2018-11-23 11:53:08,353 INFO L273 TraceCheckUtils]: 120: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2018-11-23 11:53:08,364 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:08,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:08,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:08,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 11:53:08,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:08,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:08,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2018-11-23 11:53:08,856 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:08,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2018-11-23 11:53:08,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #79#return; {35332#true} is VALID [2018-11-23 11:53:08,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2018-11-23 11:53:08,856 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:08,857 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:08,857 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35391#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:08,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {35391#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35391#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:08,858 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:08,858 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:08,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {35335#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35335#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:08,860 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:08,860 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:08,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {35336#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35336#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:08,861 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:08,862 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:08,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {35337#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35337#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:08,863 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:08,864 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:08,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {35338#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35338#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:08,865 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:08,866 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:08,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {35339#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35339#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:08,867 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:08,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:08,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {35340#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35340#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:08,868 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:08,869 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:08,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {35341#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35341#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:08,870 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:08,871 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:08,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {35342#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35342#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:08,872 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:08,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:08,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {35343#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35343#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:08,874 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:08,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:08,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {35344#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35344#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:08,875 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:08,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:08,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {35345#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35345#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:08,877 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:08,878 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:08,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {35346#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35346#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:08,879 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:08,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:08,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {35347#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35347#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:08,881 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:08,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:08,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {35348#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35348#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:08,904 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:08,904 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:08,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {35349#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35349#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:08,905 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:08,905 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:08,905 INFO L273 TraceCheckUtils]: 56: Hoare triple {35350#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35350#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:08,906 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:08,906 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:08,906 INFO L273 TraceCheckUtils]: 59: Hoare triple {35351#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35351#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:08,907 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:08,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:08,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {35352#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35352#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:08,908 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:08,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:08,909 INFO L273 TraceCheckUtils]: 65: Hoare triple {35353#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35353#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:08,910 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:08,910 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:08,911 INFO L273 TraceCheckUtils]: 68: Hoare triple {35354#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35354#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:08,911 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:08,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:08,913 INFO L273 TraceCheckUtils]: 71: Hoare triple {35355#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35355#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:08,913 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:08,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:08,914 INFO L273 TraceCheckUtils]: 74: Hoare triple {35356#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35356#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:08,915 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:08,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:08,916 INFO L273 TraceCheckUtils]: 77: Hoare triple {35357#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35357#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:08,917 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:08,917 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:08,918 INFO L273 TraceCheckUtils]: 80: Hoare triple {35358#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35358#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:08,919 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:08,919 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:08,920 INFO L273 TraceCheckUtils]: 83: Hoare triple {35359#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35359#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:08,920 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:08,921 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:08,921 INFO L273 TraceCheckUtils]: 86: Hoare triple {35360#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35360#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:08,922 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:08,923 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:08,923 INFO L273 TraceCheckUtils]: 89: Hoare triple {35361#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35361#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:08,924 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:08,924 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:08,925 INFO L273 TraceCheckUtils]: 92: Hoare triple {35362#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35362#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:08,925 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:08,926 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:08,927 INFO L273 TraceCheckUtils]: 95: Hoare triple {35363#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35363#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:08,927 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:08,928 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:08,928 INFO L273 TraceCheckUtils]: 98: Hoare triple {35364#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35364#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:08,929 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:08,930 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:08,930 INFO L273 TraceCheckUtils]: 101: Hoare triple {35365#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35365#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:08,931 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:08,931 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:08,932 INFO L273 TraceCheckUtils]: 104: Hoare triple {35366#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35366#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:08,932 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:08,933 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:08,933 INFO L273 TraceCheckUtils]: 107: Hoare triple {35367#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35367#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:08,934 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:08,935 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:08,935 INFO L273 TraceCheckUtils]: 110: Hoare triple {35368#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {35368#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:08,936 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:08,937 INFO L273 TraceCheckUtils]: 112: Hoare triple {35369#(<= main_~i~0 36)} assume !(~i~0 < 100000); {35333#false} is VALID [2018-11-23 11:53:08,937 INFO L273 TraceCheckUtils]: 113: Hoare triple {35333#false} assume !(0 != ~swapped~0); {35333#false} is VALID [2018-11-23 11:53:08,937 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:08,937 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:08,937 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:08,938 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:08,938 INFO L273 TraceCheckUtils]: 118: Hoare triple {35333#false} ~cond := #in~cond; {35333#false} is VALID [2018-11-23 11:53:08,938 INFO L273 TraceCheckUtils]: 119: Hoare triple {35333#false} assume 0 == ~cond; {35333#false} is VALID [2018-11-23 11:53:08,938 INFO L273 TraceCheckUtils]: 120: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2018-11-23 11:53:08,949 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:08,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:08,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 11:53:08,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:53:08,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:08,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:53:09,098 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:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:53:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:53:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:53:09,099 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand 39 states. [2018-11-23 11:53:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,260 INFO L93 Difference]: Finished difference Result 466 states and 618 transitions. [2018-11-23 11:53:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:53:10,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-11-23 11:53:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 193 transitions. [2018-11-23 11:53:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:53:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 193 transitions. [2018-11-23 11:53:10,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 193 transitions. [2018-11-23 11:53:10,472 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:10,476 INFO L225 Difference]: With dead ends: 466 [2018-11-23 11:53:10,476 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 11:53:10,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:53:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 11:53:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2018-11-23 11:53:10,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:10,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:10,620 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:10,620 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 237 states. [2018-11-23 11:53:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,625 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-11-23 11:53:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2018-11-23 11:53:10,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:10,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:10,626 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 241 states. [2018-11-23 11:53:10,626 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 241 states. [2018-11-23 11:53:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:10,629 INFO L93 Difference]: Finished difference Result 241 states and 318 transitions. [2018-11-23 11:53:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 318 transitions. [2018-11-23 11:53:10,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:10,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:10,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:10,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-23 11:53:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 312 transitions. [2018-11-23 11:53:10,634 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 312 transitions. Word has length 121 [2018-11-23 11:53:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:10,634 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 312 transitions. [2018-11-23 11:53:10,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:53:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 312 transitions. [2018-11-23 11:53:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 11:53:10,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:10,635 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:10,635 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:10,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash 643331089, now seen corresponding path program 36 times [2018-11-23 11:53:10,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:10,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:10,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:10,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:10,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {37161#true} call ULTIMATE.init(); {37161#true} is VALID [2018-11-23 11:53:11,462 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:11,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {37161#true} assume true; {37161#true} is VALID [2018-11-23 11:53:11,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37161#true} {37161#true} #79#return; {37161#true} is VALID [2018-11-23 11:53:11,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {37161#true} call #t~ret8 := main(); {37161#true} is VALID [2018-11-23 11:53:11,462 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:11,463 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:11,464 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37163#(= main_~i~0 1)} is VALID [2018-11-23 11:53:11,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {37163#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37163#(= main_~i~0 1)} is VALID [2018-11-23 11:53:11,464 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:11,465 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:11,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {37164#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:11,466 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:11,466 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:11,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {37165#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:11,467 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:11,467 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:11,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {37166#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:11,468 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:11,469 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:11,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {37167#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:11,470 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:11,470 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:11,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {37168#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:11,471 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:11,472 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:11,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {37169#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:11,473 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:11,474 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:11,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {37170#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:11,475 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:11,475 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:11,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {37171#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:11,477 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:11,477 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:11,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {37172#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:11,479 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:11,479 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:11,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {37173#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:11,480 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:11,481 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:11,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {37174#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:11,482 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:11,483 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:11,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {37175#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:11,484 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:11,485 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:11,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {37176#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:11,486 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:11,486 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:11,487 INFO L273 TraceCheckUtils]: 50: Hoare triple {37177#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:11,488 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:11,488 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:11,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {37178#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:11,489 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:11,490 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:11,490 INFO L273 TraceCheckUtils]: 56: Hoare triple {37179#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:11,491 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:11,492 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:11,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {37180#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:11,493 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:11,493 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:11,494 INFO L273 TraceCheckUtils]: 62: Hoare triple {37181#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:11,495 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:11,495 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:11,496 INFO L273 TraceCheckUtils]: 65: Hoare triple {37182#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:11,496 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:11,497 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:11,497 INFO L273 TraceCheckUtils]: 68: Hoare triple {37183#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:11,498 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:11,499 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:11,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {37184#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:11,500 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:11,500 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:11,501 INFO L273 TraceCheckUtils]: 74: Hoare triple {37185#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:11,501 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:11,502 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:11,502 INFO L273 TraceCheckUtils]: 77: Hoare triple {37186#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:11,503 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:11,504 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:11,504 INFO L273 TraceCheckUtils]: 80: Hoare triple {37187#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:11,505 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:11,505 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:11,506 INFO L273 TraceCheckUtils]: 83: Hoare triple {37188#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:11,507 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:11,507 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:11,507 INFO L273 TraceCheckUtils]: 86: Hoare triple {37189#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:11,508 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:11,509 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:11,509 INFO L273 TraceCheckUtils]: 89: Hoare triple {37190#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:11,510 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:11,510 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:11,511 INFO L273 TraceCheckUtils]: 92: Hoare triple {37191#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:11,512 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:11,512 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:11,513 INFO L273 TraceCheckUtils]: 95: Hoare triple {37192#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:11,513 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:11,514 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:11,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {37193#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:11,515 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:11,516 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:11,516 INFO L273 TraceCheckUtils]: 101: Hoare triple {37194#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:11,517 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:11,517 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:11,518 INFO L273 TraceCheckUtils]: 104: Hoare triple {37195#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:11,519 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:11,519 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:11,520 INFO L273 TraceCheckUtils]: 107: Hoare triple {37196#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:11,520 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:11,521 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:11,521 INFO L273 TraceCheckUtils]: 110: Hoare triple {37197#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:11,522 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:11,523 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:11,523 INFO L273 TraceCheckUtils]: 113: Hoare triple {37198#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:11,524 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:11,524 INFO L273 TraceCheckUtils]: 115: Hoare triple {37199#(<= main_~i~0 37)} assume !(~i~0 < 100000); {37162#false} is VALID [2018-11-23 11:53:11,525 INFO L273 TraceCheckUtils]: 116: Hoare triple {37162#false} assume !(0 != ~swapped~0); {37162#false} is VALID [2018-11-23 11:53:11,525 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:11,525 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:11,525 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:11,525 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:11,525 INFO L273 TraceCheckUtils]: 121: Hoare triple {37162#false} ~cond := #in~cond; {37162#false} is VALID [2018-11-23 11:53:11,526 INFO L273 TraceCheckUtils]: 122: Hoare triple {37162#false} assume 0 == ~cond; {37162#false} is VALID [2018-11-23 11:53:11,526 INFO L273 TraceCheckUtils]: 123: Hoare triple {37162#false} assume !false; {37162#false} is VALID [2018-11-23 11:53:11,537 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:11,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:11,537 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:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:11,676 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-11-23 11:53:11,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:11,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:12,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {37161#true} call ULTIMATE.init(); {37161#true} is VALID [2018-11-23 11:53:12,715 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:12,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {37161#true} assume true; {37161#true} is VALID [2018-11-23 11:53:12,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37161#true} {37161#true} #79#return; {37161#true} is VALID [2018-11-23 11:53:12,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {37161#true} call #t~ret8 := main(); {37161#true} is VALID [2018-11-23 11:53:12,716 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:12,717 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:12,718 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37221#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:12,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {37221#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37221#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:12,718 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:12,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:12,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {37164#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37164#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:12,720 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:12,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:12,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {37165#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37165#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:12,721 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:12,721 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:12,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {37166#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37166#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:12,722 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:12,723 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:12,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {37167#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37167#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:12,724 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:12,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:12,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {37168#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37168#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:12,725 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:12,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:12,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {37169#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37169#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:12,727 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:12,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:12,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {37170#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37170#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:12,729 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:12,730 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:12,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {37171#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37171#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:12,731 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:12,731 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:12,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {37172#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37172#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:12,733 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:12,733 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:12,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {37173#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37173#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:12,735 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:12,735 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:12,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {37174#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37174#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:12,737 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:12,737 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:12,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {37175#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37175#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:12,738 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:12,739 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:12,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {37176#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37176#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:12,740 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:12,741 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:12,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {37177#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37177#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:12,742 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:12,742 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:12,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {37178#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37178#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:12,744 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:12,744 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:12,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {37179#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37179#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:12,745 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:12,746 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:12,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {37180#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37180#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:12,747 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:12,748 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:12,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {37181#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37181#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:12,749 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:12,749 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:12,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {37182#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37182#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:12,751 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:12,751 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:12,752 INFO L273 TraceCheckUtils]: 68: Hoare triple {37183#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37183#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:12,752 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:12,753 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:12,753 INFO L273 TraceCheckUtils]: 71: Hoare triple {37184#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37184#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:12,754 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:12,755 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:12,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {37185#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37185#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:12,756 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:12,757 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:12,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {37186#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37186#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:12,758 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:12,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:12,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {37187#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37187#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:12,760 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:12,760 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:12,761 INFO L273 TraceCheckUtils]: 83: Hoare triple {37188#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37188#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:12,762 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:12,762 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:12,763 INFO L273 TraceCheckUtils]: 86: Hoare triple {37189#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37189#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:12,763 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:12,764 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:12,764 INFO L273 TraceCheckUtils]: 89: Hoare triple {37190#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37190#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:12,765 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:12,765 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:12,766 INFO L273 TraceCheckUtils]: 92: Hoare triple {37191#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37191#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:12,767 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:12,767 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:12,768 INFO L273 TraceCheckUtils]: 95: Hoare triple {37192#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37192#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:12,768 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:12,769 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:12,769 INFO L273 TraceCheckUtils]: 98: Hoare triple {37193#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37193#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:12,770 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:12,771 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:12,771 INFO L273 TraceCheckUtils]: 101: Hoare triple {37194#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37194#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:12,772 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:12,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:12,773 INFO L273 TraceCheckUtils]: 104: Hoare triple {37195#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37195#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:12,774 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:12,774 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:12,775 INFO L273 TraceCheckUtils]: 107: Hoare triple {37196#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37196#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:12,776 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:12,776 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:12,777 INFO L273 TraceCheckUtils]: 110: Hoare triple {37197#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37197#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:12,778 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:12,778 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:12,779 INFO L273 TraceCheckUtils]: 113: Hoare triple {37198#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {37198#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:12,779 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:12,780 INFO L273 TraceCheckUtils]: 115: Hoare triple {37199#(<= main_~i~0 37)} assume !(~i~0 < 100000); {37162#false} is VALID [2018-11-23 11:53:12,780 INFO L273 TraceCheckUtils]: 116: Hoare triple {37162#false} assume !(0 != ~swapped~0); {37162#false} is VALID [2018-11-23 11:53:12,781 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:12,781 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:12,781 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:12,781 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:12,781 INFO L273 TraceCheckUtils]: 121: Hoare triple {37162#false} ~cond := #in~cond; {37162#false} is VALID [2018-11-23 11:53:12,781 INFO L273 TraceCheckUtils]: 122: Hoare triple {37162#false} assume 0 == ~cond; {37162#false} is VALID [2018-11-23 11:53:12,782 INFO L273 TraceCheckUtils]: 123: Hoare triple {37162#false} assume !false; {37162#false} is VALID [2018-11-23 11:53:12,792 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:12,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:12,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 11:53:12,812 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:53:12,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:12,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:53:12,945 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:12,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:53:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:53:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:53:12,947 INFO L87 Difference]: Start difference. First operand 237 states and 312 transitions. Second operand 40 states. [2018-11-23 11:53:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:13,975 INFO L93 Difference]: Finished difference Result 478 states and 634 transitions. [2018-11-23 11:53:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:53:13,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 124 [2018-11-23 11:53:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-23 11:53:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:53:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 197 transitions. [2018-11-23 11:53:13,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 197 transitions. [2018-11-23 11:53:14,189 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:14,194 INFO L225 Difference]: With dead ends: 478 [2018-11-23 11:53:14,194 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 11:53:14,195 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:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 11:53:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2018-11-23 11:53:14,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:14,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:14,317 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:14,317 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 243 states. [2018-11-23 11:53:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,323 INFO L93 Difference]: Finished difference Result 247 states and 326 transitions. [2018-11-23 11:53:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2018-11-23 11:53:14,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,323 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand 247 states. [2018-11-23 11:53:14,323 INFO L87 Difference]: Start difference. First operand 243 states. Second operand 247 states. [2018-11-23 11:53:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:14,327 INFO L93 Difference]: Finished difference Result 247 states and 326 transitions. [2018-11-23 11:53:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 326 transitions. [2018-11-23 11:53:14,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:14,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:14,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:14,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-23 11:53:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 320 transitions. [2018-11-23 11:53:14,332 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 320 transitions. Word has length 124 [2018-11-23 11:53:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:14,333 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 320 transitions. [2018-11-23 11:53:14,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:53:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 320 transitions. [2018-11-23 11:53:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 11:53:14,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:14,334 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:14,334 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:14,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 45057480, now seen corresponding path program 37 times [2018-11-23 11:53:14,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:14,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {39036#true} call ULTIMATE.init(); {39036#true} is VALID [2018-11-23 11:53:15,684 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:15,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {39036#true} assume true; {39036#true} is VALID [2018-11-23 11:53:15,684 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39036#true} {39036#true} #79#return; {39036#true} is VALID [2018-11-23 11:53:15,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {39036#true} call #t~ret8 := main(); {39036#true} is VALID [2018-11-23 11:53:15,685 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:15,685 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:15,685 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39038#(= main_~i~0 1)} is VALID [2018-11-23 11:53:15,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {39038#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39038#(= main_~i~0 1)} is VALID [2018-11-23 11:53:15,687 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:15,687 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:15,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {39039#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:15,688 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:15,689 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:15,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {39040#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:15,690 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:15,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:15,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {39041#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:15,692 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:15,693 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:15,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {39042#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:15,694 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:15,695 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:15,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {39043#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:15,696 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:15,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:15,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {39044#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:15,698 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:15,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:15,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {39045#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:15,700 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:15,700 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:15,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {39046#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:15,702 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:15,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:15,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {39047#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:15,703 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:15,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:15,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {39048#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:15,706 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:15,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:15,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {39049#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:15,707 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:15,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:15,708 INFO L273 TraceCheckUtils]: 44: Hoare triple {39050#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:15,709 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:15,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:15,710 INFO L273 TraceCheckUtils]: 47: Hoare triple {39051#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:15,711 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:15,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:15,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {39052#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:15,713 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:15,714 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:15,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {39053#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:15,715 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:15,715 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:15,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {39054#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:15,717 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:15,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:15,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {39055#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:15,718 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:15,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:15,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {39056#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:15,720 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:15,721 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:15,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {39057#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:15,722 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:15,723 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:15,723 INFO L273 TraceCheckUtils]: 68: Hoare triple {39058#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:15,724 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:15,725 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:15,725 INFO L273 TraceCheckUtils]: 71: Hoare triple {39059#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:15,726 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:15,727 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:15,727 INFO L273 TraceCheckUtils]: 74: Hoare triple {39060#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:15,728 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:15,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:15,729 INFO L273 TraceCheckUtils]: 77: Hoare triple {39061#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:15,730 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:15,730 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:15,731 INFO L273 TraceCheckUtils]: 80: Hoare triple {39062#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:15,732 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:15,732 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:15,733 INFO L273 TraceCheckUtils]: 83: Hoare triple {39063#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:15,734 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:15,735 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:15,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {39064#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:15,736 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:15,737 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:15,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {39065#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:15,738 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:15,738 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:15,739 INFO L273 TraceCheckUtils]: 92: Hoare triple {39066#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:15,740 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:15,740 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:15,741 INFO L273 TraceCheckUtils]: 95: Hoare triple {39067#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:15,741 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:15,742 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:15,743 INFO L273 TraceCheckUtils]: 98: Hoare triple {39068#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:15,743 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:15,744 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:15,745 INFO L273 TraceCheckUtils]: 101: Hoare triple {39069#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:15,745 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:15,746 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:15,746 INFO L273 TraceCheckUtils]: 104: Hoare triple {39070#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:15,747 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:15,748 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:15,748 INFO L273 TraceCheckUtils]: 107: Hoare triple {39071#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:15,749 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:15,750 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:15,750 INFO L273 TraceCheckUtils]: 110: Hoare triple {39072#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:15,751 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:15,751 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:15,752 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:15,753 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:15,753 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:15,754 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:15,755 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:15,755 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 38)} assume !(~i~0 < 100000); {39037#false} is VALID [2018-11-23 11:53:15,755 INFO L273 TraceCheckUtils]: 119: Hoare triple {39037#false} assume !(0 != ~swapped~0); {39037#false} is VALID [2018-11-23 11:53:15,756 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:15,756 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:15,756 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:15,756 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:15,756 INFO L273 TraceCheckUtils]: 124: Hoare triple {39037#false} ~cond := #in~cond; {39037#false} is VALID [2018-11-23 11:53:15,757 INFO L273 TraceCheckUtils]: 125: Hoare triple {39037#false} assume 0 == ~cond; {39037#false} is VALID [2018-11-23 11:53:15,757 INFO L273 TraceCheckUtils]: 126: Hoare triple {39037#false} assume !false; {39037#false} is VALID [2018-11-23 11:53:15,768 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:15,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:15,768 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:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:15,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:16,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {39036#true} call ULTIMATE.init(); {39036#true} is VALID [2018-11-23 11:53:16,229 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:16,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {39036#true} assume true; {39036#true} is VALID [2018-11-23 11:53:16,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39036#true} {39036#true} #79#return; {39036#true} is VALID [2018-11-23 11:53:16,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {39036#true} call #t~ret8 := main(); {39036#true} is VALID [2018-11-23 11:53:16,229 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:16,230 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:16,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39097#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:16,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {39097#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39097#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:16,232 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:16,232 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:16,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {39039#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39039#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:16,233 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:16,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:16,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {39040#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39040#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:16,235 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:16,235 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:16,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {39041#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39041#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:16,236 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:16,237 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:16,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {39042#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39042#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:16,238 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:16,239 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:16,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {39043#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39043#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:16,242 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:16,243 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:16,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {39044#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39044#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:16,243 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:16,244 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:16,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {39045#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39045#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:16,245 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:16,245 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:16,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {39046#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39046#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:16,246 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:16,247 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:16,247 INFO L273 TraceCheckUtils]: 35: Hoare triple {39047#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39047#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:16,248 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:16,249 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:16,249 INFO L273 TraceCheckUtils]: 38: Hoare triple {39048#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39048#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:16,250 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:16,250 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:16,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {39049#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39049#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:16,252 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:16,253 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:16,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {39050#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39050#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:16,254 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:16,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:16,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {39051#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39051#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:16,256 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:16,256 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:16,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {39052#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39052#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:16,258 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:16,258 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:16,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {39053#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39053#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:16,259 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:16,260 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:16,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {39054#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39054#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:16,295 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:16,303 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:16,309 INFO L273 TraceCheckUtils]: 59: Hoare triple {39055#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39055#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:16,310 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:16,311 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:16,313 INFO L273 TraceCheckUtils]: 62: Hoare triple {39056#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39056#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:16,314 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:16,314 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:16,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {39057#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39057#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:16,315 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:16,315 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:16,316 INFO L273 TraceCheckUtils]: 68: Hoare triple {39058#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39058#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:16,316 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:16,316 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:16,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {39059#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39059#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:16,317 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:16,318 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:16,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {39060#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39060#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:16,318 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:16,319 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:16,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {39061#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39061#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:16,320 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:16,321 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:16,321 INFO L273 TraceCheckUtils]: 80: Hoare triple {39062#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39062#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:16,322 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:16,323 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:16,323 INFO L273 TraceCheckUtils]: 83: Hoare triple {39063#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39063#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:16,324 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:16,325 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:16,325 INFO L273 TraceCheckUtils]: 86: Hoare triple {39064#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39064#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:16,326 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:16,326 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:16,327 INFO L273 TraceCheckUtils]: 89: Hoare triple {39065#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39065#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:16,328 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:16,328 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:16,329 INFO L273 TraceCheckUtils]: 92: Hoare triple {39066#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39066#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:16,329 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:16,330 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:16,331 INFO L273 TraceCheckUtils]: 95: Hoare triple {39067#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39067#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:16,331 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:16,332 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:16,332 INFO L273 TraceCheckUtils]: 98: Hoare triple {39068#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39068#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:16,333 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:16,334 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:16,334 INFO L273 TraceCheckUtils]: 101: Hoare triple {39069#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39069#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:16,335 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:16,335 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:16,336 INFO L273 TraceCheckUtils]: 104: Hoare triple {39070#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39070#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:16,337 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:16,337 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:16,338 INFO L273 TraceCheckUtils]: 107: Hoare triple {39071#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39071#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:16,339 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:16,339 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:16,340 INFO L273 TraceCheckUtils]: 110: Hoare triple {39072#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39072#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:16,341 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:16,341 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:16,342 INFO L273 TraceCheckUtils]: 113: Hoare triple {39073#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39073#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:16,342 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:16,343 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:16,343 INFO L273 TraceCheckUtils]: 116: Hoare triple {39074#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {39074#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:16,344 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:16,345 INFO L273 TraceCheckUtils]: 118: Hoare triple {39075#(<= main_~i~0 38)} assume !(~i~0 < 100000); {39037#false} is VALID [2018-11-23 11:53:16,345 INFO L273 TraceCheckUtils]: 119: Hoare triple {39037#false} assume !(0 != ~swapped~0); {39037#false} is VALID [2018-11-23 11:53:16,345 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:16,346 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:16,346 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:16,346 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:16,346 INFO L273 TraceCheckUtils]: 124: Hoare triple {39037#false} ~cond := #in~cond; {39037#false} is VALID [2018-11-23 11:53:16,346 INFO L273 TraceCheckUtils]: 125: Hoare triple {39037#false} assume 0 == ~cond; {39037#false} is VALID [2018-11-23 11:53:16,347 INFO L273 TraceCheckUtils]: 126: Hoare triple {39037#false} assume !false; {39037#false} is VALID [2018-11-23 11:53:16,358 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:16,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:16,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 11:53:16,377 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:53:16,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:16,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:53:16,554 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:16,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:53:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:53:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:53:16,556 INFO L87 Difference]: Start difference. First operand 243 states and 320 transitions. Second operand 41 states. [2018-11-23 11:53:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:17,638 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2018-11-23 11:53:17,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:53:17,638 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-11-23 11:53:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 201 transitions. [2018-11-23 11:53:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:53:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 201 transitions. [2018-11-23 11:53:17,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 201 transitions. [2018-11-23 11:53:17,856 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:17,862 INFO L225 Difference]: With dead ends: 490 [2018-11-23 11:53:17,862 INFO L226 Difference]: Without dead ends: 253 [2018-11-23 11:53:17,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:53:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-23 11:53:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2018-11-23 11:53:18,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:18,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:18,059 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:18,059 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 249 states. [2018-11-23 11:53:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:18,064 INFO L93 Difference]: Finished difference Result 253 states and 334 transitions. [2018-11-23 11:53:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2018-11-23 11:53:18,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:18,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:18,065 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 253 states. [2018-11-23 11:53:18,065 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 253 states. [2018-11-23 11:53:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:18,069 INFO L93 Difference]: Finished difference Result 253 states and 334 transitions. [2018-11-23 11:53:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2018-11-23 11:53:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:18,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:18,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:18,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 11:53:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 328 transitions. [2018-11-23 11:53:18,073 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 328 transitions. Word has length 127 [2018-11-23 11:53:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:18,073 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 328 transitions. [2018-11-23 11:53:18,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:53:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 328 transitions. [2018-11-23 11:53:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 11:53:18,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:18,074 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:18,074 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:18,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:18,074 INFO L82 PathProgramCache]: Analyzing trace with hash 990250161, now seen corresponding path program 38 times [2018-11-23 11:53:18,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:18,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:18,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:18,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:19,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {40957#true} call ULTIMATE.init(); {40957#true} is VALID [2018-11-23 11:53:19,171 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:19,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {40957#true} assume true; {40957#true} is VALID [2018-11-23 11:53:19,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40957#true} {40957#true} #79#return; {40957#true} is VALID [2018-11-23 11:53:19,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {40957#true} call #t~ret8 := main(); {40957#true} is VALID [2018-11-23 11:53:19,172 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:19,173 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:19,173 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40959#(= main_~i~0 1)} is VALID [2018-11-23 11:53:19,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {40959#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40959#(= main_~i~0 1)} is VALID [2018-11-23 11:53:19,174 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:19,175 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:19,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {40960#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:19,176 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:19,176 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:19,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {40961#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:19,177 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:19,177 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:19,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {40962#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:19,179 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:19,179 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:19,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {40963#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:19,180 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:19,181 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:19,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {40964#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:19,182 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:19,182 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:19,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {40965#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:19,184 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:19,184 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:19,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {40966#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:19,185 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:19,186 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:19,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {40967#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:19,187 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:19,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:19,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {40968#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:19,189 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:19,189 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:19,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {40969#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:19,190 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:19,191 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:19,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {40970#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:19,192 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:19,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:19,193 INFO L273 TraceCheckUtils]: 44: Hoare triple {40971#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:19,194 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:19,195 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:19,195 INFO L273 TraceCheckUtils]: 47: Hoare triple {40972#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:19,196 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:19,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:19,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {40973#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:19,197 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:19,198 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:19,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {40974#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:19,199 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:19,200 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:19,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {40975#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:19,201 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:19,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:19,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {40976#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:19,204 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:19,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:19,204 INFO L273 TraceCheckUtils]: 62: Hoare triple {40977#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:19,205 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:19,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:19,206 INFO L273 TraceCheckUtils]: 65: Hoare triple {40978#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:19,206 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:19,206 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:19,207 INFO L273 TraceCheckUtils]: 68: Hoare triple {40979#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:19,207 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:19,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:19,209 INFO L273 TraceCheckUtils]: 71: Hoare triple {40980#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:19,209 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:19,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:19,210 INFO L273 TraceCheckUtils]: 74: Hoare triple {40981#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:19,211 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:19,212 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:19,212 INFO L273 TraceCheckUtils]: 77: Hoare triple {40982#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:19,213 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:19,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:19,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {40983#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:19,215 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:19,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:19,216 INFO L273 TraceCheckUtils]: 83: Hoare triple {40984#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:19,216 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:19,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:19,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {40985#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:19,218 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:19,219 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:19,219 INFO L273 TraceCheckUtils]: 89: Hoare triple {40986#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:19,220 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:19,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:19,221 INFO L273 TraceCheckUtils]: 92: Hoare triple {40987#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:19,221 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:19,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:19,222 INFO L273 TraceCheckUtils]: 95: Hoare triple {40988#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:19,223 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:19,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:19,224 INFO L273 TraceCheckUtils]: 98: Hoare triple {40989#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:19,225 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:19,226 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:19,226 INFO L273 TraceCheckUtils]: 101: Hoare triple {40990#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:19,227 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:19,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:19,228 INFO L273 TraceCheckUtils]: 104: Hoare triple {40991#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:19,229 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:19,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:19,230 INFO L273 TraceCheckUtils]: 107: Hoare triple {40992#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:19,230 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:19,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:19,231 INFO L273 TraceCheckUtils]: 110: Hoare triple {40993#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:19,232 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:19,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:19,233 INFO L273 TraceCheckUtils]: 113: Hoare triple {40994#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:19,234 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:19,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:19,235 INFO L273 TraceCheckUtils]: 116: Hoare triple {40995#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:19,236 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:19,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:19,237 INFO L273 TraceCheckUtils]: 119: Hoare triple {40996#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:19,237 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:19,238 INFO L273 TraceCheckUtils]: 121: Hoare triple {40997#(<= main_~i~0 39)} assume !(~i~0 < 100000); {40958#false} is VALID [2018-11-23 11:53:19,238 INFO L273 TraceCheckUtils]: 122: Hoare triple {40958#false} assume !(0 != ~swapped~0); {40958#false} is VALID [2018-11-23 11:53:19,239 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:19,239 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:19,239 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:19,239 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:19,239 INFO L273 TraceCheckUtils]: 127: Hoare triple {40958#false} ~cond := #in~cond; {40958#false} is VALID [2018-11-23 11:53:19,239 INFO L273 TraceCheckUtils]: 128: Hoare triple {40958#false} assume 0 == ~cond; {40958#false} is VALID [2018-11-23 11:53:19,240 INFO L273 TraceCheckUtils]: 129: Hoare triple {40958#false} assume !false; {40958#false} is VALID [2018-11-23 11:53:19,253 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:19,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:19,253 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:19,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:19,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:19,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:19,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:19,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {40957#true} call ULTIMATE.init(); {40957#true} is VALID [2018-11-23 11:53:19,771 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:19,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {40957#true} assume true; {40957#true} is VALID [2018-11-23 11:53:19,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40957#true} {40957#true} #79#return; {40957#true} is VALID [2018-11-23 11:53:19,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {40957#true} call #t~ret8 := main(); {40957#true} is VALID [2018-11-23 11:53:19,771 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:19,772 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:19,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {41019#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:19,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {41019#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {41019#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:19,776 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:19,776 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:19,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {40960#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40960#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:19,779 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:19,782 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:19,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {40961#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40961#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:19,785 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:19,785 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:19,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {40962#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40962#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:19,788 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:19,791 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:19,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {40963#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40963#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:19,794 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:19,794 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:19,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {40964#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40964#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:19,797 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:19,800 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:19,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {40965#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40965#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:19,803 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:19,803 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:19,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {40966#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40966#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:19,805 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:19,808 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:19,808 INFO L273 TraceCheckUtils]: 32: Hoare triple {40967#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40967#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:19,811 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:19,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:19,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {40968#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40968#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:19,814 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:19,816 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:19,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {40969#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40969#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:19,819 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:19,819 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:19,822 INFO L273 TraceCheckUtils]: 41: Hoare triple {40970#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40970#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:19,822 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:19,825 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:19,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {40971#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40971#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:19,828 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:19,828 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:19,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {40972#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40972#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:19,831 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:19,833 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:19,833 INFO L273 TraceCheckUtils]: 50: Hoare triple {40973#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40973#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:19,836 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:19,836 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:19,839 INFO L273 TraceCheckUtils]: 53: Hoare triple {40974#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40974#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:19,839 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:19,842 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:19,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {40975#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40975#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:19,867 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:19,880 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:19,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {40976#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40976#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:19,888 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:19,890 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:19,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {40977#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40977#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:19,892 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:19,892 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:19,895 INFO L273 TraceCheckUtils]: 65: Hoare triple {40978#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40978#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:19,895 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:19,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:19,898 INFO L273 TraceCheckUtils]: 68: Hoare triple {40979#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40979#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:19,901 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:19,901 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:19,904 INFO L273 TraceCheckUtils]: 71: Hoare triple {40980#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40980#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:19,904 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:19,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:19,907 INFO L273 TraceCheckUtils]: 74: Hoare triple {40981#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40981#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:19,909 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:19,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:19,911 INFO L273 TraceCheckUtils]: 77: Hoare triple {40982#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40982#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:19,914 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:19,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:19,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {40983#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40983#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:19,916 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:19,918 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:19,918 INFO L273 TraceCheckUtils]: 83: Hoare triple {40984#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40984#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:19,920 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:19,920 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:19,923 INFO L273 TraceCheckUtils]: 86: Hoare triple {40985#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40985#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:19,923 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:19,926 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:19,926 INFO L273 TraceCheckUtils]: 89: Hoare triple {40986#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40986#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:19,928 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:19,928 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:19,930 INFO L273 TraceCheckUtils]: 92: Hoare triple {40987#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40987#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:19,930 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:19,932 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:19,932 INFO L273 TraceCheckUtils]: 95: Hoare triple {40988#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40988#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:19,935 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:19,935 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:19,937 INFO L273 TraceCheckUtils]: 98: Hoare triple {40989#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40989#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:19,937 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:19,940 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:19,940 INFO L273 TraceCheckUtils]: 101: Hoare triple {40990#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40990#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:19,942 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:19,942 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:19,945 INFO L273 TraceCheckUtils]: 104: Hoare triple {40991#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40991#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:19,961 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:19,973 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:19,986 INFO L273 TraceCheckUtils]: 107: Hoare triple {40992#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40992#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:19,997 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:19,997 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:19,999 INFO L273 TraceCheckUtils]: 110: Hoare triple {40993#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40993#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:19,999 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:20,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,001 INFO L273 TraceCheckUtils]: 113: Hoare triple {40994#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40994#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:20,003 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:20,005 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,005 INFO L273 TraceCheckUtils]: 116: Hoare triple {40995#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40995#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:20,007 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:20,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,009 INFO L273 TraceCheckUtils]: 119: Hoare triple {40996#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {40996#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:20,009 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:20,011 INFO L273 TraceCheckUtils]: 121: Hoare triple {40997#(<= main_~i~0 39)} assume !(~i~0 < 100000); {40958#false} is VALID [2018-11-23 11:53:20,011 INFO L273 TraceCheckUtils]: 122: Hoare triple {40958#false} assume !(0 != ~swapped~0); {40958#false} is VALID [2018-11-23 11:53:20,011 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:20,011 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:20,011 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:20,011 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:20,011 INFO L273 TraceCheckUtils]: 127: Hoare triple {40958#false} ~cond := #in~cond; {40958#false} is VALID [2018-11-23 11:53:20,011 INFO L273 TraceCheckUtils]: 128: Hoare triple {40958#false} assume 0 == ~cond; {40958#false} is VALID [2018-11-23 11:53:20,012 INFO L273 TraceCheckUtils]: 129: Hoare triple {40958#false} assume !false; {40958#false} is VALID [2018-11-23 11:53:20,023 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:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 11:53:20,043 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:53:20,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:20,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:53:20,210 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:20,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:53:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:53:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:53:20,211 INFO L87 Difference]: Start difference. First operand 249 states and 328 transitions. Second operand 42 states. [2018-11-23 11:53:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:21,365 INFO L93 Difference]: Finished difference Result 502 states and 666 transitions. [2018-11-23 11:53:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:53:21,366 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 130 [2018-11-23 11:53:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 205 transitions. [2018-11-23 11:53:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:53:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 205 transitions. [2018-11-23 11:53:21,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 205 transitions. [2018-11-23 11:53:21,587 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:21,591 INFO L225 Difference]: With dead ends: 502 [2018-11-23 11:53:21,592 INFO L226 Difference]: Without dead ends: 259 [2018-11-23 11:53:21,593 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:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-23 11:53:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-11-23 11:53:22,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:22,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:22,168 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:22,168 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 255 states. [2018-11-23 11:53:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:22,174 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2018-11-23 11:53:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 342 transitions. [2018-11-23 11:53:22,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:22,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:22,175 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand 259 states. [2018-11-23 11:53:22,175 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 259 states. [2018-11-23 11:53:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:22,180 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2018-11-23 11:53:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 342 transitions. [2018-11-23 11:53:22,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:22,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:22,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:22,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-23 11:53:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 336 transitions. [2018-11-23 11:53:22,185 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 336 transitions. Word has length 130 [2018-11-23 11:53:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:22,186 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 336 transitions. [2018-11-23 11:53:22,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:53:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 336 transitions. [2018-11-23 11:53:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 11:53:22,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:22,186 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:22,187 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:22,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1419817256, now seen corresponding path program 39 times [2018-11-23 11:53:22,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:22,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:22,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:23,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {42924#true} call ULTIMATE.init(); {42924#true} is VALID [2018-11-23 11:53:23,447 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:23,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {42924#true} assume true; {42924#true} is VALID [2018-11-23 11:53:23,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42924#true} {42924#true} #79#return; {42924#true} is VALID [2018-11-23 11:53:23,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {42924#true} call #t~ret8 := main(); {42924#true} is VALID [2018-11-23 11:53:23,448 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:23,448 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:23,449 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42926#(= main_~i~0 1)} is VALID [2018-11-23 11:53:23,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {42926#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42926#(= main_~i~0 1)} is VALID [2018-11-23 11:53:23,449 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:23,450 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:23,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {42927#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:23,451 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:23,451 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:23,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {42928#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:23,452 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:23,452 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:23,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {42929#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:23,454 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:23,454 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:23,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {42930#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:23,455 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:23,456 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:23,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {42931#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:23,457 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:23,458 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:23,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {42932#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:23,459 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:23,459 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:23,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {42933#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:23,461 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:23,461 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:23,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {42934#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:23,462 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:23,463 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:23,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {42935#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:23,464 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:23,465 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:23,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {42936#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:23,466 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:23,466 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:23,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {42937#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:23,468 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:23,468 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:23,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {42938#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:23,469 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:23,470 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:23,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {42939#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:23,471 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:23,472 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:23,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {42940#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:23,473 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:23,473 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:23,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {42941#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:23,475 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:23,475 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:23,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {42942#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:23,476 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:23,477 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:23,477 INFO L273 TraceCheckUtils]: 59: Hoare triple {42943#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:23,478 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:23,479 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:23,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {42944#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:23,480 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:23,480 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:23,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {42945#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:23,481 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:23,482 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:23,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {42946#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:23,483 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:23,484 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:23,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {42947#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:23,485 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:23,485 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:23,486 INFO L273 TraceCheckUtils]: 74: Hoare triple {42948#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:23,486 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:23,487 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:23,487 INFO L273 TraceCheckUtils]: 77: Hoare triple {42949#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:23,488 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:23,489 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:23,489 INFO L273 TraceCheckUtils]: 80: Hoare triple {42950#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:23,490 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:23,490 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:23,491 INFO L273 TraceCheckUtils]: 83: Hoare triple {42951#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:23,492 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:23,492 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:23,493 INFO L273 TraceCheckUtils]: 86: Hoare triple {42952#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:23,493 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:23,494 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:23,495 INFO L273 TraceCheckUtils]: 89: Hoare triple {42953#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:23,495 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:23,496 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:23,496 INFO L273 TraceCheckUtils]: 92: Hoare triple {42954#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:23,497 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:23,498 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:23,498 INFO L273 TraceCheckUtils]: 95: Hoare triple {42955#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:23,499 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:23,499 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:23,500 INFO L273 TraceCheckUtils]: 98: Hoare triple {42956#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:23,501 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:23,501 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:23,502 INFO L273 TraceCheckUtils]: 101: Hoare triple {42957#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:23,502 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:23,503 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:23,504 INFO L273 TraceCheckUtils]: 104: Hoare triple {42958#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:23,504 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:23,505 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:23,505 INFO L273 TraceCheckUtils]: 107: Hoare triple {42959#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:23,506 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:23,507 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:23,507 INFO L273 TraceCheckUtils]: 110: Hoare triple {42960#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:23,508 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:23,508 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:23,509 INFO L273 TraceCheckUtils]: 113: Hoare triple {42961#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:23,509 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:23,510 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:23,510 INFO L273 TraceCheckUtils]: 116: Hoare triple {42962#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:23,511 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:23,512 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:23,512 INFO L273 TraceCheckUtils]: 119: Hoare triple {42963#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:23,513 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:23,513 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:23,514 INFO L273 TraceCheckUtils]: 122: Hoare triple {42964#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:23,515 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:23,515 INFO L273 TraceCheckUtils]: 124: Hoare triple {42965#(<= main_~i~0 40)} assume !(~i~0 < 100000); {42925#false} is VALID [2018-11-23 11:53:23,516 INFO L273 TraceCheckUtils]: 125: Hoare triple {42925#false} assume !(0 != ~swapped~0); {42925#false} is VALID [2018-11-23 11:53:23,516 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:23,516 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:23,516 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:23,516 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:23,516 INFO L273 TraceCheckUtils]: 130: Hoare triple {42925#false} ~cond := #in~cond; {42925#false} is VALID [2018-11-23 11:53:23,517 INFO L273 TraceCheckUtils]: 131: Hoare triple {42925#false} assume 0 == ~cond; {42925#false} is VALID [2018-11-23 11:53:23,517 INFO L273 TraceCheckUtils]: 132: Hoare triple {42925#false} assume !false; {42925#false} is VALID [2018-11-23 11:53:23,528 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:23,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:23,529 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:23,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:23,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-11-23 11:53:23,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:23,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:24,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {42924#true} call ULTIMATE.init(); {42924#true} is VALID [2018-11-23 11:53:24,098 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:24,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {42924#true} assume true; {42924#true} is VALID [2018-11-23 11:53:24,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42924#true} {42924#true} #79#return; {42924#true} is VALID [2018-11-23 11:53:24,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {42924#true} call #t~ret8 := main(); {42924#true} is VALID [2018-11-23 11:53:24,098 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:24,099 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:24,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42987#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:24,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {42987#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42987#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:24,100 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:24,101 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:24,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {42927#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42927#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:24,101 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:24,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:24,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {42928#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42928#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:24,103 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:24,104 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:24,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {42929#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42929#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:24,105 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:24,106 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:24,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {42930#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42930#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:24,107 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:24,108 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:24,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {42931#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42931#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:24,109 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:24,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:24,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {42932#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42932#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:24,110 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:24,111 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:24,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {42933#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42933#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:24,112 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:24,113 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:24,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {42934#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42934#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:24,114 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:24,114 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:24,115 INFO L273 TraceCheckUtils]: 35: Hoare triple {42935#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42935#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:24,115 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:24,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:24,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {42936#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42936#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:24,117 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:24,118 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:24,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {42937#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42937#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:24,119 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:24,119 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:24,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {42938#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42938#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:24,121 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:24,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:24,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {42939#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42939#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:24,122 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:24,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:24,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {42940#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42940#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:24,124 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:24,124 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:24,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {42941#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42941#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:24,126 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:24,126 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:24,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {42942#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42942#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:24,127 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:24,128 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:24,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {42943#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42943#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:24,129 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:24,130 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:24,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {42944#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42944#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:24,131 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:24,131 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:24,132 INFO L273 TraceCheckUtils]: 65: Hoare triple {42945#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42945#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:24,132 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:24,133 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:24,133 INFO L273 TraceCheckUtils]: 68: Hoare triple {42946#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42946#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:24,134 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:24,135 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:24,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {42947#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42947#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:24,136 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:24,136 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:24,137 INFO L273 TraceCheckUtils]: 74: Hoare triple {42948#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42948#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:24,138 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:24,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:24,139 INFO L273 TraceCheckUtils]: 77: Hoare triple {42949#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42949#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:24,139 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:24,140 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:24,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {42950#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42950#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:24,141 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:24,141 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:24,142 INFO L273 TraceCheckUtils]: 83: Hoare triple {42951#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42951#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:24,143 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:24,143 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:24,144 INFO L273 TraceCheckUtils]: 86: Hoare triple {42952#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42952#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:24,144 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:24,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:24,145 INFO L273 TraceCheckUtils]: 89: Hoare triple {42953#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42953#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:24,146 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:24,146 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:24,147 INFO L273 TraceCheckUtils]: 92: Hoare triple {42954#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42954#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:24,148 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:24,148 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:24,149 INFO L273 TraceCheckUtils]: 95: Hoare triple {42955#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42955#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:24,149 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:24,150 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:24,150 INFO L273 TraceCheckUtils]: 98: Hoare triple {42956#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42956#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:24,151 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:24,152 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:24,152 INFO L273 TraceCheckUtils]: 101: Hoare triple {42957#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42957#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:24,153 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:24,153 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:24,154 INFO L273 TraceCheckUtils]: 104: Hoare triple {42958#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42958#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:24,154 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:24,155 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:24,155 INFO L273 TraceCheckUtils]: 107: Hoare triple {42959#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42959#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:24,156 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:24,157 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:24,157 INFO L273 TraceCheckUtils]: 110: Hoare triple {42960#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42960#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:24,158 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:24,158 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:24,159 INFO L273 TraceCheckUtils]: 113: Hoare triple {42961#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42961#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:24,159 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:24,160 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:24,161 INFO L273 TraceCheckUtils]: 116: Hoare triple {42962#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42962#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:24,161 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:24,162 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:24,162 INFO L273 TraceCheckUtils]: 119: Hoare triple {42963#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42963#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:24,163 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:24,163 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:24,164 INFO L273 TraceCheckUtils]: 122: Hoare triple {42964#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {42964#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:24,165 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:24,165 INFO L273 TraceCheckUtils]: 124: Hoare triple {42965#(<= main_~i~0 40)} assume !(~i~0 < 100000); {42925#false} is VALID [2018-11-23 11:53:24,166 INFO L273 TraceCheckUtils]: 125: Hoare triple {42925#false} assume !(0 != ~swapped~0); {42925#false} is VALID [2018-11-23 11:53:24,166 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:24,166 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:24,166 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:24,166 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:24,166 INFO L273 TraceCheckUtils]: 130: Hoare triple {42925#false} ~cond := #in~cond; {42925#false} is VALID [2018-11-23 11:53:24,167 INFO L273 TraceCheckUtils]: 131: Hoare triple {42925#false} assume 0 == ~cond; {42925#false} is VALID [2018-11-23 11:53:24,167 INFO L273 TraceCheckUtils]: 132: Hoare triple {42925#false} assume !false; {42925#false} is VALID [2018-11-23 11:53:24,178 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:24,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:24,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 11:53:24,199 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:53:24,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:24,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:53:24,349 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:24,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:53:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:53:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:53:24,353 INFO L87 Difference]: Start difference. First operand 255 states and 336 transitions. Second operand 43 states. [2018-11-23 11:53:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,466 INFO L93 Difference]: Finished difference Result 514 states and 682 transitions. [2018-11-23 11:53:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:53:25,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-11-23 11:53:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 209 transitions. [2018-11-23 11:53:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:53:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 209 transitions. [2018-11-23 11:53:25,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 209 transitions. [2018-11-23 11:53:25,706 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:25,711 INFO L225 Difference]: With dead ends: 514 [2018-11-23 11:53:25,711 INFO L226 Difference]: Without dead ends: 265 [2018-11-23 11:53:25,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:53:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-23 11:53:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2018-11-23 11:53:25,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:25,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:25,913 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:25,913 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 261 states. [2018-11-23 11:53:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,918 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2018-11-23 11:53:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 350 transitions. [2018-11-23 11:53:25,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:25,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:25,919 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand 265 states. [2018-11-23 11:53:25,919 INFO L87 Difference]: Start difference. First operand 261 states. Second operand 265 states. [2018-11-23 11:53:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:25,923 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2018-11-23 11:53:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 350 transitions. [2018-11-23 11:53:25,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:25,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:25,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:25,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-23 11:53:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 344 transitions. [2018-11-23 11:53:25,928 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 344 transitions. Word has length 133 [2018-11-23 11:53:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 344 transitions. [2018-11-23 11:53:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:53:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 344 transitions. [2018-11-23 11:53:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 11:53:25,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:25,929 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:25,929 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:25,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -349397679, now seen corresponding path program 40 times [2018-11-23 11:53:25,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:27,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {44937#true} call ULTIMATE.init(); {44937#true} is VALID [2018-11-23 11:53:27,015 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:27,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {44937#true} assume true; {44937#true} is VALID [2018-11-23 11:53:27,015 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44937#true} {44937#true} #79#return; {44937#true} is VALID [2018-11-23 11:53:27,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {44937#true} call #t~ret8 := main(); {44937#true} is VALID [2018-11-23 11:53:27,016 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:27,016 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:27,017 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44939#(= main_~i~0 1)} is VALID [2018-11-23 11:53:27,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {44939#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44939#(= main_~i~0 1)} is VALID [2018-11-23 11:53:27,018 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:27,018 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {44940#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,020 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:27,020 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {44941#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,021 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:27,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {44942#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,023 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:27,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {44943#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,025 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:27,025 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {44944#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,027 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:27,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {44945#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,028 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:27,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {44946#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,030 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:27,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {44947#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,032 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:27,032 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {44948#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,034 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:27,034 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {44949#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,035 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:27,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,036 INFO L273 TraceCheckUtils]: 41: Hoare triple {44950#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,037 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:27,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {44951#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,039 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:27,040 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {44952#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,041 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:27,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {44953#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,043 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:27,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {44954#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,044 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:27,045 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {44955#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,046 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:27,047 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,047 INFO L273 TraceCheckUtils]: 59: Hoare triple {44956#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,048 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:27,048 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {44957#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,049 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:27,050 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,050 INFO L273 TraceCheckUtils]: 65: Hoare triple {44958#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,051 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:27,052 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,052 INFO L273 TraceCheckUtils]: 68: Hoare triple {44959#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,053 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:27,053 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,054 INFO L273 TraceCheckUtils]: 71: Hoare triple {44960#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,055 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:27,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,056 INFO L273 TraceCheckUtils]: 74: Hoare triple {44961#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,056 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:27,057 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,057 INFO L273 TraceCheckUtils]: 77: Hoare triple {44962#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,058 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:27,059 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,059 INFO L273 TraceCheckUtils]: 80: Hoare triple {44963#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,060 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:27,060 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,061 INFO L273 TraceCheckUtils]: 83: Hoare triple {44964#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,062 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:27,062 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,063 INFO L273 TraceCheckUtils]: 86: Hoare triple {44965#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,063 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:27,064 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,064 INFO L273 TraceCheckUtils]: 89: Hoare triple {44966#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,065 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:27,065 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,066 INFO L273 TraceCheckUtils]: 92: Hoare triple {44967#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,066 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:27,067 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,068 INFO L273 TraceCheckUtils]: 95: Hoare triple {44968#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,068 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:27,069 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,069 INFO L273 TraceCheckUtils]: 98: Hoare triple {44969#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,070 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:27,070 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,071 INFO L273 TraceCheckUtils]: 101: Hoare triple {44970#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,072 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:27,072 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,073 INFO L273 TraceCheckUtils]: 104: Hoare triple {44971#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,073 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:27,074 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,074 INFO L273 TraceCheckUtils]: 107: Hoare triple {44972#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,075 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:27,076 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,076 INFO L273 TraceCheckUtils]: 110: Hoare triple {44973#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,077 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:27,077 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,078 INFO L273 TraceCheckUtils]: 113: Hoare triple {44974#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,078 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:27,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,080 INFO L273 TraceCheckUtils]: 116: Hoare triple {44975#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,080 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:27,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,081 INFO L273 TraceCheckUtils]: 119: Hoare triple {44976#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,082 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:27,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,083 INFO L273 TraceCheckUtils]: 122: Hoare triple {44977#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,084 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:27,084 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,085 INFO L273 TraceCheckUtils]: 125: Hoare triple {44978#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,085 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:27,086 INFO L273 TraceCheckUtils]: 127: Hoare triple {44979#(<= main_~i~0 41)} assume !(~i~0 < 100000); {44938#false} is VALID [2018-11-23 11:53:27,086 INFO L273 TraceCheckUtils]: 128: Hoare triple {44938#false} assume !(0 != ~swapped~0); {44938#false} is VALID [2018-11-23 11:53:27,086 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:27,087 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:27,087 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:27,087 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:27,087 INFO L273 TraceCheckUtils]: 133: Hoare triple {44938#false} ~cond := #in~cond; {44938#false} is VALID [2018-11-23 11:53:27,087 INFO L273 TraceCheckUtils]: 134: Hoare triple {44938#false} assume 0 == ~cond; {44938#false} is VALID [2018-11-23 11:53:27,087 INFO L273 TraceCheckUtils]: 135: Hoare triple {44938#false} assume !false; {44938#false} is VALID [2018-11-23 11:53:27,099 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:27,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:27,099 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:27,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:27,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:27,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:27,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:27,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {44937#true} call ULTIMATE.init(); {44937#true} is VALID [2018-11-23 11:53:27,603 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:27,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {44937#true} assume true; {44937#true} is VALID [2018-11-23 11:53:27,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44937#true} {44937#true} #79#return; {44937#true} is VALID [2018-11-23 11:53:27,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {44937#true} call #t~ret8 := main(); {44937#true} is VALID [2018-11-23 11:53:27,603 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:27,604 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:27,605 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {45001#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:27,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {45001#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {45001#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:27,606 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:27,606 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {44940#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44940#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:27,608 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:27,608 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {44941#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44941#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:27,609 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:27,610 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {44942#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44942#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:27,611 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:27,612 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {44943#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44943#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:27,613 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:27,613 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {44944#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44944#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:27,615 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:27,615 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {44945#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44945#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:27,616 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:27,617 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {44946#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44946#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:27,618 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:27,618 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {44947#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44947#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:27,619 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:27,620 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {44948#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44948#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:27,621 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:27,622 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {44949#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44949#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:27,623 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:27,623 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {44950#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44950#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:27,625 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:27,625 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {44951#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44951#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:27,626 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:27,627 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {44952#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44952#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:27,628 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:27,628 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {44953#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44953#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:27,630 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:27,630 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {44954#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44954#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:27,632 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:27,632 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,633 INFO L273 TraceCheckUtils]: 56: Hoare triple {44955#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44955#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:27,633 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:27,634 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {44956#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44956#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:27,635 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:27,636 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {44957#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44957#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:27,637 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:27,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,638 INFO L273 TraceCheckUtils]: 65: Hoare triple {44958#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44958#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:27,638 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:27,639 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {44959#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44959#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:27,640 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:27,641 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,641 INFO L273 TraceCheckUtils]: 71: Hoare triple {44960#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44960#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:27,642 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:27,642 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,643 INFO L273 TraceCheckUtils]: 74: Hoare triple {44961#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44961#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:27,644 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:27,644 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,645 INFO L273 TraceCheckUtils]: 77: Hoare triple {44962#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44962#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:27,645 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:27,646 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,646 INFO L273 TraceCheckUtils]: 80: Hoare triple {44963#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44963#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:27,647 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:27,648 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {44964#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44964#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:27,649 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:27,649 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {44965#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44965#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:27,650 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:27,651 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {44966#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44966#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:27,652 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:27,653 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,653 INFO L273 TraceCheckUtils]: 92: Hoare triple {44967#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44967#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:27,654 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:27,654 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,655 INFO L273 TraceCheckUtils]: 95: Hoare triple {44968#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44968#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:27,655 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:27,656 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,656 INFO L273 TraceCheckUtils]: 98: Hoare triple {44969#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44969#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:27,657 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:27,658 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,658 INFO L273 TraceCheckUtils]: 101: Hoare triple {44970#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44970#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:27,659 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:27,659 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,660 INFO L273 TraceCheckUtils]: 104: Hoare triple {44971#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44971#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:27,661 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:27,661 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,662 INFO L273 TraceCheckUtils]: 107: Hoare triple {44972#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44972#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:27,662 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:27,663 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {44973#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44973#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:27,664 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:27,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,665 INFO L273 TraceCheckUtils]: 113: Hoare triple {44974#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44974#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:27,666 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:27,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,667 INFO L273 TraceCheckUtils]: 116: Hoare triple {44975#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44975#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:27,667 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:27,668 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,668 INFO L273 TraceCheckUtils]: 119: Hoare triple {44976#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44976#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:27,669 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:27,670 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,670 INFO L273 TraceCheckUtils]: 122: Hoare triple {44977#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44977#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:27,671 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:27,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,672 INFO L273 TraceCheckUtils]: 125: Hoare triple {44978#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {44978#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:27,673 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:27,673 INFO L273 TraceCheckUtils]: 127: Hoare triple {44979#(<= main_~i~0 41)} assume !(~i~0 < 100000); {44938#false} is VALID [2018-11-23 11:53:27,674 INFO L273 TraceCheckUtils]: 128: Hoare triple {44938#false} assume !(0 != ~swapped~0); {44938#false} is VALID [2018-11-23 11:53:27,674 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:27,674 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:27,674 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:27,674 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:27,674 INFO L273 TraceCheckUtils]: 133: Hoare triple {44938#false} ~cond := #in~cond; {44938#false} is VALID [2018-11-23 11:53:27,675 INFO L273 TraceCheckUtils]: 134: Hoare triple {44938#false} assume 0 == ~cond; {44938#false} is VALID [2018-11-23 11:53:27,675 INFO L273 TraceCheckUtils]: 135: Hoare triple {44938#false} assume !false; {44938#false} is VALID [2018-11-23 11:53:27,687 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:27,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:27,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 11:53:27,707 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:53:27,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:27,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:53:27,853 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:27,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:53:27,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:53:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:53:27,855 INFO L87 Difference]: Start difference. First operand 261 states and 344 transitions. Second operand 44 states. [2018-11-23 11:53:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:29,069 INFO L93 Difference]: Finished difference Result 526 states and 698 transitions. [2018-11-23 11:53:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:53:29,069 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 136 [2018-11-23 11:53:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 213 transitions. [2018-11-23 11:53:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:53:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 213 transitions. [2018-11-23 11:53:29,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 213 transitions. [2018-11-23 11:53:29,358 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:29,363 INFO L225 Difference]: With dead ends: 526 [2018-11-23 11:53:29,363 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 11:53:29,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:53:29,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 11:53:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2018-11-23 11:53:29,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:29,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:29,558 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:29,558 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 267 states. [2018-11-23 11:53:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:29,565 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2018-11-23 11:53:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2018-11-23 11:53:29,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:29,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:29,566 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 271 states. [2018-11-23 11:53:29,566 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 271 states. [2018-11-23 11:53:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:29,571 INFO L93 Difference]: Finished difference Result 271 states and 358 transitions. [2018-11-23 11:53:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 358 transitions. [2018-11-23 11:53:29,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:29,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:29,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:29,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-23 11:53:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2018-11-23 11:53:29,579 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 136 [2018-11-23 11:53:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:29,579 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2018-11-23 11:53:29,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 11:53:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2018-11-23 11:53:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 11:53:29,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:29,581 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:29,581 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:29,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 807130248, now seen corresponding path program 41 times [2018-11-23 11:53:29,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:29,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:29,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:30,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {46996#true} call ULTIMATE.init(); {46996#true} is VALID [2018-11-23 11:53:30,983 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:30,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {46996#true} assume true; {46996#true} is VALID [2018-11-23 11:53:30,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46996#true} {46996#true} #79#return; {46996#true} is VALID [2018-11-23 11:53:30,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {46996#true} call #t~ret8 := main(); {46996#true} is VALID [2018-11-23 11:53:30,984 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:30,985 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:30,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46998#(= main_~i~0 1)} is VALID [2018-11-23 11:53:30,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {46998#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {46998#(= main_~i~0 1)} is VALID [2018-11-23 11:53:30,986 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:30,986 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:30,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {46999#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:30,987 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:30,988 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:30,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {47000#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:30,988 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:30,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:30,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {47001#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:30,990 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:30,990 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:30,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {47002#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:30,992 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:30,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:30,993 INFO L273 TraceCheckUtils]: 23: Hoare triple {47003#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:30,994 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:30,995 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:30,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:30,996 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:30,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:30,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:30,997 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:30,998 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:30,998 INFO L273 TraceCheckUtils]: 32: Hoare triple {47006#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:30,999 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:31,000 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {47007#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,001 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:31,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,002 INFO L273 TraceCheckUtils]: 38: Hoare triple {47008#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,003 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:31,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {47009#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,004 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:31,005 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {47010#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,006 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:31,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {47011#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,008 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:31,008 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,009 INFO L273 TraceCheckUtils]: 50: Hoare triple {47012#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,009 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:31,010 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,011 INFO L273 TraceCheckUtils]: 53: Hoare triple {47013#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,011 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:31,012 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {47014#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,013 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:31,014 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,014 INFO L273 TraceCheckUtils]: 59: Hoare triple {47015#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,015 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:31,015 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,016 INFO L273 TraceCheckUtils]: 62: Hoare triple {47016#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,016 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:31,017 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,017 INFO L273 TraceCheckUtils]: 65: Hoare triple {47017#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,018 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:31,018 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {47018#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,020 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:31,020 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,021 INFO L273 TraceCheckUtils]: 71: Hoare triple {47019#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,021 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:31,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,022 INFO L273 TraceCheckUtils]: 74: Hoare triple {47020#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,023 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:31,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,024 INFO L273 TraceCheckUtils]: 77: Hoare triple {47021#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,025 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:31,025 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,026 INFO L273 TraceCheckUtils]: 80: Hoare triple {47022#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,027 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:31,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,028 INFO L273 TraceCheckUtils]: 83: Hoare triple {47023#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,028 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:31,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,029 INFO L273 TraceCheckUtils]: 86: Hoare triple {47024#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,030 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:31,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,031 INFO L273 TraceCheckUtils]: 89: Hoare triple {47025#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,032 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:31,032 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,033 INFO L273 TraceCheckUtils]: 92: Hoare triple {47026#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,034 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:31,034 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,035 INFO L273 TraceCheckUtils]: 95: Hoare triple {47027#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,035 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:31,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,036 INFO L273 TraceCheckUtils]: 98: Hoare triple {47028#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,037 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:31,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,038 INFO L273 TraceCheckUtils]: 101: Hoare triple {47029#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,039 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:31,039 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,040 INFO L273 TraceCheckUtils]: 104: Hoare triple {47030#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,041 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:31,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,042 INFO L273 TraceCheckUtils]: 107: Hoare triple {47031#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,042 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:31,052 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,053 INFO L273 TraceCheckUtils]: 110: Hoare triple {47032#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,053 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:31,054 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,054 INFO L273 TraceCheckUtils]: 113: Hoare triple {47033#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,054 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:31,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,055 INFO L273 TraceCheckUtils]: 116: Hoare triple {47034#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,056 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:31,056 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,056 INFO L273 TraceCheckUtils]: 119: Hoare triple {47035#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,057 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:31,058 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,058 INFO L273 TraceCheckUtils]: 122: Hoare triple {47036#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,059 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:31,060 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,060 INFO L273 TraceCheckUtils]: 125: Hoare triple {47037#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,061 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:31,061 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,062 INFO L273 TraceCheckUtils]: 128: Hoare triple {47038#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,063 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:31,063 INFO L273 TraceCheckUtils]: 130: Hoare triple {47039#(<= main_~i~0 42)} assume !(~i~0 < 100000); {46997#false} is VALID [2018-11-23 11:53:31,063 INFO L273 TraceCheckUtils]: 131: Hoare triple {46997#false} assume !(0 != ~swapped~0); {46997#false} is VALID [2018-11-23 11:53:31,064 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:31,064 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:31,064 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:31,064 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:31,064 INFO L273 TraceCheckUtils]: 136: Hoare triple {46997#false} ~cond := #in~cond; {46997#false} is VALID [2018-11-23 11:53:31,064 INFO L273 TraceCheckUtils]: 137: Hoare triple {46997#false} assume 0 == ~cond; {46997#false} is VALID [2018-11-23 11:53:31,065 INFO L273 TraceCheckUtils]: 138: Hoare triple {46997#false} assume !false; {46997#false} is VALID [2018-11-23 11:53:31,077 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:31,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:31,077 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:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:31,263 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 11:53:31,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:31,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:31,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {46996#true} call ULTIMATE.init(); {46996#true} is VALID [2018-11-23 11:53:31,857 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:31,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {46996#true} assume true; {46996#true} is VALID [2018-11-23 11:53:31,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46996#true} {46996#true} #79#return; {46996#true} is VALID [2018-11-23 11:53:31,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {46996#true} call #t~ret8 := main(); {46996#true} is VALID [2018-11-23 11:53:31,858 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:31,858 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:31,859 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47061#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:31,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {47061#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47061#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:31,860 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:31,860 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:31,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {46999#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {46999#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:31,861 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:31,861 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:31,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {47000#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47000#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:31,862 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:31,862 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:31,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {47001#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47001#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:31,863 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:31,864 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:31,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {47002#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47002#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:31,865 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:31,866 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:31,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {47003#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47003#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:31,867 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:31,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:31,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {47004#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47004#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:31,869 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:31,869 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:31,870 INFO L273 TraceCheckUtils]: 29: Hoare triple {47005#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47005#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:31,870 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:31,871 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:31,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {47006#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47006#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:31,872 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:31,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {47007#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47007#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:31,874 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:31,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {47008#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47008#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:31,875 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:31,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,876 INFO L273 TraceCheckUtils]: 41: Hoare triple {47009#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47009#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:31,877 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:31,877 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {47010#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47010#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:31,879 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:31,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {47011#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47011#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:31,880 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:31,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {47012#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47012#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:31,882 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:31,883 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {47013#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47013#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:31,884 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:31,884 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {47014#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47014#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:31,886 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:31,886 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {47015#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47015#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:31,887 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:31,888 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {47016#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47016#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:31,889 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:31,889 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {47017#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47017#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:31,891 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:31,891 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {47018#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47018#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:31,892 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:31,893 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {47019#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47019#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:31,894 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:31,895 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,895 INFO L273 TraceCheckUtils]: 74: Hoare triple {47020#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47020#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:31,896 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:31,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,897 INFO L273 TraceCheckUtils]: 77: Hoare triple {47021#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47021#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:31,898 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:31,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,899 INFO L273 TraceCheckUtils]: 80: Hoare triple {47022#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47022#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:31,899 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:31,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,900 INFO L273 TraceCheckUtils]: 83: Hoare triple {47023#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47023#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:31,901 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:31,901 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {47024#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47024#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:31,902 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:31,903 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {47025#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47025#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:31,904 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:31,905 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,905 INFO L273 TraceCheckUtils]: 92: Hoare triple {47026#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47026#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:31,906 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:31,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,907 INFO L273 TraceCheckUtils]: 95: Hoare triple {47027#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47027#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:31,908 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:31,908 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,909 INFO L273 TraceCheckUtils]: 98: Hoare triple {47028#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47028#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:31,909 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:31,910 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,910 INFO L273 TraceCheckUtils]: 101: Hoare triple {47029#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47029#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:31,911 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:31,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,912 INFO L273 TraceCheckUtils]: 104: Hoare triple {47030#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47030#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:31,913 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:31,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,914 INFO L273 TraceCheckUtils]: 107: Hoare triple {47031#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47031#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:31,915 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:31,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,916 INFO L273 TraceCheckUtils]: 110: Hoare triple {47032#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47032#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:31,917 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:31,917 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {47033#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47033#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:31,918 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:31,919 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,919 INFO L273 TraceCheckUtils]: 116: Hoare triple {47034#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47034#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:31,920 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:31,920 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,921 INFO L273 TraceCheckUtils]: 119: Hoare triple {47035#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47035#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:31,922 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:31,922 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,923 INFO L273 TraceCheckUtils]: 122: Hoare triple {47036#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47036#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:31,923 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:31,924 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,924 INFO L273 TraceCheckUtils]: 125: Hoare triple {47037#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47037#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:31,925 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:31,925 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,926 INFO L273 TraceCheckUtils]: 128: Hoare triple {47038#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {47038#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:31,927 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:31,927 INFO L273 TraceCheckUtils]: 130: Hoare triple {47039#(<= main_~i~0 42)} assume !(~i~0 < 100000); {46997#false} is VALID [2018-11-23 11:53:31,928 INFO L273 TraceCheckUtils]: 131: Hoare triple {46997#false} assume !(0 != ~swapped~0); {46997#false} is VALID [2018-11-23 11:53:31,928 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:31,928 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:31,928 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:31,928 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:31,928 INFO L273 TraceCheckUtils]: 136: Hoare triple {46997#false} ~cond := #in~cond; {46997#false} is VALID [2018-11-23 11:53:31,929 INFO L273 TraceCheckUtils]: 137: Hoare triple {46997#false} assume 0 == ~cond; {46997#false} is VALID [2018-11-23 11:53:31,929 INFO L273 TraceCheckUtils]: 138: Hoare triple {46997#false} assume !false; {46997#false} is VALID [2018-11-23 11:53:31,942 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:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:31,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 11:53:31,961 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 11:53:31,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:31,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 11:53:32,108 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:32,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 11:53:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 11:53:32,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:53:32,110 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand 45 states. [2018-11-23 11:53:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,337 INFO L93 Difference]: Finished difference Result 538 states and 714 transitions. [2018-11-23 11:53:33,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 11:53:33,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-11-23 11:53:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:53:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 217 transitions. [2018-11-23 11:53:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:53:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 217 transitions. [2018-11-23 11:53:33,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 217 transitions. [2018-11-23 11:53:33,580 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:33,585 INFO L225 Difference]: With dead ends: 538 [2018-11-23 11:53:33,586 INFO L226 Difference]: Without dead ends: 277 [2018-11-23 11:53:33,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 11:53:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-23 11:53:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2018-11-23 11:53:33,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:33,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:33,728 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:33,728 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 273 states. [2018-11-23 11:53:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,734 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2018-11-23 11:53:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2018-11-23 11:53:33,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,735 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 277 states. [2018-11-23 11:53:33,735 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 277 states. [2018-11-23 11:53:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:33,739 INFO L93 Difference]: Finished difference Result 277 states and 366 transitions. [2018-11-23 11:53:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2018-11-23 11:53:33,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:33,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:33,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:33,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-23 11:53:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 360 transitions. [2018-11-23 11:53:33,744 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 360 transitions. Word has length 139 [2018-11-23 11:53:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:33,744 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 360 transitions. [2018-11-23 11:53:33,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 11:53:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 360 transitions. [2018-11-23 11:53:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-23 11:53:33,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:33,745 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:33,745 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:33,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash 702954993, now seen corresponding path program 42 times [2018-11-23 11:53:33,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:33,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:33,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:34,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {49101#true} call ULTIMATE.init(); {49101#true} is VALID [2018-11-23 11:53:34,851 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:34,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {49101#true} assume true; {49101#true} is VALID [2018-11-23 11:53:34,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49101#true} {49101#true} #79#return; {49101#true} is VALID [2018-11-23 11:53:34,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {49101#true} call #t~ret8 := main(); {49101#true} is VALID [2018-11-23 11:53:34,851 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:34,853 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:34,853 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49103#(= main_~i~0 1)} is VALID [2018-11-23 11:53:34,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {49103#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49103#(= main_~i~0 1)} is VALID [2018-11-23 11:53:34,854 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:34,854 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:34,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {49104#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:34,855 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:34,855 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:34,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {49105#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:34,856 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:34,857 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:34,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {49106#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:34,858 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:34,858 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:34,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {49107#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:34,859 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:34,860 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:34,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {49108#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:34,861 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:34,862 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:34,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {49109#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:34,863 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:34,863 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:34,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {49110#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:34,865 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:34,865 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:34,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {49111#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:34,866 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:34,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:34,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {49112#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:34,868 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:34,869 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:34,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {49113#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:34,870 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:34,871 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:34,871 INFO L273 TraceCheckUtils]: 41: Hoare triple {49114#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:34,872 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:34,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:34,873 INFO L273 TraceCheckUtils]: 44: Hoare triple {49115#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:34,874 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:34,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:34,875 INFO L273 TraceCheckUtils]: 47: Hoare triple {49116#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:34,875 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:34,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:34,876 INFO L273 TraceCheckUtils]: 50: Hoare triple {49117#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:34,877 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:34,878 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:34,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {49118#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:34,879 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:34,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:34,880 INFO L273 TraceCheckUtils]: 56: Hoare triple {49119#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:34,880 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:34,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:34,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {49120#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:34,882 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:34,883 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:34,883 INFO L273 TraceCheckUtils]: 62: Hoare triple {49121#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:34,884 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:34,884 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:34,885 INFO L273 TraceCheckUtils]: 65: Hoare triple {49122#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:34,886 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:34,886 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:34,887 INFO L273 TraceCheckUtils]: 68: Hoare triple {49123#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:34,887 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:34,888 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:34,888 INFO L273 TraceCheckUtils]: 71: Hoare triple {49124#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:34,889 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:34,890 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:34,890 INFO L273 TraceCheckUtils]: 74: Hoare triple {49125#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:34,891 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:34,891 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:34,892 INFO L273 TraceCheckUtils]: 77: Hoare triple {49126#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:34,892 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:34,893 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:34,893 INFO L273 TraceCheckUtils]: 80: Hoare triple {49127#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:34,894 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:34,895 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:34,895 INFO L273 TraceCheckUtils]: 83: Hoare triple {49128#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:34,896 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:34,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:34,897 INFO L273 TraceCheckUtils]: 86: Hoare triple {49129#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:34,898 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:34,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:34,899 INFO L273 TraceCheckUtils]: 89: Hoare triple {49130#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:34,899 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:34,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:34,901 INFO L273 TraceCheckUtils]: 92: Hoare triple {49131#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:34,901 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:34,902 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:34,902 INFO L273 TraceCheckUtils]: 95: Hoare triple {49132#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:34,903 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:34,904 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:34,904 INFO L273 TraceCheckUtils]: 98: Hoare triple {49133#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:34,905 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:34,906 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:34,906 INFO L273 TraceCheckUtils]: 101: Hoare triple {49134#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:34,907 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:34,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:34,908 INFO L273 TraceCheckUtils]: 104: Hoare triple {49135#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:34,909 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:34,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:34,910 INFO L273 TraceCheckUtils]: 107: Hoare triple {49136#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:34,910 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:34,911 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:34,911 INFO L273 TraceCheckUtils]: 110: Hoare triple {49137#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:34,912 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:34,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:34,913 INFO L273 TraceCheckUtils]: 113: Hoare triple {49138#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:34,914 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:34,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:34,915 INFO L273 TraceCheckUtils]: 116: Hoare triple {49139#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:34,915 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:34,916 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:34,916 INFO L273 TraceCheckUtils]: 119: Hoare triple {49140#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:34,917 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:34,917 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:34,918 INFO L273 TraceCheckUtils]: 122: Hoare triple {49141#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:34,919 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:34,919 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:34,920 INFO L273 TraceCheckUtils]: 125: Hoare triple {49142#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:34,920 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:34,921 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:34,921 INFO L273 TraceCheckUtils]: 128: Hoare triple {49143#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:34,922 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:34,922 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:34,923 INFO L273 TraceCheckUtils]: 131: Hoare triple {49144#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:34,924 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:34,924 INFO L273 TraceCheckUtils]: 133: Hoare triple {49145#(<= main_~i~0 43)} assume !(~i~0 < 100000); {49102#false} is VALID [2018-11-23 11:53:34,925 INFO L273 TraceCheckUtils]: 134: Hoare triple {49102#false} assume !(0 != ~swapped~0); {49102#false} is VALID [2018-11-23 11:53:34,925 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:34,925 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:34,925 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:34,925 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:34,925 INFO L273 TraceCheckUtils]: 139: Hoare triple {49102#false} ~cond := #in~cond; {49102#false} is VALID [2018-11-23 11:53:34,926 INFO L273 TraceCheckUtils]: 140: Hoare triple {49102#false} assume 0 == ~cond; {49102#false} is VALID [2018-11-23 11:53:34,926 INFO L273 TraceCheckUtils]: 141: Hoare triple {49102#false} assume !false; {49102#false} is VALID [2018-11-23 11:53:34,939 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:34,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:34,939 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:34,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:53:35,112 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-11-23 11:53:35,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:35,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:35,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {49101#true} call ULTIMATE.init(); {49101#true} is VALID [2018-11-23 11:53:35,717 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:35,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {49101#true} assume true; {49101#true} is VALID [2018-11-23 11:53:35,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49101#true} {49101#true} #79#return; {49101#true} is VALID [2018-11-23 11:53:35,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {49101#true} call #t~ret8 := main(); {49101#true} is VALID [2018-11-23 11:53:35,718 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:35,718 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:35,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49167#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:35,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {49167#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49167#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:35,719 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:35,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:35,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {49104#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49104#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:35,720 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:35,721 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:35,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {49105#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49105#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:35,722 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:35,723 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:35,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {49106#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49106#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:35,724 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:35,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:35,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {49107#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49107#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:35,725 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:35,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:35,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {49108#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49108#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:35,727 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:35,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:35,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {49109#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49109#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:35,729 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:35,729 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:35,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {49110#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49110#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:35,731 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:35,731 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:35,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {49111#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49111#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:35,734 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:35,735 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:35,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {49112#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49112#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:35,736 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:35,736 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:35,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {49113#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49113#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:35,737 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:35,737 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:35,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {49114#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49114#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:35,738 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:35,739 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:35,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {49115#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49115#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:35,740 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:35,741 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:35,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {49116#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49116#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:35,742 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:35,743 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:35,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {49117#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49117#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:35,744 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:35,744 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:35,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {49118#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49118#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:35,746 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:35,746 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:35,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {49119#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49119#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:35,748 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:35,748 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:35,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {49120#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49120#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:35,749 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:35,750 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:35,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {49121#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49121#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:35,751 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:35,752 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:35,752 INFO L273 TraceCheckUtils]: 65: Hoare triple {49122#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49122#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:35,753 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:35,754 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:35,754 INFO L273 TraceCheckUtils]: 68: Hoare triple {49123#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49123#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:35,755 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:35,755 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:35,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {49124#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49124#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:35,757 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:35,757 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:35,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {49125#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49125#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:35,758 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:35,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:35,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {49126#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49126#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:35,760 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:35,761 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:35,761 INFO L273 TraceCheckUtils]: 80: Hoare triple {49127#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49127#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:35,762 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:35,763 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:35,763 INFO L273 TraceCheckUtils]: 83: Hoare triple {49128#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49128#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:35,764 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:35,764 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:35,765 INFO L273 TraceCheckUtils]: 86: Hoare triple {49129#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49129#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:35,765 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:35,766 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:35,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {49130#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49130#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:35,767 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:35,768 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:35,768 INFO L273 TraceCheckUtils]: 92: Hoare triple {49131#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49131#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:35,769 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:35,770 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:35,770 INFO L273 TraceCheckUtils]: 95: Hoare triple {49132#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49132#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:35,771 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:35,771 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:35,772 INFO L273 TraceCheckUtils]: 98: Hoare triple {49133#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49133#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:35,773 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:35,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:35,774 INFO L273 TraceCheckUtils]: 101: Hoare triple {49134#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49134#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:35,774 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:35,775 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:35,775 INFO L273 TraceCheckUtils]: 104: Hoare triple {49135#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49135#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:35,776 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:35,777 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:35,777 INFO L273 TraceCheckUtils]: 107: Hoare triple {49136#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49136#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:35,778 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:35,778 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:35,779 INFO L273 TraceCheckUtils]: 110: Hoare triple {49137#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49137#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:35,780 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:35,780 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:35,781 INFO L273 TraceCheckUtils]: 113: Hoare triple {49138#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49138#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:35,782 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:35,782 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:35,783 INFO L273 TraceCheckUtils]: 116: Hoare triple {49139#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49139#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:35,784 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:35,784 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:35,784 INFO L273 TraceCheckUtils]: 119: Hoare triple {49140#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49140#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:35,785 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:35,786 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:35,786 INFO L273 TraceCheckUtils]: 122: Hoare triple {49141#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49141#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:35,787 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:35,788 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:35,788 INFO L273 TraceCheckUtils]: 125: Hoare triple {49142#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49142#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:35,789 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:35,789 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:35,790 INFO L273 TraceCheckUtils]: 128: Hoare triple {49143#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49143#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:35,790 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:35,791 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:35,791 INFO L273 TraceCheckUtils]: 131: Hoare triple {49144#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {49144#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:35,792 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:35,793 INFO L273 TraceCheckUtils]: 133: Hoare triple {49145#(<= main_~i~0 43)} assume !(~i~0 < 100000); {49102#false} is VALID [2018-11-23 11:53:35,793 INFO L273 TraceCheckUtils]: 134: Hoare triple {49102#false} assume !(0 != ~swapped~0); {49102#false} is VALID [2018-11-23 11:53:35,793 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:35,793 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:35,793 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:35,794 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:35,794 INFO L273 TraceCheckUtils]: 139: Hoare triple {49102#false} ~cond := #in~cond; {49102#false} is VALID [2018-11-23 11:53:35,794 INFO L273 TraceCheckUtils]: 140: Hoare triple {49102#false} assume 0 == ~cond; {49102#false} is VALID [2018-11-23 11:53:35,794 INFO L273 TraceCheckUtils]: 141: Hoare triple {49102#false} assume !false; {49102#false} is VALID [2018-11-23 11:53:35,807 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:35,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 11:53:35,827 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 11:53:35,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:35,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 11:53:35,979 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:35,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 11:53:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 11:53:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:53:35,981 INFO L87 Difference]: Start difference. First operand 273 states and 360 transitions. Second operand 46 states. [2018-11-23 11:53:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,279 INFO L93 Difference]: Finished difference Result 550 states and 730 transitions. [2018-11-23 11:53:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 11:53:37,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 142 [2018-11-23 11:53:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:53:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 221 transitions. [2018-11-23 11:53:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:53:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 221 transitions. [2018-11-23 11:53:37,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 221 transitions. [2018-11-23 11:53:37,515 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:37,521 INFO L225 Difference]: With dead ends: 550 [2018-11-23 11:53:37,522 INFO L226 Difference]: Without dead ends: 283 [2018-11-23 11:53:37,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 11:53:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-23 11:53:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2018-11-23 11:53:37,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:37,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:37,712 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:37,712 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 279 states. [2018-11-23 11:53:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,718 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2018-11-23 11:53:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2018-11-23 11:53:37,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,719 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand 283 states. [2018-11-23 11:53:37,719 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 283 states. [2018-11-23 11:53:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:37,723 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2018-11-23 11:53:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2018-11-23 11:53:37,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:37,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:37,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:37,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-23 11:53:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 368 transitions. [2018-11-23 11:53:37,729 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 368 transitions. Word has length 142 [2018-11-23 11:53:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:37,729 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 368 transitions. [2018-11-23 11:53:37,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 11:53:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 368 transitions. [2018-11-23 11:53:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 11:53:37,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:37,730 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:37,730 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:37,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1815679000, now seen corresponding path program 43 times [2018-11-23 11:53:37,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:37,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:37,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:37,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:38,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {51252#true} call ULTIMATE.init(); {51252#true} is VALID [2018-11-23 11:53:38,977 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:38,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {51252#true} assume true; {51252#true} is VALID [2018-11-23 11:53:38,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51252#true} {51252#true} #79#return; {51252#true} is VALID [2018-11-23 11:53:38,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {51252#true} call #t~ret8 := main(); {51252#true} is VALID [2018-11-23 11:53:38,978 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:38,979 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:38,979 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51254#(= main_~i~0 1)} is VALID [2018-11-23 11:53:38,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {51254#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51254#(= main_~i~0 1)} is VALID [2018-11-23 11:53:38,981 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:38,981 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {51255#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:38,983 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:38,983 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {51256#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:38,985 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:38,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {51257#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:38,987 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:38,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {51258#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:38,989 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:38,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {51259#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:38,990 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:38,991 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {51260#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:38,992 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:38,993 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {51261#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:38,994 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:38,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {51262#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:38,996 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:38,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {51263#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:38,998 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:38,998 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:38,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {51264#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:39,000 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:39,000 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:39,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {51265#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:39,002 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:39,002 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:39,003 INFO L273 TraceCheckUtils]: 44: Hoare triple {51266#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:39,003 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:39,004 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:39,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {51267#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:39,005 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:39,006 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:39,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {51268#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:39,007 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:39,008 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:39,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {51269#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:39,009 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:39,010 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:39,010 INFO L273 TraceCheckUtils]: 56: Hoare triple {51270#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:39,011 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:39,011 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:39,012 INFO L273 TraceCheckUtils]: 59: Hoare triple {51271#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:39,013 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:39,013 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:39,014 INFO L273 TraceCheckUtils]: 62: Hoare triple {51272#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:39,014 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:39,015 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:39,016 INFO L273 TraceCheckUtils]: 65: Hoare triple {51273#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:39,016 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:39,017 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:39,017 INFO L273 TraceCheckUtils]: 68: Hoare triple {51274#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:39,018 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:39,019 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:39,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {51275#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:39,020 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:39,021 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:39,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {51276#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:39,022 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:39,023 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:39,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {51277#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:39,024 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:39,025 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:39,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {51278#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:39,026 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:39,026 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:39,027 INFO L273 TraceCheckUtils]: 83: Hoare triple {51279#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:39,028 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:39,028 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:39,029 INFO L273 TraceCheckUtils]: 86: Hoare triple {51280#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:39,030 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:39,030 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:39,031 INFO L273 TraceCheckUtils]: 89: Hoare triple {51281#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:39,032 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:39,032 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:39,033 INFO L273 TraceCheckUtils]: 92: Hoare triple {51282#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:39,033 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:39,034 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:39,034 INFO L273 TraceCheckUtils]: 95: Hoare triple {51283#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:39,035 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:39,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,036 INFO L273 TraceCheckUtils]: 98: Hoare triple {51284#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,037 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:39,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,038 INFO L273 TraceCheckUtils]: 101: Hoare triple {51285#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,039 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:39,040 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,040 INFO L273 TraceCheckUtils]: 104: Hoare triple {51286#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,041 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:39,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,042 INFO L273 TraceCheckUtils]: 107: Hoare triple {51287#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,043 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:39,044 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {51288#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,045 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:39,046 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {51289#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,047 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:39,047 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,048 INFO L273 TraceCheckUtils]: 116: Hoare triple {51290#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,049 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:39,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,050 INFO L273 TraceCheckUtils]: 119: Hoare triple {51291#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,051 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:39,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,052 INFO L273 TraceCheckUtils]: 122: Hoare triple {51292#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,053 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:39,053 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,054 INFO L273 TraceCheckUtils]: 125: Hoare triple {51293#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,054 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:39,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,056 INFO L273 TraceCheckUtils]: 128: Hoare triple {51294#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,056 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:39,057 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,057 INFO L273 TraceCheckUtils]: 131: Hoare triple {51295#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,058 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:39,059 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,059 INFO L273 TraceCheckUtils]: 134: Hoare triple {51296#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,060 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:39,061 INFO L273 TraceCheckUtils]: 136: Hoare triple {51297#(<= main_~i~0 44)} assume !(~i~0 < 100000); {51253#false} is VALID [2018-11-23 11:53:39,061 INFO L273 TraceCheckUtils]: 137: Hoare triple {51253#false} assume !(0 != ~swapped~0); {51253#false} is VALID [2018-11-23 11:53:39,061 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:39,061 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:39,061 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:39,062 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:39,062 INFO L273 TraceCheckUtils]: 142: Hoare triple {51253#false} ~cond := #in~cond; {51253#false} is VALID [2018-11-23 11:53:39,062 INFO L273 TraceCheckUtils]: 143: Hoare triple {51253#false} assume 0 == ~cond; {51253#false} is VALID [2018-11-23 11:53:39,062 INFO L273 TraceCheckUtils]: 144: Hoare triple {51253#false} assume !false; {51253#false} is VALID [2018-11-23 11:53:39,076 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:39,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:39,076 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:39,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:39,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:39,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {51252#true} call ULTIMATE.init(); {51252#true} is VALID [2018-11-23 11:53:39,639 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:39,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {51252#true} assume true; {51252#true} is VALID [2018-11-23 11:53:39,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {51252#true} {51252#true} #79#return; {51252#true} is VALID [2018-11-23 11:53:39,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {51252#true} call #t~ret8 := main(); {51252#true} is VALID [2018-11-23 11:53:39,640 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:39,640 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:39,641 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51319#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:39,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {51319#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51319#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:39,642 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:39,642 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:39,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {51255#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51255#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:39,643 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:39,643 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:39,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {51256#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51256#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:39,644 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:39,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:39,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {51257#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51257#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:39,646 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:39,647 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:39,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {51258#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51258#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:39,648 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:39,648 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:39,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {51259#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51259#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:39,649 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:39,650 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:39,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {51260#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51260#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:39,651 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:39,652 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:39,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {51261#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51261#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:39,653 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:39,654 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:39,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {51262#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51262#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:39,655 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:39,655 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:39,656 INFO L273 TraceCheckUtils]: 35: Hoare triple {51263#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51263#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:39,656 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:39,657 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:39,657 INFO L273 TraceCheckUtils]: 38: Hoare triple {51264#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51264#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:39,658 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:39,659 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:39,659 INFO L273 TraceCheckUtils]: 41: Hoare triple {51265#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51265#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:39,660 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:39,660 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:39,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {51266#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51266#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:39,661 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:39,662 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:39,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {51267#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51267#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:39,663 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:39,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:39,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {51268#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51268#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:39,665 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:39,665 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:39,666 INFO L273 TraceCheckUtils]: 53: Hoare triple {51269#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51269#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:39,667 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:39,667 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:39,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {51270#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51270#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:39,668 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:39,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:39,669 INFO L273 TraceCheckUtils]: 59: Hoare triple {51271#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51271#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:39,670 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:39,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:39,671 INFO L273 TraceCheckUtils]: 62: Hoare triple {51272#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51272#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:39,672 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:39,672 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:39,673 INFO L273 TraceCheckUtils]: 65: Hoare triple {51273#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51273#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:39,673 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:39,674 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:39,674 INFO L273 TraceCheckUtils]: 68: Hoare triple {51274#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51274#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:39,675 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:39,676 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:39,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {51275#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51275#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:39,677 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:39,677 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:39,678 INFO L273 TraceCheckUtils]: 74: Hoare triple {51276#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51276#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:39,679 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:39,679 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:39,680 INFO L273 TraceCheckUtils]: 77: Hoare triple {51277#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51277#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:39,680 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:39,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:39,681 INFO L273 TraceCheckUtils]: 80: Hoare triple {51278#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51278#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:39,682 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:39,683 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:39,683 INFO L273 TraceCheckUtils]: 83: Hoare triple {51279#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51279#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:39,684 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:39,684 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:39,685 INFO L273 TraceCheckUtils]: 86: Hoare triple {51280#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51280#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:39,685 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:39,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:39,687 INFO L273 TraceCheckUtils]: 89: Hoare triple {51281#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51281#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:39,687 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:39,688 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:39,688 INFO L273 TraceCheckUtils]: 92: Hoare triple {51282#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51282#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:39,689 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:39,689 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:39,690 INFO L273 TraceCheckUtils]: 95: Hoare triple {51283#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51283#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:39,691 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:39,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,692 INFO L273 TraceCheckUtils]: 98: Hoare triple {51284#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51284#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:39,692 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:39,693 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,693 INFO L273 TraceCheckUtils]: 101: Hoare triple {51285#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51285#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:39,694 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:39,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,695 INFO L273 TraceCheckUtils]: 104: Hoare triple {51286#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51286#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:39,696 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:39,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,697 INFO L273 TraceCheckUtils]: 107: Hoare triple {51287#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51287#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:39,697 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:39,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,698 INFO L273 TraceCheckUtils]: 110: Hoare triple {51288#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51288#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:39,699 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:39,700 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,700 INFO L273 TraceCheckUtils]: 113: Hoare triple {51289#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51289#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:39,701 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:39,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,702 INFO L273 TraceCheckUtils]: 116: Hoare triple {51290#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51290#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:39,703 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:39,703 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,704 INFO L273 TraceCheckUtils]: 119: Hoare triple {51291#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51291#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:39,704 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:39,705 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,705 INFO L273 TraceCheckUtils]: 122: Hoare triple {51292#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51292#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:39,706 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:39,707 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,707 INFO L273 TraceCheckUtils]: 125: Hoare triple {51293#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51293#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:39,708 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:39,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,709 INFO L273 TraceCheckUtils]: 128: Hoare triple {51294#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51294#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:39,710 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:39,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,711 INFO L273 TraceCheckUtils]: 131: Hoare triple {51295#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51295#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:39,711 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:39,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,712 INFO L273 TraceCheckUtils]: 134: Hoare triple {51296#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {51296#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:39,713 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:39,714 INFO L273 TraceCheckUtils]: 136: Hoare triple {51297#(<= main_~i~0 44)} assume !(~i~0 < 100000); {51253#false} is VALID [2018-11-23 11:53:39,714 INFO L273 TraceCheckUtils]: 137: Hoare triple {51253#false} assume !(0 != ~swapped~0); {51253#false} is VALID [2018-11-23 11:53:39,714 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:39,714 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:39,715 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:39,715 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:39,715 INFO L273 TraceCheckUtils]: 142: Hoare triple {51253#false} ~cond := #in~cond; {51253#false} is VALID [2018-11-23 11:53:39,715 INFO L273 TraceCheckUtils]: 143: Hoare triple {51253#false} assume 0 == ~cond; {51253#false} is VALID [2018-11-23 11:53:39,715 INFO L273 TraceCheckUtils]: 144: Hoare triple {51253#false} assume !false; {51253#false} is VALID [2018-11-23 11:53:39,730 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:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 11:53:39,750 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 11:53:39,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:39,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 11:53:39,909 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:39,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 11:53:39,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 11:53:39,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:53:39,911 INFO L87 Difference]: Start difference. First operand 279 states and 368 transitions. Second operand 47 states. [2018-11-23 11:53:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,223 INFO L93 Difference]: Finished difference Result 562 states and 746 transitions. [2018-11-23 11:53:41,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 11:53:41,223 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-11-23 11:53:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:53:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 225 transitions. [2018-11-23 11:53:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:53:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 225 transitions. [2018-11-23 11:53:41,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 225 transitions. [2018-11-23 11:53:41,471 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:41,476 INFO L225 Difference]: With dead ends: 562 [2018-11-23 11:53:41,476 INFO L226 Difference]: Without dead ends: 289 [2018-11-23 11:53:41,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 11:53:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-23 11:53:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-11-23 11:53:41,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:41,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:41,610 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:41,610 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 285 states. [2018-11-23 11:53:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,617 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2018-11-23 11:53:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2018-11-23 11:53:41,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,617 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 289 states. [2018-11-23 11:53:41,617 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 289 states. [2018-11-23 11:53:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:41,622 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2018-11-23 11:53:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2018-11-23 11:53:41,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:41,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:41,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:41,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-23 11:53:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 376 transitions. [2018-11-23 11:53:41,627 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 376 transitions. Word has length 145 [2018-11-23 11:53:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:41,627 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 376 transitions. [2018-11-23 11:53:41,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 11:53:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 376 transitions. [2018-11-23 11:53:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 11:53:41,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:41,628 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:41,628 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:41,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1362303343, now seen corresponding path program 44 times [2018-11-23 11:53:41,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:41,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:53:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:42,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {53449#true} call ULTIMATE.init(); {53449#true} is VALID [2018-11-23 11:53:42,942 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:42,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {53449#true} assume true; {53449#true} is VALID [2018-11-23 11:53:42,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53449#true} {53449#true} #79#return; {53449#true} is VALID [2018-11-23 11:53:42,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {53449#true} call #t~ret8 := main(); {53449#true} is VALID [2018-11-23 11:53:42,943 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:42,944 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:42,944 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53451#(= main_~i~0 1)} is VALID [2018-11-23 11:53:42,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {53451#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53451#(= main_~i~0 1)} is VALID [2018-11-23 11:53:42,946 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:42,946 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {53452#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:42,947 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:42,947 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {53453#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:42,948 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:42,948 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {53454#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:42,950 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:42,950 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {53455#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:42,951 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:42,952 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {53456#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:42,953 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:42,953 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {53457#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:42,954 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:42,955 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:42,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {53458#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:42,956 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:42,957 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:42,957 INFO L273 TraceCheckUtils]: 32: Hoare triple {53459#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:42,958 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:42,958 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:42,959 INFO L273 TraceCheckUtils]: 35: Hoare triple {53460#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:42,960 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:42,960 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:42,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {53461#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:42,961 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:42,962 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:42,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {53462#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:42,963 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:42,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:42,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {53463#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:42,965 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:42,965 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:42,966 INFO L273 TraceCheckUtils]: 47: Hoare triple {53464#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:42,966 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:42,967 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:42,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {53465#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:42,968 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:42,968 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:42,969 INFO L273 TraceCheckUtils]: 53: Hoare triple {53466#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:42,970 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:42,970 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:42,971 INFO L273 TraceCheckUtils]: 56: Hoare triple {53467#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:42,971 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:42,972 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:42,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {53468#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:42,973 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:42,974 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:42,974 INFO L273 TraceCheckUtils]: 62: Hoare triple {53469#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:42,975 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:42,975 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:42,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {53470#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:42,976 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:42,977 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:42,978 INFO L273 TraceCheckUtils]: 68: Hoare triple {53471#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:42,978 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:42,979 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:42,979 INFO L273 TraceCheckUtils]: 71: Hoare triple {53472#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:42,980 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:42,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:42,981 INFO L273 TraceCheckUtils]: 74: Hoare triple {53473#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:42,982 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:42,982 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:42,983 INFO L273 TraceCheckUtils]: 77: Hoare triple {53474#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:42,983 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:42,984 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:42,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {53475#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:42,985 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:42,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:42,986 INFO L273 TraceCheckUtils]: 83: Hoare triple {53476#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:42,987 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:42,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:42,988 INFO L273 TraceCheckUtils]: 86: Hoare triple {53477#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:42,988 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:42,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:42,989 INFO L273 TraceCheckUtils]: 89: Hoare triple {53478#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:42,990 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:42,991 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:42,991 INFO L273 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:42,992 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:42,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:42,993 INFO L273 TraceCheckUtils]: 95: Hoare triple {53480#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:42,993 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:42,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:42,995 INFO L273 TraceCheckUtils]: 98: Hoare triple {53481#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:42,995 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:42,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:42,996 INFO L273 TraceCheckUtils]: 101: Hoare triple {53482#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:42,997 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:42,997 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:42,998 INFO L273 TraceCheckUtils]: 104: Hoare triple {53483#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:42,999 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:42,999 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,000 INFO L273 TraceCheckUtils]: 107: Hoare triple {53484#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,000 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:43,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,001 INFO L273 TraceCheckUtils]: 110: Hoare triple {53485#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,002 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:43,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,003 INFO L273 TraceCheckUtils]: 113: Hoare triple {53486#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,004 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:43,004 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,005 INFO L273 TraceCheckUtils]: 116: Hoare triple {53487#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,005 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:43,006 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,006 INFO L273 TraceCheckUtils]: 119: Hoare triple {53488#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,007 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:43,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,008 INFO L273 TraceCheckUtils]: 122: Hoare triple {53489#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,009 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:43,009 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,010 INFO L273 TraceCheckUtils]: 125: Hoare triple {53490#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,010 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:43,011 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,011 INFO L273 TraceCheckUtils]: 128: Hoare triple {53491#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,012 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:43,013 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,013 INFO L273 TraceCheckUtils]: 131: Hoare triple {53492#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,014 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:43,014 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,015 INFO L273 TraceCheckUtils]: 134: Hoare triple {53493#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,016 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:43,016 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,017 INFO L273 TraceCheckUtils]: 137: Hoare triple {53494#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,017 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:43,018 INFO L273 TraceCheckUtils]: 139: Hoare triple {53495#(<= main_~i~0 45)} assume !(~i~0 < 100000); {53450#false} is VALID [2018-11-23 11:53:43,018 INFO L273 TraceCheckUtils]: 140: Hoare triple {53450#false} assume !(0 != ~swapped~0); {53450#false} is VALID [2018-11-23 11:53:43,018 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:43,019 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:43,019 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:43,019 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:43,019 INFO L273 TraceCheckUtils]: 145: Hoare triple {53450#false} ~cond := #in~cond; {53450#false} is VALID [2018-11-23 11:53:43,019 INFO L273 TraceCheckUtils]: 146: Hoare triple {53450#false} assume 0 == ~cond; {53450#false} is VALID [2018-11-23 11:53:43,019 INFO L273 TraceCheckUtils]: 147: Hoare triple {53450#false} assume !false; {53450#false} is VALID [2018-11-23 11:53:43,033 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:43,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:43,033 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:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:53:43,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:53:43,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:43,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:43,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {53449#true} call ULTIMATE.init(); {53449#true} is VALID [2018-11-23 11:53:43,562 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:43,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {53449#true} assume true; {53449#true} is VALID [2018-11-23 11:53:43,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53449#true} {53449#true} #79#return; {53449#true} is VALID [2018-11-23 11:53:43,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {53449#true} call #t~ret8 := main(); {53449#true} is VALID [2018-11-23 11:53:43,563 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:43,564 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:43,564 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53517#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:43,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {53517#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53517#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:43,566 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:43,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:43,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {53452#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53452#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:43,568 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:43,568 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:43,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {53453#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53453#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:43,570 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:43,570 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:43,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {53454#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53454#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:43,571 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:43,572 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:43,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {53455#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53455#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:43,573 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:43,574 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:43,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {53456#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53456#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:43,576 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:43,576 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:43,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {53457#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53457#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:43,577 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:43,578 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:43,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {53458#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53458#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:43,579 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:43,580 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:43,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {53459#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53459#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:43,581 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:43,582 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:43,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {53460#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53460#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:43,583 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:43,583 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:43,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {53461#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53461#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:43,585 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:43,585 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:43,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {53462#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53462#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:43,586 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:43,587 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:43,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {53463#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53463#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:43,588 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:43,589 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:43,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {53464#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53464#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:43,590 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:43,590 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:43,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {53465#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53465#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:43,592 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:43,592 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:43,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {53466#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53466#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:43,594 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:43,594 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:43,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {53467#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53467#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:43,595 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:43,596 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:43,596 INFO L273 TraceCheckUtils]: 59: Hoare triple {53468#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53468#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:43,597 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:43,598 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:43,598 INFO L273 TraceCheckUtils]: 62: Hoare triple {53469#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53469#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:43,599 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:43,599 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:43,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {53470#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53470#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:43,601 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:43,602 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:43,602 INFO L273 TraceCheckUtils]: 68: Hoare triple {53471#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53471#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:43,603 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:43,603 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:43,604 INFO L273 TraceCheckUtils]: 71: Hoare triple {53472#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53472#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:43,605 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:43,605 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:43,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {53473#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53473#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:43,607 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:43,607 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:43,608 INFO L273 TraceCheckUtils]: 77: Hoare triple {53474#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53474#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:43,609 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:43,609 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:43,610 INFO L273 TraceCheckUtils]: 80: Hoare triple {53475#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53475#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:43,610 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:43,611 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:43,611 INFO L273 TraceCheckUtils]: 83: Hoare triple {53476#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53476#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:43,612 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:43,613 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:43,613 INFO L273 TraceCheckUtils]: 86: Hoare triple {53477#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53477#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:43,614 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:43,614 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:43,615 INFO L273 TraceCheckUtils]: 89: Hoare triple {53478#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53478#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:43,616 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:43,616 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:43,617 INFO L273 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53479#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:43,618 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:43,618 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:43,619 INFO L273 TraceCheckUtils]: 95: Hoare triple {53480#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53480#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:43,619 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:43,620 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:43,621 INFO L273 TraceCheckUtils]: 98: Hoare triple {53481#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53481#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:43,621 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:43,622 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:43,622 INFO L273 TraceCheckUtils]: 101: Hoare triple {53482#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53482#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:43,623 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:43,624 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:43,624 INFO L273 TraceCheckUtils]: 104: Hoare triple {53483#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53483#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:43,625 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:43,626 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,626 INFO L273 TraceCheckUtils]: 107: Hoare triple {53484#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53484#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:43,627 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:43,627 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,628 INFO L273 TraceCheckUtils]: 110: Hoare triple {53485#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53485#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:43,629 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:43,629 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,630 INFO L273 TraceCheckUtils]: 113: Hoare triple {53486#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53486#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:43,631 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:43,631 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,632 INFO L273 TraceCheckUtils]: 116: Hoare triple {53487#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53487#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:43,632 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:43,633 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,633 INFO L273 TraceCheckUtils]: 119: Hoare triple {53488#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53488#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:43,634 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:43,635 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,635 INFO L273 TraceCheckUtils]: 122: Hoare triple {53489#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53489#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:43,636 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:43,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,637 INFO L273 TraceCheckUtils]: 125: Hoare triple {53490#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53490#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:43,638 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:43,639 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,639 INFO L273 TraceCheckUtils]: 128: Hoare triple {53491#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53491#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:43,640 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:43,640 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,641 INFO L273 TraceCheckUtils]: 131: Hoare triple {53492#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53492#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:43,642 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:43,642 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,643 INFO L273 TraceCheckUtils]: 134: Hoare triple {53493#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53493#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:43,644 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:43,644 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,645 INFO L273 TraceCheckUtils]: 137: Hoare triple {53494#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {53494#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:43,646 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:43,647 INFO L273 TraceCheckUtils]: 139: Hoare triple {53495#(<= main_~i~0 45)} assume !(~i~0 < 100000); {53450#false} is VALID [2018-11-23 11:53:43,647 INFO L273 TraceCheckUtils]: 140: Hoare triple {53450#false} assume !(0 != ~swapped~0); {53450#false} is VALID [2018-11-23 11:53:43,647 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:43,647 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:43,647 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:43,647 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:43,648 INFO L273 TraceCheckUtils]: 145: Hoare triple {53450#false} ~cond := #in~cond; {53450#false} is VALID [2018-11-23 11:53:43,648 INFO L273 TraceCheckUtils]: 146: Hoare triple {53450#false} assume 0 == ~cond; {53450#false} is VALID [2018-11-23 11:53:43,648 INFO L273 TraceCheckUtils]: 147: Hoare triple {53450#false} assume !false; {53450#false} is VALID [2018-11-23 11:53:43,662 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:43,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:43,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 11:53:43,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 11:53:43,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:43,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:53:43,848 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:43,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:53:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:53:43,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:53:43,849 INFO L87 Difference]: Start difference. First operand 285 states and 376 transitions. Second operand 48 states. [2018-11-23 11:53:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,164 INFO L93 Difference]: Finished difference Result 574 states and 762 transitions. [2018-11-23 11:53:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 11:53:45,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 148 [2018-11-23 11:53:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:53:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 229 transitions. [2018-11-23 11:53:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:53:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 229 transitions. [2018-11-23 11:53:45,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 229 transitions. [2018-11-23 11:53:45,456 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:45,461 INFO L225 Difference]: With dead ends: 574 [2018-11-23 11:53:45,461 INFO L226 Difference]: Without dead ends: 295 [2018-11-23 11:53:45,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:53:45,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-23 11:53:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 291. [2018-11-23 11:53:45,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:45,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:45,713 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:45,713 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 291 states. [2018-11-23 11:53:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,719 INFO L93 Difference]: Finished difference Result 295 states and 390 transitions. [2018-11-23 11:53:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2018-11-23 11:53:45,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,720 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 295 states. [2018-11-23 11:53:45,720 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 295 states. [2018-11-23 11:53:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:45,725 INFO L93 Difference]: Finished difference Result 295 states and 390 transitions. [2018-11-23 11:53:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2018-11-23 11:53:45,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:45,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:45,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:45,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-23 11:53:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 384 transitions. [2018-11-23 11:53:45,730 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 384 transitions. Word has length 148 [2018-11-23 11:53:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:45,730 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 384 transitions. [2018-11-23 11:53:45,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:53:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 384 transitions. [2018-11-23 11:53:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 11:53:45,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:45,731 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:45,731 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:45,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1774715720, now seen corresponding path program 45 times [2018-11-23 11:53:45,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:45,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:47,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {55692#true} call ULTIMATE.init(); {55692#true} is VALID [2018-11-23 11:53:47,029 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:47,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {55692#true} assume true; {55692#true} is VALID [2018-11-23 11:53:47,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55692#true} {55692#true} #79#return; {55692#true} is VALID [2018-11-23 11:53:47,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {55692#true} call #t~ret8 := main(); {55692#true} is VALID [2018-11-23 11:53:47,029 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:47,030 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:47,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55694#(= main_~i~0 1)} is VALID [2018-11-23 11:53:47,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {55694#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55694#(= main_~i~0 1)} is VALID [2018-11-23 11:53:47,032 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:47,032 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {55695#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,034 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:47,034 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,035 INFO L273 TraceCheckUtils]: 14: Hoare triple {55696#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,035 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:47,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {55697#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,037 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:47,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {55698#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,039 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:47,039 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {55699#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,040 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:47,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {55700#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,042 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:47,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {55701#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,044 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:47,044 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {55702#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,045 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:47,046 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {55703#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,047 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:47,047 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {55704#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,049 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:47,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {55705#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,050 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:47,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,051 INFO L273 TraceCheckUtils]: 44: Hoare triple {55706#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,052 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:47,053 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,053 INFO L273 TraceCheckUtils]: 47: Hoare triple {55707#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,054 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:47,054 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,055 INFO L273 TraceCheckUtils]: 50: Hoare triple {55708#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,056 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:47,056 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,057 INFO L273 TraceCheckUtils]: 53: Hoare triple {55709#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,057 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:47,058 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,058 INFO L273 TraceCheckUtils]: 56: Hoare triple {55710#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,059 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:47,059 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,060 INFO L273 TraceCheckUtils]: 59: Hoare triple {55711#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,061 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:47,061 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,061 INFO L273 TraceCheckUtils]: 62: Hoare triple {55712#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,062 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:47,063 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,063 INFO L273 TraceCheckUtils]: 65: Hoare triple {55713#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,064 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:47,064 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,065 INFO L273 TraceCheckUtils]: 68: Hoare triple {55714#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,066 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:47,066 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {55715#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,067 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:47,068 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,068 INFO L273 TraceCheckUtils]: 74: Hoare triple {55716#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,069 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:47,069 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,070 INFO L273 TraceCheckUtils]: 77: Hoare triple {55717#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,071 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:47,071 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {55718#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,072 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:47,073 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,073 INFO L273 TraceCheckUtils]: 83: Hoare triple {55719#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,074 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:47,075 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,075 INFO L273 TraceCheckUtils]: 86: Hoare triple {55720#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,076 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:47,076 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,077 INFO L273 TraceCheckUtils]: 89: Hoare triple {55721#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,077 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:47,078 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,078 INFO L273 TraceCheckUtils]: 92: Hoare triple {55722#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,079 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:47,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,080 INFO L273 TraceCheckUtils]: 95: Hoare triple {55723#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,081 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:47,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {55724#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,082 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:47,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,083 INFO L273 TraceCheckUtils]: 101: Hoare triple {55725#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,084 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:47,085 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,085 INFO L273 TraceCheckUtils]: 104: Hoare triple {55726#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,086 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:47,086 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,087 INFO L273 TraceCheckUtils]: 107: Hoare triple {55727#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,087 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:47,088 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {55728#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,089 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:47,089 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,090 INFO L273 TraceCheckUtils]: 113: Hoare triple {55729#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,091 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:47,091 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,092 INFO L273 TraceCheckUtils]: 116: Hoare triple {55730#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,093 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:47,093 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,093 INFO L273 TraceCheckUtils]: 119: Hoare triple {55731#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,094 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:47,095 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,095 INFO L273 TraceCheckUtils]: 122: Hoare triple {55732#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,096 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:47,096 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,097 INFO L273 TraceCheckUtils]: 125: Hoare triple {55733#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,097 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:47,098 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,099 INFO L273 TraceCheckUtils]: 128: Hoare triple {55734#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,099 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:47,100 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,100 INFO L273 TraceCheckUtils]: 131: Hoare triple {55735#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,101 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:47,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,102 INFO L273 TraceCheckUtils]: 134: Hoare triple {55736#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,103 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:47,103 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,104 INFO L273 TraceCheckUtils]: 137: Hoare triple {55737#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,104 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:47,105 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,105 INFO L273 TraceCheckUtils]: 140: Hoare triple {55738#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,106 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:47,107 INFO L273 TraceCheckUtils]: 142: Hoare triple {55739#(<= main_~i~0 46)} assume !(~i~0 < 100000); {55693#false} is VALID [2018-11-23 11:53:47,107 INFO L273 TraceCheckUtils]: 143: Hoare triple {55693#false} assume !(0 != ~swapped~0); {55693#false} is VALID [2018-11-23 11:53:47,107 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:47,107 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:47,107 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:47,108 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:47,108 INFO L273 TraceCheckUtils]: 148: Hoare triple {55693#false} ~cond := #in~cond; {55693#false} is VALID [2018-11-23 11:53:47,108 INFO L273 TraceCheckUtils]: 149: Hoare triple {55693#false} assume 0 == ~cond; {55693#false} is VALID [2018-11-23 11:53:47,108 INFO L273 TraceCheckUtils]: 150: Hoare triple {55693#false} assume !false; {55693#false} is VALID [2018-11-23 11:53:47,123 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:47,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:47,123 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:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:53:47,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-23 11:53:47,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:47,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:47,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {55692#true} call ULTIMATE.init(); {55692#true} is VALID [2018-11-23 11:53:47,833 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:47,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {55692#true} assume true; {55692#true} is VALID [2018-11-23 11:53:47,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55692#true} {55692#true} #79#return; {55692#true} is VALID [2018-11-23 11:53:47,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {55692#true} call #t~ret8 := main(); {55692#true} is VALID [2018-11-23 11:53:47,834 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:47,835 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:47,835 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55761#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:47,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {55761#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55761#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:47,837 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:47,837 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {55695#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55695#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:47,839 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:47,839 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {55696#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55696#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:47,840 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:47,841 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {55697#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55697#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:47,842 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:47,843 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {55698#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55698#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:47,844 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:47,844 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {55699#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55699#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:47,846 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:47,846 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {55700#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55700#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:47,847 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:47,848 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {55701#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55701#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:47,849 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:47,850 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {55702#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55702#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:47,851 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:47,851 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {55703#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55703#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:47,853 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:47,853 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {55704#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55704#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:47,854 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:47,855 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {55705#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55705#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:47,856 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:47,857 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {55706#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55706#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:47,858 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:47,859 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {55707#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55707#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:47,860 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:47,861 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {55708#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55708#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:47,862 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:47,862 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {55709#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55709#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:47,864 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:47,864 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {55710#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55710#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:47,865 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:47,866 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,867 INFO L273 TraceCheckUtils]: 59: Hoare triple {55711#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55711#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:47,867 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:47,868 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {55712#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55712#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:47,869 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:47,870 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {55713#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55713#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:47,871 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:47,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,872 INFO L273 TraceCheckUtils]: 68: Hoare triple {55714#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55714#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:47,873 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:47,873 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,874 INFO L273 TraceCheckUtils]: 71: Hoare triple {55715#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55715#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:47,875 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:47,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,876 INFO L273 TraceCheckUtils]: 74: Hoare triple {55716#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55716#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:47,877 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:47,877 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {55717#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55717#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:47,879 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:47,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {55718#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55718#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:47,881 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:47,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {55719#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55719#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:47,882 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:47,883 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,883 INFO L273 TraceCheckUtils]: 86: Hoare triple {55720#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55720#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:47,884 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:47,885 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {55721#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55721#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:47,886 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:47,886 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,887 INFO L273 TraceCheckUtils]: 92: Hoare triple {55722#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55722#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:47,888 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:47,888 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {55723#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55723#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:47,890 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:47,890 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,891 INFO L273 TraceCheckUtils]: 98: Hoare triple {55724#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55724#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:47,892 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:47,892 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,893 INFO L273 TraceCheckUtils]: 101: Hoare triple {55725#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55725#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:47,894 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:47,894 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,895 INFO L273 TraceCheckUtils]: 104: Hoare triple {55726#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55726#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:47,895 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:47,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,897 INFO L273 TraceCheckUtils]: 107: Hoare triple {55727#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55727#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:47,897 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:47,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,898 INFO L273 TraceCheckUtils]: 110: Hoare triple {55728#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55728#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:47,899 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:47,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,900 INFO L273 TraceCheckUtils]: 113: Hoare triple {55729#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55729#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:47,901 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:47,902 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,902 INFO L273 TraceCheckUtils]: 116: Hoare triple {55730#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55730#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:47,903 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:47,903 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,904 INFO L273 TraceCheckUtils]: 119: Hoare triple {55731#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55731#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:47,905 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:47,905 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,906 INFO L273 TraceCheckUtils]: 122: Hoare triple {55732#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55732#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:47,907 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:47,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,908 INFO L273 TraceCheckUtils]: 125: Hoare triple {55733#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55733#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:47,909 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:47,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,910 INFO L273 TraceCheckUtils]: 128: Hoare triple {55734#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55734#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:47,910 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:47,911 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,912 INFO L273 TraceCheckUtils]: 131: Hoare triple {55735#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55735#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:47,912 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:47,913 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,913 INFO L273 TraceCheckUtils]: 134: Hoare triple {55736#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55736#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:47,914 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:47,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,915 INFO L273 TraceCheckUtils]: 137: Hoare triple {55737#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55737#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:47,916 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:47,917 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,917 INFO L273 TraceCheckUtils]: 140: Hoare triple {55738#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {55738#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:47,918 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:47,919 INFO L273 TraceCheckUtils]: 142: Hoare triple {55739#(<= main_~i~0 46)} assume !(~i~0 < 100000); {55693#false} is VALID [2018-11-23 11:53:47,919 INFO L273 TraceCheckUtils]: 143: Hoare triple {55693#false} assume !(0 != ~swapped~0); {55693#false} is VALID [2018-11-23 11:53:47,919 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:47,919 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:47,919 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:47,920 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:47,920 INFO L273 TraceCheckUtils]: 148: Hoare triple {55693#false} ~cond := #in~cond; {55693#false} is VALID [2018-11-23 11:53:47,920 INFO L273 TraceCheckUtils]: 149: Hoare triple {55693#false} assume 0 == ~cond; {55693#false} is VALID [2018-11-23 11:53:47,920 INFO L273 TraceCheckUtils]: 150: Hoare triple {55693#false} assume !false; {55693#false} is VALID [2018-11-23 11:53:47,935 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:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2018-11-23 11:53:47,966 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 11:53:47,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:47,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 11:53:48,199 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:48,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 11:53:48,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 11:53:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:53:48,200 INFO L87 Difference]: Start difference. First operand 291 states and 384 transitions. Second operand 49 states. [2018-11-23 11:53:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:49,633 INFO L93 Difference]: Finished difference Result 586 states and 778 transitions. [2018-11-23 11:53:49,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:53:49,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-11-23 11:53:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:53:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 233 transitions. [2018-11-23 11:53:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 11:53:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 233 transitions. [2018-11-23 11:53:49,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 233 transitions. [2018-11-23 11:53:49,928 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:49,933 INFO L225 Difference]: With dead ends: 586 [2018-11-23 11:53:49,933 INFO L226 Difference]: Without dead ends: 301 [2018-11-23 11:53:49,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 11:53:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-23 11:53:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2018-11-23 11:53:50,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:50,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:50,071 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:50,071 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 297 states. [2018-11-23 11:53:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:50,078 INFO L93 Difference]: Finished difference Result 301 states and 398 transitions. [2018-11-23 11:53:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 398 transitions. [2018-11-23 11:53:50,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:50,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:50,078 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 301 states. [2018-11-23 11:53:50,078 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 301 states. [2018-11-23 11:53:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:50,083 INFO L93 Difference]: Finished difference Result 301 states and 398 transitions. [2018-11-23 11:53:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 398 transitions. [2018-11-23 11:53:50,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:50,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:50,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:50,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 11:53:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 392 transitions. [2018-11-23 11:53:50,089 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 392 transitions. Word has length 151 [2018-11-23 11:53:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:50,089 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 392 transitions. [2018-11-23 11:53:50,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 11:53:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 392 transitions. [2018-11-23 11:53:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 11:53:50,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:50,090 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:50,090 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:50,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1778739407, now seen corresponding path program 46 times [2018-11-23 11:53:50,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:50,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:50,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:51,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {57981#true} call ULTIMATE.init(); {57981#true} is VALID [2018-11-23 11:53:51,524 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:51,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {57981#true} assume true; {57981#true} is VALID [2018-11-23 11:53:51,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57981#true} {57981#true} #79#return; {57981#true} is VALID [2018-11-23 11:53:51,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {57981#true} call #t~ret8 := main(); {57981#true} is VALID [2018-11-23 11:53:51,525 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:51,525 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:51,526 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57983#(= main_~i~0 1)} is VALID [2018-11-23 11:53:51,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {57983#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57983#(= main_~i~0 1)} is VALID [2018-11-23 11:53:51,527 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:51,527 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:51,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {57984#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:51,528 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:51,528 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:51,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {57985#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:51,529 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:51,530 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:51,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {57986#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:51,531 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:51,532 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:51,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {57987#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:51,533 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:51,533 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:51,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {57988#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:51,535 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:51,535 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:51,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {57989#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:51,536 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:51,537 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:51,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {57990#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:51,538 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:51,538 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:51,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {57991#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:51,540 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:51,540 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:51,541 INFO L273 TraceCheckUtils]: 35: Hoare triple {57992#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:51,541 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:51,542 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:51,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {57993#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:51,543 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:51,544 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:51,544 INFO L273 TraceCheckUtils]: 41: Hoare triple {57994#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:51,545 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:51,545 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:51,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {57995#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:51,546 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:51,547 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:51,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {57996#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:51,548 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:51,549 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:51,549 INFO L273 TraceCheckUtils]: 50: Hoare triple {57997#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:51,550 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:51,550 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:51,551 INFO L273 TraceCheckUtils]: 53: Hoare triple {57998#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:51,551 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:51,552 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:51,552 INFO L273 TraceCheckUtils]: 56: Hoare triple {57999#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:51,553 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:51,554 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:51,554 INFO L273 TraceCheckUtils]: 59: Hoare triple {58000#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:51,555 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:51,555 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:51,556 INFO L273 TraceCheckUtils]: 62: Hoare triple {58001#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:51,556 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:51,557 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:51,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {58002#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:51,558 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:51,559 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:51,559 INFO L273 TraceCheckUtils]: 68: Hoare triple {58003#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:51,560 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:51,560 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:51,561 INFO L273 TraceCheckUtils]: 71: Hoare triple {58004#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:51,562 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:51,562 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:51,563 INFO L273 TraceCheckUtils]: 74: Hoare triple {58005#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:51,563 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:51,564 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:51,565 INFO L273 TraceCheckUtils]: 77: Hoare triple {58006#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:51,565 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:51,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:51,566 INFO L273 TraceCheckUtils]: 80: Hoare triple {58007#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:51,567 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:51,568 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:51,568 INFO L273 TraceCheckUtils]: 83: Hoare triple {58008#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:51,569 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:51,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:51,570 INFO L273 TraceCheckUtils]: 86: Hoare triple {58009#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:51,570 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:51,571 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:51,571 INFO L273 TraceCheckUtils]: 89: Hoare triple {58010#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:51,572 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:51,573 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:51,573 INFO L273 TraceCheckUtils]: 92: Hoare triple {58011#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:51,574 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:51,574 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:51,575 INFO L273 TraceCheckUtils]: 95: Hoare triple {58012#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:51,576 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:51,576 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:51,577 INFO L273 TraceCheckUtils]: 98: Hoare triple {58013#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:51,577 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:51,578 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:51,578 INFO L273 TraceCheckUtils]: 101: Hoare triple {58014#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:51,579 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:51,579 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:51,580 INFO L273 TraceCheckUtils]: 104: Hoare triple {58015#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:51,581 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:51,581 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:51,582 INFO L273 TraceCheckUtils]: 107: Hoare triple {58016#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:51,582 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:51,583 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:51,583 INFO L273 TraceCheckUtils]: 110: Hoare triple {58017#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:51,584 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:51,585 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:51,585 INFO L273 TraceCheckUtils]: 113: Hoare triple {58018#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:51,586 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:51,586 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:51,587 INFO L273 TraceCheckUtils]: 116: Hoare triple {58019#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:51,587 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:51,588 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:51,588 INFO L273 TraceCheckUtils]: 119: Hoare triple {58020#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:51,589 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:51,590 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:51,590 INFO L273 TraceCheckUtils]: 122: Hoare triple {58021#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:51,591 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:51,592 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:51,592 INFO L273 TraceCheckUtils]: 125: Hoare triple {58022#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:51,593 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:51,593 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:51,594 INFO L273 TraceCheckUtils]: 128: Hoare triple {58023#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:51,595 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:51,595 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:51,596 INFO L273 TraceCheckUtils]: 131: Hoare triple {58024#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:51,596 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:51,597 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:51,597 INFO L273 TraceCheckUtils]: 134: Hoare triple {58025#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:51,598 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:51,599 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:51,599 INFO L273 TraceCheckUtils]: 137: Hoare triple {58026#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:51,600 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:51,600 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:51,601 INFO L273 TraceCheckUtils]: 140: Hoare triple {58027#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:51,601 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:51,602 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:51,603 INFO L273 TraceCheckUtils]: 143: Hoare triple {58028#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:51,603 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:51,604 INFO L273 TraceCheckUtils]: 145: Hoare triple {58029#(<= main_~i~0 47)} assume !(~i~0 < 100000); {57982#false} is VALID [2018-11-23 11:53:51,604 INFO L273 TraceCheckUtils]: 146: Hoare triple {57982#false} assume !(0 != ~swapped~0); {57982#false} is VALID [2018-11-23 11:53:51,604 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:51,604 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:51,605 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:51,605 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:51,605 INFO L273 TraceCheckUtils]: 151: Hoare triple {57982#false} ~cond := #in~cond; {57982#false} is VALID [2018-11-23 11:53:51,605 INFO L273 TraceCheckUtils]: 152: Hoare triple {57982#false} assume 0 == ~cond; {57982#false} is VALID [2018-11-23 11:53:51,605 INFO L273 TraceCheckUtils]: 153: Hoare triple {57982#false} assume !false; {57982#false} is VALID [2018-11-23 11:53:51,620 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:51,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:51,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 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:51,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:53:51,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:53:51,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:51,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:52,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {57981#true} call ULTIMATE.init(); {57981#true} is VALID [2018-11-23 11:53:52,161 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:52,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {57981#true} assume true; {57981#true} is VALID [2018-11-23 11:53:52,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57981#true} {57981#true} #79#return; {57981#true} is VALID [2018-11-23 11:53:52,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {57981#true} call #t~ret8 := main(); {57981#true} is VALID [2018-11-23 11:53:52,162 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:52,162 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:52,163 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58051#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:52,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {58051#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58051#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:52,164 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:52,164 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:52,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {57984#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57984#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:52,165 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:52,165 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:52,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {57985#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57985#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:52,167 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:52,167 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:52,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {57986#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57986#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:52,168 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:52,169 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:52,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {57987#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57987#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:52,170 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:52,171 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:52,171 INFO L273 TraceCheckUtils]: 23: Hoare triple {57988#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57988#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:52,172 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:52,172 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:52,173 INFO L273 TraceCheckUtils]: 26: Hoare triple {57989#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57989#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:52,173 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:52,174 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:52,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {57990#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57990#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:52,175 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:52,176 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:52,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {57991#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57991#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:52,177 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:52,177 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:52,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {57992#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57992#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:52,179 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:52,179 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:52,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {57993#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57993#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:52,180 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:52,181 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:52,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {57994#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57994#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:52,182 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:52,182 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:52,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {57995#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57995#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:52,184 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:52,184 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:52,185 INFO L273 TraceCheckUtils]: 47: Hoare triple {57996#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57996#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:52,185 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:52,186 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:52,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {57997#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57997#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:52,187 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:52,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:52,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {57998#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57998#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:52,189 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:52,189 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:52,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {57999#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {57999#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:52,190 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:52,191 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:52,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {58000#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58000#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:52,192 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:52,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:52,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {58001#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58001#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:52,194 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:52,194 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:52,195 INFO L273 TraceCheckUtils]: 65: Hoare triple {58002#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58002#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:52,195 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:52,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:52,196 INFO L273 TraceCheckUtils]: 68: Hoare triple {58003#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58003#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:52,197 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:52,198 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:52,198 INFO L273 TraceCheckUtils]: 71: Hoare triple {58004#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58004#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:52,199 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:52,199 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:52,200 INFO L273 TraceCheckUtils]: 74: Hoare triple {58005#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58005#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:52,200 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:52,201 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:52,201 INFO L273 TraceCheckUtils]: 77: Hoare triple {58006#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58006#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:52,202 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:52,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:52,203 INFO L273 TraceCheckUtils]: 80: Hoare triple {58007#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58007#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:52,204 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:52,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:52,205 INFO L273 TraceCheckUtils]: 83: Hoare triple {58008#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58008#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:52,205 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:52,206 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:52,206 INFO L273 TraceCheckUtils]: 86: Hoare triple {58009#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58009#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:52,207 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:52,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:52,208 INFO L273 TraceCheckUtils]: 89: Hoare triple {58010#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58010#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:52,209 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:52,209 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:52,210 INFO L273 TraceCheckUtils]: 92: Hoare triple {58011#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58011#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:52,211 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:52,211 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:52,212 INFO L273 TraceCheckUtils]: 95: Hoare triple {58012#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58012#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:52,212 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:52,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:52,213 INFO L273 TraceCheckUtils]: 98: Hoare triple {58013#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58013#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:52,214 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:52,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:52,215 INFO L273 TraceCheckUtils]: 101: Hoare triple {58014#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58014#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:52,216 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:52,216 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:52,217 INFO L273 TraceCheckUtils]: 104: Hoare triple {58015#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58015#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:52,217 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:52,218 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:52,219 INFO L273 TraceCheckUtils]: 107: Hoare triple {58016#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58016#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:52,219 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:52,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:52,220 INFO L273 TraceCheckUtils]: 110: Hoare triple {58017#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58017#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:52,221 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:52,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:52,222 INFO L273 TraceCheckUtils]: 113: Hoare triple {58018#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58018#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:52,223 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:52,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:52,224 INFO L273 TraceCheckUtils]: 116: Hoare triple {58019#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58019#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:52,225 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:52,225 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:52,226 INFO L273 TraceCheckUtils]: 119: Hoare triple {58020#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58020#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:52,227 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:52,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:52,228 INFO L273 TraceCheckUtils]: 122: Hoare triple {58021#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58021#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:52,228 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:52,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:52,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {58022#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58022#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:52,230 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:52,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:52,231 INFO L273 TraceCheckUtils]: 128: Hoare triple {58023#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58023#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:52,232 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:52,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:52,233 INFO L273 TraceCheckUtils]: 131: Hoare triple {58024#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58024#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:52,234 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:52,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:52,235 INFO L273 TraceCheckUtils]: 134: Hoare triple {58025#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58025#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:52,235 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:52,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:52,237 INFO L273 TraceCheckUtils]: 137: Hoare triple {58026#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58026#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:52,237 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:52,238 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:52,238 INFO L273 TraceCheckUtils]: 140: Hoare triple {58027#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58027#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:52,239 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:52,239 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:52,240 INFO L273 TraceCheckUtils]: 143: Hoare triple {58028#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {58028#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:52,241 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:52,241 INFO L273 TraceCheckUtils]: 145: Hoare triple {58029#(<= main_~i~0 47)} assume !(~i~0 < 100000); {57982#false} is VALID [2018-11-23 11:53:52,242 INFO L273 TraceCheckUtils]: 146: Hoare triple {57982#false} assume !(0 != ~swapped~0); {57982#false} is VALID [2018-11-23 11:53:52,242 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:52,242 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:52,242 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:52,242 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:52,242 INFO L273 TraceCheckUtils]: 151: Hoare triple {57982#false} ~cond := #in~cond; {57982#false} is VALID [2018-11-23 11:53:52,243 INFO L273 TraceCheckUtils]: 152: Hoare triple {57982#false} assume 0 == ~cond; {57982#false} is VALID [2018-11-23 11:53:52,243 INFO L273 TraceCheckUtils]: 153: Hoare triple {57982#false} assume !false; {57982#false} is VALID [2018-11-23 11:53:52,259 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: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 [49, 49] total 50 [2018-11-23 11:53:52,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [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 50 states. [2018-11-23 11:53:52,439 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:52,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 11:53:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 11:53:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:53:52,441 INFO L87 Difference]: Start difference. First operand 297 states and 392 transitions. Second operand 50 states. [2018-11-23 11:53:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:53,830 INFO L93 Difference]: Finished difference Result 598 states and 794 transitions. [2018-11-23 11:53:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:53:53,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 154 [2018-11-23 11:53:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 237 transitions. [2018-11-23 11:53:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:53:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 237 transitions. [2018-11-23 11:53:53,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 237 transitions. [2018-11-23 11:53:54,108 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:54,114 INFO L225 Difference]: With dead ends: 598 [2018-11-23 11:53:54,115 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 11:53:54,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:53:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 11:53:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 303. [2018-11-23 11:53:54,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:54,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:54,261 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:54,262 INFO L87 Difference]: Start difference. First operand 307 states. Second operand 303 states. [2018-11-23 11:53:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:54,268 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2018-11-23 11:53:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2018-11-23 11:53:54,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:54,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:54,269 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand 307 states. [2018-11-23 11:53:54,269 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 307 states. [2018-11-23 11:53:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:54,274 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2018-11-23 11:53:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 406 transitions. [2018-11-23 11:53:54,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:54,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:54,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:54,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 11:53:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 400 transitions. [2018-11-23 11:53:54,280 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 400 transitions. Word has length 154 [2018-11-23 11:53:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:54,280 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 400 transitions. [2018-11-23 11:53:54,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 11:53:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 400 transitions. [2018-11-23 11:53:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-23 11:53:54,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:54,281 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:54,281 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:54,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash -406516056, now seen corresponding path program 47 times [2018-11-23 11:53:54,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:54,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:55,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {60316#true} call ULTIMATE.init(); {60316#true} is VALID [2018-11-23 11:53:55,878 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:55,878 INFO L273 TraceCheckUtils]: 2: Hoare triple {60316#true} assume true; {60316#true} is VALID [2018-11-23 11:53:55,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60316#true} {60316#true} #79#return; {60316#true} is VALID [2018-11-23 11:53:55,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {60316#true} call #t~ret8 := main(); {60316#true} is VALID [2018-11-23 11:53:55,879 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:55,880 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:55,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60318#(= main_~i~0 1)} is VALID [2018-11-23 11:53:55,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {60318#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60318#(= main_~i~0 1)} is VALID [2018-11-23 11:53:55,881 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:55,882 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {60319#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:55,883 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:55,885 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {60320#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:55,887 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:55,887 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {60321#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:55,890 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:55,892 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {60322#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:55,895 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:55,895 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {60323#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:55,898 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:55,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {60324#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:55,903 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:55,903 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {60325#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:55,905 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:55,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {60326#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:55,909 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:55,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {60327#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:55,911 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:55,913 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {60328#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:55,915 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:55,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {60329#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:55,918 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:55,921 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {60330#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:55,921 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:55,922 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,924 INFO L273 TraceCheckUtils]: 47: Hoare triple {60331#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:55,924 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:55,926 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,926 INFO L273 TraceCheckUtils]: 50: Hoare triple {60332#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:55,926 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:55,927 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {60333#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:55,928 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:55,931 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {60334#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:55,933 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:55,933 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,936 INFO L273 TraceCheckUtils]: 59: Hoare triple {60335#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:55,936 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:55,939 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,939 INFO L273 TraceCheckUtils]: 62: Hoare triple {60336#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:55,942 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:55,942 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {60337#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:55,944 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:55,947 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,947 INFO L273 TraceCheckUtils]: 68: Hoare triple {60338#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:55,949 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:55,949 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,951 INFO L273 TraceCheckUtils]: 71: Hoare triple {60339#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:55,951 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:55,954 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,954 INFO L273 TraceCheckUtils]: 74: Hoare triple {60340#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:55,956 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:55,956 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {60341#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:55,959 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:55,961 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,961 INFO L273 TraceCheckUtils]: 80: Hoare triple {60342#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:55,961 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:55,962 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,962 INFO L273 TraceCheckUtils]: 83: Hoare triple {60343#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:55,962 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:55,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,963 INFO L273 TraceCheckUtils]: 86: Hoare triple {60344#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:55,967 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:55,967 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,970 INFO L273 TraceCheckUtils]: 89: Hoare triple {60345#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:55,970 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:55,973 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,973 INFO L273 TraceCheckUtils]: 92: Hoare triple {60346#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:55,975 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:55,975 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,977 INFO L273 TraceCheckUtils]: 95: Hoare triple {60347#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:55,977 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:55,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,980 INFO L273 TraceCheckUtils]: 98: Hoare triple {60348#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:55,983 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:55,983 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,983 INFO L273 TraceCheckUtils]: 101: Hoare triple {60349#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:55,984 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:55,984 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,984 INFO L273 TraceCheckUtils]: 104: Hoare triple {60350#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:55,985 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:55,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,985 INFO L273 TraceCheckUtils]: 107: Hoare triple {60351#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:55,986 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:55,986 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,986 INFO L273 TraceCheckUtils]: 110: Hoare triple {60352#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:55,987 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:55,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,988 INFO L273 TraceCheckUtils]: 113: Hoare triple {60353#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:55,989 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:55,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,990 INFO L273 TraceCheckUtils]: 116: Hoare triple {60354#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:55,990 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:55,991 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,991 INFO L273 TraceCheckUtils]: 119: Hoare triple {60355#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:55,992 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:55,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,993 INFO L273 TraceCheckUtils]: 122: Hoare triple {60356#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:55,994 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:55,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,995 INFO L273 TraceCheckUtils]: 125: Hoare triple {60357#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:55,996 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:55,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,997 INFO L273 TraceCheckUtils]: 128: Hoare triple {60358#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:55,997 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:55,998 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,998 INFO L273 TraceCheckUtils]: 131: Hoare triple {60359#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:55,999 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:56,000 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:56,000 INFO L273 TraceCheckUtils]: 134: Hoare triple {60360#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:56,001 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:56,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:56,002 INFO L273 TraceCheckUtils]: 137: Hoare triple {60361#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:56,002 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:56,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:56,003 INFO L273 TraceCheckUtils]: 140: Hoare triple {60362#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:56,004 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:56,005 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:56,005 INFO L273 TraceCheckUtils]: 143: Hoare triple {60363#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:56,006 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:56,006 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:56,007 INFO L273 TraceCheckUtils]: 146: Hoare triple {60364#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:56,008 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:56,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {60365#(<= main_~i~0 48)} assume !(~i~0 < 100000); {60317#false} is VALID [2018-11-23 11:53:56,008 INFO L273 TraceCheckUtils]: 149: Hoare triple {60317#false} assume !(0 != ~swapped~0); {60317#false} is VALID [2018-11-23 11:53:56,009 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:56,009 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:56,009 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:56,009 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:56,009 INFO L273 TraceCheckUtils]: 154: Hoare triple {60317#false} ~cond := #in~cond; {60317#false} is VALID [2018-11-23 11:53:56,009 INFO L273 TraceCheckUtils]: 155: Hoare triple {60317#false} assume 0 == ~cond; {60317#false} is VALID [2018-11-23 11:53:56,010 INFO L273 TraceCheckUtils]: 156: Hoare triple {60317#false} assume !false; {60317#false} is VALID [2018-11-23 11:53:56,044 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:56,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:53:56,044 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:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:53:56,381 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 11:53:56,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:53:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:53:56,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:53:56,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {60316#true} call ULTIMATE.init(); {60316#true} is VALID [2018-11-23 11:53:56,893 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:56,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {60316#true} assume true; {60316#true} is VALID [2018-11-23 11:53:56,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60316#true} {60316#true} #79#return; {60316#true} is VALID [2018-11-23 11:53:56,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {60316#true} call #t~ret8 := main(); {60316#true} is VALID [2018-11-23 11:53:56,894 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:56,895 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:56,895 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60387#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:56,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {60387#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60387#(<= main_~i~0 1)} is VALID [2018-11-23 11:53:56,896 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:56,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:56,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {60319#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60319#(<= main_~i~0 2)} is VALID [2018-11-23 11:53:56,897 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:56,897 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:56,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {60320#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60320#(<= main_~i~0 3)} is VALID [2018-11-23 11:53:56,898 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:56,899 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:56,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {60321#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60321#(<= main_~i~0 4)} is VALID [2018-11-23 11:53:56,900 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:56,900 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:56,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {60322#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60322#(<= main_~i~0 5)} is VALID [2018-11-23 11:53:56,901 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:56,902 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:56,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {60323#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60323#(<= main_~i~0 6)} is VALID [2018-11-23 11:53:56,903 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:56,904 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:56,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {60324#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60324#(<= main_~i~0 7)} is VALID [2018-11-23 11:53:56,905 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:56,905 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:56,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {60325#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60325#(<= main_~i~0 8)} is VALID [2018-11-23 11:53:56,907 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:56,907 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:56,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {60326#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60326#(<= main_~i~0 9)} is VALID [2018-11-23 11:53:56,908 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:56,909 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:56,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {60327#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60327#(<= main_~i~0 10)} is VALID [2018-11-23 11:53:56,910 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:56,911 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:56,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {60328#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60328#(<= main_~i~0 11)} is VALID [2018-11-23 11:53:56,912 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:56,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:56,913 INFO L273 TraceCheckUtils]: 41: Hoare triple {60329#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60329#(<= main_~i~0 12)} is VALID [2018-11-23 11:53:56,914 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:56,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:56,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {60330#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60330#(<= main_~i~0 13)} is VALID [2018-11-23 11:53:56,915 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:56,916 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:56,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {60331#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60331#(<= main_~i~0 14)} is VALID [2018-11-23 11:53:56,917 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:56,918 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:56,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {60332#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60332#(<= main_~i~0 15)} is VALID [2018-11-23 11:53:56,919 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:56,919 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:56,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {60333#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60333#(<= main_~i~0 16)} is VALID [2018-11-23 11:53:56,920 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:56,921 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:56,922 INFO L273 TraceCheckUtils]: 56: Hoare triple {60334#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60334#(<= main_~i~0 17)} is VALID [2018-11-23 11:53:56,922 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:56,923 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:56,923 INFO L273 TraceCheckUtils]: 59: Hoare triple {60335#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60335#(<= main_~i~0 18)} is VALID [2018-11-23 11:53:56,924 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:56,925 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:56,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {60336#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60336#(<= main_~i~0 19)} is VALID [2018-11-23 11:53:56,926 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:56,926 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:56,927 INFO L273 TraceCheckUtils]: 65: Hoare triple {60337#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60337#(<= main_~i~0 20)} is VALID [2018-11-23 11:53:56,928 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:56,928 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:56,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {60338#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60338#(<= main_~i~0 21)} is VALID [2018-11-23 11:53:56,929 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:56,930 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:56,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {60339#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60339#(<= main_~i~0 22)} is VALID [2018-11-23 11:53:56,931 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:56,931 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:56,932 INFO L273 TraceCheckUtils]: 74: Hoare triple {60340#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60340#(<= main_~i~0 23)} is VALID [2018-11-23 11:53:56,933 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:56,933 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:56,934 INFO L273 TraceCheckUtils]: 77: Hoare triple {60341#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60341#(<= main_~i~0 24)} is VALID [2018-11-23 11:53:56,934 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:56,935 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:56,935 INFO L273 TraceCheckUtils]: 80: Hoare triple {60342#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60342#(<= main_~i~0 25)} is VALID [2018-11-23 11:53:56,936 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:56,937 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:56,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {60343#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60343#(<= main_~i~0 26)} is VALID [2018-11-23 11:53:56,938 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:56,938 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:56,939 INFO L273 TraceCheckUtils]: 86: Hoare triple {60344#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60344#(<= main_~i~0 27)} is VALID [2018-11-23 11:53:56,939 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:56,940 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:56,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {60345#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60345#(<= main_~i~0 28)} is VALID [2018-11-23 11:53:56,941 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:56,942 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:56,942 INFO L273 TraceCheckUtils]: 92: Hoare triple {60346#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60346#(<= main_~i~0 29)} is VALID [2018-11-23 11:53:56,943 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:56,943 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:56,944 INFO L273 TraceCheckUtils]: 95: Hoare triple {60347#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60347#(<= main_~i~0 30)} is VALID [2018-11-23 11:53:56,945 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:56,945 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:56,946 INFO L273 TraceCheckUtils]: 98: Hoare triple {60348#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60348#(<= main_~i~0 31)} is VALID [2018-11-23 11:53:56,946 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:56,947 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:56,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {60349#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60349#(<= main_~i~0 32)} is VALID [2018-11-23 11:53:56,948 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:56,949 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:56,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {60350#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60350#(<= main_~i~0 33)} is VALID [2018-11-23 11:53:56,950 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:56,950 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:56,951 INFO L273 TraceCheckUtils]: 107: Hoare triple {60351#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60351#(<= main_~i~0 34)} is VALID [2018-11-23 11:53:56,952 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:56,952 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:56,953 INFO L273 TraceCheckUtils]: 110: Hoare triple {60352#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60352#(<= main_~i~0 35)} is VALID [2018-11-23 11:53:56,953 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:56,954 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:56,954 INFO L273 TraceCheckUtils]: 113: Hoare triple {60353#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60353#(<= main_~i~0 36)} is VALID [2018-11-23 11:53:56,955 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:56,956 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:56,956 INFO L273 TraceCheckUtils]: 116: Hoare triple {60354#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60354#(<= main_~i~0 37)} is VALID [2018-11-23 11:53:56,957 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:56,957 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:56,958 INFO L273 TraceCheckUtils]: 119: Hoare triple {60355#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60355#(<= main_~i~0 38)} is VALID [2018-11-23 11:53:56,959 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:56,959 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:56,960 INFO L273 TraceCheckUtils]: 122: Hoare triple {60356#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60356#(<= main_~i~0 39)} is VALID [2018-11-23 11:53:56,960 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:56,961 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:56,961 INFO L273 TraceCheckUtils]: 125: Hoare triple {60357#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60357#(<= main_~i~0 40)} is VALID [2018-11-23 11:53:56,962 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:56,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:56,963 INFO L273 TraceCheckUtils]: 128: Hoare triple {60358#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60358#(<= main_~i~0 41)} is VALID [2018-11-23 11:53:56,964 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:56,964 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:56,965 INFO L273 TraceCheckUtils]: 131: Hoare triple {60359#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60359#(<= main_~i~0 42)} is VALID [2018-11-23 11:53:56,965 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:56,966 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:56,966 INFO L273 TraceCheckUtils]: 134: Hoare triple {60360#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60360#(<= main_~i~0 43)} is VALID [2018-11-23 11:53:56,967 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:56,968 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:56,968 INFO L273 TraceCheckUtils]: 137: Hoare triple {60361#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60361#(<= main_~i~0 44)} is VALID [2018-11-23 11:53:56,969 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:56,969 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:56,970 INFO L273 TraceCheckUtils]: 140: Hoare triple {60362#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60362#(<= main_~i~0 45)} is VALID [2018-11-23 11:53:56,971 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:56,971 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:56,972 INFO L273 TraceCheckUtils]: 143: Hoare triple {60363#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60363#(<= main_~i~0 46)} is VALID [2018-11-23 11:53:56,972 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:56,973 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:56,973 INFO L273 TraceCheckUtils]: 146: Hoare triple {60364#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {60364#(<= main_~i~0 47)} is VALID [2018-11-23 11:53:56,974 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:56,975 INFO L273 TraceCheckUtils]: 148: Hoare triple {60365#(<= main_~i~0 48)} assume !(~i~0 < 100000); {60317#false} is VALID [2018-11-23 11:53:56,975 INFO L273 TraceCheckUtils]: 149: Hoare triple {60317#false} assume !(0 != ~swapped~0); {60317#false} is VALID [2018-11-23 11:53:56,975 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:56,975 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:56,975 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:56,975 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:56,976 INFO L273 TraceCheckUtils]: 154: Hoare triple {60317#false} ~cond := #in~cond; {60317#false} is VALID [2018-11-23 11:53:56,976 INFO L273 TraceCheckUtils]: 155: Hoare triple {60317#false} assume 0 == ~cond; {60317#false} is VALID [2018-11-23 11:53:56,976 INFO L273 TraceCheckUtils]: 156: Hoare triple {60317#false} assume !false; {60317#false} is VALID [2018-11-23 11:53:56,992 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:57,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:53:57,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2018-11-23 11:53:57,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 11:53:57,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:53:57,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 11:53:57,176 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:57,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 11:53:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 11:53:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:53:57,178 INFO L87 Difference]: Start difference. First operand 303 states and 400 transitions. Second operand 51 states. [2018-11-23 11:53:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:58,566 INFO L93 Difference]: Finished difference Result 610 states and 810 transitions. [2018-11-23 11:53:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:53:58,566 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-11-23 11:53:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:53:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:53:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 241 transitions. [2018-11-23 11:53:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 11:53:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 241 transitions. [2018-11-23 11:53:58,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 241 transitions. [2018-11-23 11:53:58,876 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:58,883 INFO L225 Difference]: With dead ends: 610 [2018-11-23 11:53:58,883 INFO L226 Difference]: Without dead ends: 313 [2018-11-23 11:53:58,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 11:53:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-23 11:53:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-23 11:53:59,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:53:59,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:59,015 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:59,015 INFO L87 Difference]: Start difference. First operand 313 states. Second operand 309 states. [2018-11-23 11:53:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:59,021 INFO L93 Difference]: Finished difference Result 313 states and 414 transitions. [2018-11-23 11:53:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 414 transitions. [2018-11-23 11:53:59,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:59,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:59,021 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand 313 states. [2018-11-23 11:53:59,021 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 313 states. [2018-11-23 11:53:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:53:59,027 INFO L93 Difference]: Finished difference Result 313 states and 414 transitions. [2018-11-23 11:53:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 414 transitions. [2018-11-23 11:53:59,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:53:59,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:53:59,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:53:59,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:53:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-23 11:53:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 408 transitions. [2018-11-23 11:53:59,033 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 408 transitions. Word has length 157 [2018-11-23 11:53:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:53:59,033 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 408 transitions. [2018-11-23 11:53:59,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 11:53:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 408 transitions. [2018-11-23 11:53:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 11:53:59,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:53:59,034 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:59,034 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:53:59,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:53:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash 610257, now seen corresponding path program 48 times [2018-11-23 11:53:59,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:53:59,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:53:59,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:59,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:53:59,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:53:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:00,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {62697#true} call ULTIMATE.init(); {62697#true} is VALID [2018-11-23 11:54:00,510 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:54:00,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {62697#true} assume true; {62697#true} is VALID [2018-11-23 11:54:00,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62697#true} {62697#true} #79#return; {62697#true} is VALID [2018-11-23 11:54:00,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {62697#true} call #t~ret8 := main(); {62697#true} is VALID [2018-11-23 11:54:00,510 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:54:00,511 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:54:00,511 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62699#(= main_~i~0 1)} is VALID [2018-11-23 11:54:00,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {62699#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62699#(= main_~i~0 1)} is VALID [2018-11-23 11:54:00,512 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:54:00,512 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:00,513 INFO L273 TraceCheckUtils]: 11: Hoare triple {62700#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:00,514 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:54:00,514 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:00,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {62701#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:00,515 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:54:00,516 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:00,517 INFO L273 TraceCheckUtils]: 17: Hoare triple {62702#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:00,517 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:54:00,518 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:00,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {62703#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:00,519 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:54:00,520 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:00,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {62704#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:00,521 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:54:00,522 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:00,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {62705#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:00,523 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:54:00,524 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:00,524 INFO L273 TraceCheckUtils]: 29: Hoare triple {62706#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:00,525 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:54:00,525 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:00,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {62707#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:00,527 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:54:00,527 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:00,528 INFO L273 TraceCheckUtils]: 35: Hoare triple {62708#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:00,528 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:54:00,529 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:00,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {62709#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:00,530 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:54:00,531 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:00,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {62710#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:00,532 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:54:00,532 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:00,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {62711#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:00,533 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:54:00,534 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:00,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {62712#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:00,535 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:54:00,536 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:00,536 INFO L273 TraceCheckUtils]: 50: Hoare triple {62713#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:00,537 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:54:00,537 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:00,538 INFO L273 TraceCheckUtils]: 53: Hoare triple {62714#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:00,539 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:54:00,539 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:00,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {62715#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:00,540 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:54:00,541 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:00,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {62716#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:00,542 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:54:00,543 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:00,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {62717#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:00,544 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:54:00,544 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:00,545 INFO L273 TraceCheckUtils]: 65: Hoare triple {62718#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:00,545 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:54:00,546 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:00,547 INFO L273 TraceCheckUtils]: 68: Hoare triple {62719#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:00,547 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:54:00,548 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:00,548 INFO L273 TraceCheckUtils]: 71: Hoare triple {62720#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:00,549 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:54:00,550 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:00,550 INFO L273 TraceCheckUtils]: 74: Hoare triple {62721#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:00,551 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:54:00,551 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:00,552 INFO L273 TraceCheckUtils]: 77: Hoare triple {62722#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:00,553 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:54:00,553 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:00,554 INFO L273 TraceCheckUtils]: 80: Hoare triple {62723#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:00,554 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:54:00,555 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:00,555 INFO L273 TraceCheckUtils]: 83: Hoare triple {62724#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:00,556 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:54:00,556 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:00,557 INFO L273 TraceCheckUtils]: 86: Hoare triple {62725#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:00,558 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:54:00,558 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:00,559 INFO L273 TraceCheckUtils]: 89: Hoare triple {62726#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:00,559 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:54:00,560 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:00,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {62727#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:00,561 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:54:00,562 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:00,562 INFO L273 TraceCheckUtils]: 95: Hoare triple {62728#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:00,563 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:54:00,564 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:00,564 INFO L273 TraceCheckUtils]: 98: Hoare triple {62729#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:00,565 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:54:00,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:00,566 INFO L273 TraceCheckUtils]: 101: Hoare triple {62730#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:00,567 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:54:00,567 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:00,568 INFO L273 TraceCheckUtils]: 104: Hoare triple {62731#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:00,568 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:54:00,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:00,570 INFO L273 TraceCheckUtils]: 107: Hoare triple {62732#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:00,570 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:54:00,571 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:00,571 INFO L273 TraceCheckUtils]: 110: Hoare triple {62733#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:00,572 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:54:00,572 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:00,573 INFO L273 TraceCheckUtils]: 113: Hoare triple {62734#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:00,574 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:54:00,574 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:00,575 INFO L273 TraceCheckUtils]: 116: Hoare triple {62735#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:00,575 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:54:00,576 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:00,576 INFO L273 TraceCheckUtils]: 119: Hoare triple {62736#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:00,577 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:54:00,577 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:00,578 INFO L273 TraceCheckUtils]: 122: Hoare triple {62737#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:00,579 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:54:00,579 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:00,580 INFO L273 TraceCheckUtils]: 125: Hoare triple {62738#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:00,580 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:54:00,581 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:00,582 INFO L273 TraceCheckUtils]: 128: Hoare triple {62739#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:00,582 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:54:00,583 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:00,583 INFO L273 TraceCheckUtils]: 131: Hoare triple {62740#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:00,584 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:54:00,585 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:00,585 INFO L273 TraceCheckUtils]: 134: Hoare triple {62741#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:00,586 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:54:00,586 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:00,587 INFO L273 TraceCheckUtils]: 137: Hoare triple {62742#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:00,587 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:54:00,588 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:00,588 INFO L273 TraceCheckUtils]: 140: Hoare triple {62743#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:00,589 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:54:00,590 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:00,590 INFO L273 TraceCheckUtils]: 143: Hoare triple {62744#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:00,591 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:54:00,591 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:00,592 INFO L273 TraceCheckUtils]: 146: Hoare triple {62745#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:00,593 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:54:00,593 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:00,594 INFO L273 TraceCheckUtils]: 149: Hoare triple {62746#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:00,594 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:54:00,595 INFO L273 TraceCheckUtils]: 151: Hoare triple {62747#(<= main_~i~0 49)} assume !(~i~0 < 100000); {62698#false} is VALID [2018-11-23 11:54:00,595 INFO L273 TraceCheckUtils]: 152: Hoare triple {62698#false} assume !(0 != ~swapped~0); {62698#false} is VALID [2018-11-23 11:54:00,595 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:54:00,596 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:54:00,596 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:54:00,596 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:54:00,596 INFO L273 TraceCheckUtils]: 157: Hoare triple {62698#false} ~cond := #in~cond; {62698#false} is VALID [2018-11-23 11:54:00,596 INFO L273 TraceCheckUtils]: 158: Hoare triple {62698#false} assume 0 == ~cond; {62698#false} is VALID [2018-11-23 11:54:00,596 INFO L273 TraceCheckUtils]: 159: Hoare triple {62698#false} assume !false; {62698#false} is VALID [2018-11-23 11:54:00,612 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:54:00,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:00,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:01,179 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-11-23 11:54:01,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:01,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:01,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {62697#true} call ULTIMATE.init(); {62697#true} is VALID [2018-11-23 11:54:01,663 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:54:01,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {62697#true} assume true; {62697#true} is VALID [2018-11-23 11:54:01,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {62697#true} {62697#true} #79#return; {62697#true} is VALID [2018-11-23 11:54:01,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {62697#true} call #t~ret8 := main(); {62697#true} is VALID [2018-11-23 11:54:01,663 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:54:01,664 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:54:01,665 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62769#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:01,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {62769#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62769#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:01,665 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:54:01,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:01,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {62700#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62700#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:01,666 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:54:01,667 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:01,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {62701#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62701#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:01,668 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:54:01,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:01,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {62702#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62702#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:01,670 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:54:01,670 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:01,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {62703#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62703#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:01,671 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:54:01,672 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:01,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {62704#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62704#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:01,673 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:54:01,674 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:01,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {62705#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62705#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:01,675 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:54:01,676 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:01,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {62706#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62706#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:01,677 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:54:01,677 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:01,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {62707#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62707#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:01,678 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:54:01,679 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:01,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {62708#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62708#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:01,680 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:54:01,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:01,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {62709#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62709#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:01,682 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:54:01,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:01,683 INFO L273 TraceCheckUtils]: 41: Hoare triple {62710#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62710#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:01,683 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:54:01,684 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:01,685 INFO L273 TraceCheckUtils]: 44: Hoare triple {62711#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62711#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:01,685 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:54:01,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:01,686 INFO L273 TraceCheckUtils]: 47: Hoare triple {62712#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62712#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:01,687 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:54:01,687 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:01,688 INFO L273 TraceCheckUtils]: 50: Hoare triple {62713#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62713#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:01,689 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:54:01,689 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:01,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {62714#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62714#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:01,690 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:54:01,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:01,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {62715#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62715#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:01,692 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:54:01,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:01,693 INFO L273 TraceCheckUtils]: 59: Hoare triple {62716#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62716#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:01,694 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:54:01,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:01,695 INFO L273 TraceCheckUtils]: 62: Hoare triple {62717#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62717#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:01,695 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:54:01,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:01,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {62718#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62718#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:01,697 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:54:01,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:01,698 INFO L273 TraceCheckUtils]: 68: Hoare triple {62719#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62719#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:01,699 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:54:01,699 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:01,700 INFO L273 TraceCheckUtils]: 71: Hoare triple {62720#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62720#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:01,701 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:54:01,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:01,702 INFO L273 TraceCheckUtils]: 74: Hoare triple {62721#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62721#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:01,702 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:54:01,703 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:01,703 INFO L273 TraceCheckUtils]: 77: Hoare triple {62722#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62722#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:01,704 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:54:01,705 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:01,705 INFO L273 TraceCheckUtils]: 80: Hoare triple {62723#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62723#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:01,706 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:54:01,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:01,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {62724#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62724#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:01,708 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:54:01,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:01,709 INFO L273 TraceCheckUtils]: 86: Hoare triple {62725#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62725#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:01,709 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:54:01,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:01,711 INFO L273 TraceCheckUtils]: 89: Hoare triple {62726#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62726#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:01,711 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:54:01,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:01,713 INFO L273 TraceCheckUtils]: 92: Hoare triple {62727#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62727#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:01,713 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:54:01,714 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:01,714 INFO L273 TraceCheckUtils]: 95: Hoare triple {62728#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62728#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:01,715 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:54:01,715 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:01,716 INFO L273 TraceCheckUtils]: 98: Hoare triple {62729#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62729#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:01,717 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:54:01,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:01,718 INFO L273 TraceCheckUtils]: 101: Hoare triple {62730#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62730#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:01,718 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:54:01,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:01,719 INFO L273 TraceCheckUtils]: 104: Hoare triple {62731#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62731#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:01,720 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:54:01,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:01,721 INFO L273 TraceCheckUtils]: 107: Hoare triple {62732#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62732#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:01,722 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:54:01,722 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:01,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {62733#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62733#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:01,723 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:54:01,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:01,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {62734#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62734#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:01,725 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:54:01,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:01,726 INFO L273 TraceCheckUtils]: 116: Hoare triple {62735#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62735#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:01,727 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:54:01,727 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:01,728 INFO L273 TraceCheckUtils]: 119: Hoare triple {62736#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62736#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:01,729 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:54:01,729 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:01,730 INFO L273 TraceCheckUtils]: 122: Hoare triple {62737#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62737#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:01,730 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:54:01,731 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:01,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {62738#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62738#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:01,732 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:54:01,733 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:01,733 INFO L273 TraceCheckUtils]: 128: Hoare triple {62739#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62739#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:01,734 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:54:01,734 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:01,735 INFO L273 TraceCheckUtils]: 131: Hoare triple {62740#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62740#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:01,736 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:54:01,736 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:01,737 INFO L273 TraceCheckUtils]: 134: Hoare triple {62741#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62741#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:01,737 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:54:01,738 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:01,738 INFO L273 TraceCheckUtils]: 137: Hoare triple {62742#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62742#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:01,739 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:54:01,739 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:01,740 INFO L273 TraceCheckUtils]: 140: Hoare triple {62743#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62743#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:01,741 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:54:01,741 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:01,742 INFO L273 TraceCheckUtils]: 143: Hoare triple {62744#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62744#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:01,742 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:54:01,743 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:01,743 INFO L273 TraceCheckUtils]: 146: Hoare triple {62745#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62745#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:01,744 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:54:01,744 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:01,745 INFO L273 TraceCheckUtils]: 149: Hoare triple {62746#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {62746#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:01,745 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:54:01,746 INFO L273 TraceCheckUtils]: 151: Hoare triple {62747#(<= main_~i~0 49)} assume !(~i~0 < 100000); {62698#false} is VALID [2018-11-23 11:54:01,746 INFO L273 TraceCheckUtils]: 152: Hoare triple {62698#false} assume !(0 != ~swapped~0); {62698#false} is VALID [2018-11-23 11:54:01,747 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:54:01,747 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:54:01,747 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:54:01,747 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:54:01,747 INFO L273 TraceCheckUtils]: 157: Hoare triple {62698#false} ~cond := #in~cond; {62698#false} is VALID [2018-11-23 11:54:01,747 INFO L273 TraceCheckUtils]: 158: Hoare triple {62698#false} assume 0 == ~cond; {62698#false} is VALID [2018-11-23 11:54:01,748 INFO L273 TraceCheckUtils]: 159: Hoare triple {62698#false} assume !false; {62698#false} is VALID [2018-11-23 11:54:01,764 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:54:01,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:01,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-11-23 11:54:01,783 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 11:54:01,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:01,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:54:01,962 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:54:01,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:54:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:54:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:54:01,963 INFO L87 Difference]: Start difference. First operand 309 states and 408 transitions. Second operand 52 states. [2018-11-23 11:54:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:03,124 INFO L93 Difference]: Finished difference Result 622 states and 826 transitions. [2018-11-23 11:54:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 11:54:03,124 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 160 [2018-11-23 11:54:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:54:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 245 transitions. [2018-11-23 11:54:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:54:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 245 transitions. [2018-11-23 11:54:03,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 245 transitions. [2018-11-23 11:54:03,397 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:54:03,404 INFO L225 Difference]: With dead ends: 622 [2018-11-23 11:54:03,404 INFO L226 Difference]: Without dead ends: 319 [2018-11-23 11:54:03,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:54:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-23 11:54:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-11-23 11:54:03,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:03,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand 315 states. [2018-11-23 11:54:03,589 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand 315 states. [2018-11-23 11:54:03,589 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 315 states. [2018-11-23 11:54:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:03,596 INFO L93 Difference]: Finished difference Result 319 states and 422 transitions. [2018-11-23 11:54:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 422 transitions. [2018-11-23 11:54:03,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:03,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:03,597 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand 319 states. [2018-11-23 11:54:03,597 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 319 states. [2018-11-23 11:54:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:03,603 INFO L93 Difference]: Finished difference Result 319 states and 422 transitions. [2018-11-23 11:54:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 422 transitions. [2018-11-23 11:54:03,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:03,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:03,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:03,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-23 11:54:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2018-11-23 11:54:03,609 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 416 transitions. Word has length 160 [2018-11-23 11:54:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:03,609 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 416 transitions. [2018-11-23 11:54:03,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:54:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 416 transitions. [2018-11-23 11:54:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 11:54:03,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:03,610 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:54:03,610 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:03,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -287043064, now seen corresponding path program 49 times [2018-11-23 11:54:03,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:03,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:03,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:03,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:04,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {65124#true} call ULTIMATE.init(); {65124#true} is VALID [2018-11-23 11:54:04,943 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:54:04,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {65124#true} assume true; {65124#true} is VALID [2018-11-23 11:54:04,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65124#true} {65124#true} #79#return; {65124#true} is VALID [2018-11-23 11:54:04,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {65124#true} call #t~ret8 := main(); {65124#true} is VALID [2018-11-23 11:54:04,944 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:54:04,945 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:54:04,945 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65126#(= main_~i~0 1)} is VALID [2018-11-23 11:54:04,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {65126#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65126#(= main_~i~0 1)} is VALID [2018-11-23 11:54:04,946 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:54:04,947 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:04,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {65127#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:04,947 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:54:04,948 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:04,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {65128#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:04,949 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:54:04,949 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:04,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {65129#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:04,951 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:54:04,951 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:04,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {65130#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:04,952 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:54:04,953 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:04,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {65131#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:04,954 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:54:04,954 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:04,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {65132#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:04,956 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:54:04,956 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:04,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {65133#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:04,957 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:54:04,958 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:04,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {65134#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:04,959 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:54:04,959 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:04,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {65135#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:04,961 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:54:04,961 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:04,962 INFO L273 TraceCheckUtils]: 38: Hoare triple {65136#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:04,962 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:54:04,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:04,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {65137#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:04,964 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:54:04,964 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:04,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {65138#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:04,966 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:54:04,966 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:04,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {65139#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:04,967 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:54:04,968 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:04,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {65140#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:04,969 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:54:04,970 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:04,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {65141#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:04,971 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:54:04,971 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:04,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {65142#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:04,972 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:54:04,973 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:04,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {65143#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:04,974 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:54:04,975 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:04,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {65144#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:04,976 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:54:04,976 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:04,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {65145#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:04,978 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:54:04,978 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:04,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {65146#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:04,979 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:54:04,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:04,981 INFO L273 TraceCheckUtils]: 71: Hoare triple {65147#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:04,981 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:54:04,982 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:04,982 INFO L273 TraceCheckUtils]: 74: Hoare triple {65148#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:04,983 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:54:04,984 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:04,984 INFO L273 TraceCheckUtils]: 77: Hoare triple {65149#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:04,985 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:54:04,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:04,986 INFO L273 TraceCheckUtils]: 80: Hoare triple {65150#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:04,987 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:54:04,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:04,988 INFO L273 TraceCheckUtils]: 83: Hoare triple {65151#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:04,988 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:54:04,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:04,989 INFO L273 TraceCheckUtils]: 86: Hoare triple {65152#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:04,990 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:54:04,991 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:04,991 INFO L273 TraceCheckUtils]: 89: Hoare triple {65153#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:04,992 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:54:04,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:04,993 INFO L273 TraceCheckUtils]: 92: Hoare triple {65154#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:04,994 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:54:04,994 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:04,995 INFO L273 TraceCheckUtils]: 95: Hoare triple {65155#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:04,995 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:54:04,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:04,996 INFO L273 TraceCheckUtils]: 98: Hoare triple {65156#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:04,997 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:54:04,997 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:04,998 INFO L273 TraceCheckUtils]: 101: Hoare triple {65157#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:04,999 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:54:04,999 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:05,000 INFO L273 TraceCheckUtils]: 104: Hoare triple {65158#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:05,000 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:54:05,001 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:05,001 INFO L273 TraceCheckUtils]: 107: Hoare triple {65159#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:05,002 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:54:05,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:05,003 INFO L273 TraceCheckUtils]: 110: Hoare triple {65160#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:05,004 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:54:05,004 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:05,005 INFO L273 TraceCheckUtils]: 113: Hoare triple {65161#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:05,005 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:54:05,006 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:05,006 INFO L273 TraceCheckUtils]: 116: Hoare triple {65162#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:05,007 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:54:05,008 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:05,008 INFO L273 TraceCheckUtils]: 119: Hoare triple {65163#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:05,009 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:54:05,009 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:05,010 INFO L273 TraceCheckUtils]: 122: Hoare triple {65164#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:05,011 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:54:05,011 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:05,012 INFO L273 TraceCheckUtils]: 125: Hoare triple {65165#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:05,012 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:54:05,013 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:05,013 INFO L273 TraceCheckUtils]: 128: Hoare triple {65166#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:05,014 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:54:05,015 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:05,015 INFO L273 TraceCheckUtils]: 131: Hoare triple {65167#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:05,016 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:54:05,016 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:05,017 INFO L273 TraceCheckUtils]: 134: Hoare triple {65168#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:05,018 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:54:05,018 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:05,019 INFO L273 TraceCheckUtils]: 137: Hoare triple {65169#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:05,020 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:54:05,020 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:05,021 INFO L273 TraceCheckUtils]: 140: Hoare triple {65170#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:05,021 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:54:05,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:05,022 INFO L273 TraceCheckUtils]: 143: Hoare triple {65171#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:05,023 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:54:05,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:05,024 INFO L273 TraceCheckUtils]: 146: Hoare triple {65172#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:05,025 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:54:05,025 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:05,026 INFO L273 TraceCheckUtils]: 149: Hoare triple {65173#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:05,027 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:54:05,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:05,028 INFO L273 TraceCheckUtils]: 152: Hoare triple {65174#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:05,028 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:54:05,029 INFO L273 TraceCheckUtils]: 154: Hoare triple {65175#(<= main_~i~0 50)} assume !(~i~0 < 100000); {65125#false} is VALID [2018-11-23 11:54:05,029 INFO L273 TraceCheckUtils]: 155: Hoare triple {65125#false} assume !(0 != ~swapped~0); {65125#false} is VALID [2018-11-23 11:54:05,029 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:54:05,030 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:54:05,030 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:54:05,030 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:54:05,030 INFO L273 TraceCheckUtils]: 160: Hoare triple {65125#false} ~cond := #in~cond; {65125#false} is VALID [2018-11-23 11:54:05,030 INFO L273 TraceCheckUtils]: 161: Hoare triple {65125#false} assume 0 == ~cond; {65125#false} is VALID [2018-11-23 11:54:05,030 INFO L273 TraceCheckUtils]: 162: Hoare triple {65125#false} assume !false; {65125#false} is VALID [2018-11-23 11:54:05,048 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:54:05,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:05,048 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:54:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:05,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:05,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {65124#true} call ULTIMATE.init(); {65124#true} is VALID [2018-11-23 11:54:05,629 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:54:05,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {65124#true} assume true; {65124#true} is VALID [2018-11-23 11:54:05,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65124#true} {65124#true} #79#return; {65124#true} is VALID [2018-11-23 11:54:05,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {65124#true} call #t~ret8 := main(); {65124#true} is VALID [2018-11-23 11:54:05,630 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:54:05,630 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:54:05,631 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65197#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:05,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {65197#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65197#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:05,632 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:54:05,632 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:05,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {65127#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65127#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:05,633 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:54:05,633 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:05,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {65128#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65128#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:05,634 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:54:05,635 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:05,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {65129#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65129#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:05,636 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:54:05,636 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:05,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {65130#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65130#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:05,638 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:54:05,638 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:05,639 INFO L273 TraceCheckUtils]: 23: Hoare triple {65131#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65131#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:05,639 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:54:05,640 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:05,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {65132#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65132#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:05,641 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:54:05,641 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:05,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {65133#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65133#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:05,643 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:54:05,643 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:05,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {65134#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65134#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:05,644 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:54:05,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:05,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {65135#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65135#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:05,646 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:54:05,647 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:05,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {65136#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65136#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:05,648 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:54:05,648 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:05,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {65137#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65137#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:05,650 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:54:05,650 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:05,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {65138#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65138#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:05,651 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:54:05,652 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:05,652 INFO L273 TraceCheckUtils]: 47: Hoare triple {65139#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65139#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:05,653 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:54:05,653 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:05,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {65140#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65140#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:05,654 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:54:05,655 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:05,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {65141#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65141#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:05,656 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:54:05,657 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:05,657 INFO L273 TraceCheckUtils]: 56: Hoare triple {65142#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65142#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:05,658 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:54:05,658 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:05,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {65143#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65143#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:05,660 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:54:05,660 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:05,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {65144#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65144#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:05,662 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:54:05,662 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:05,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {65145#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65145#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:05,663 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:54:05,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:05,664 INFO L273 TraceCheckUtils]: 68: Hoare triple {65146#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65146#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:05,665 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:54:05,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:05,666 INFO L273 TraceCheckUtils]: 71: Hoare triple {65147#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65147#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:05,667 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:54:05,668 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:05,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {65148#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65148#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:05,669 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:54:05,670 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:05,670 INFO L273 TraceCheckUtils]: 77: Hoare triple {65149#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65149#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:05,671 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:54:05,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:05,672 INFO L273 TraceCheckUtils]: 80: Hoare triple {65150#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65150#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:05,672 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:54:05,673 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:05,673 INFO L273 TraceCheckUtils]: 83: Hoare triple {65151#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65151#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:05,674 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:54:05,675 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:05,675 INFO L273 TraceCheckUtils]: 86: Hoare triple {65152#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65152#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:05,676 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:54:05,676 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:05,677 INFO L273 TraceCheckUtils]: 89: Hoare triple {65153#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65153#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:05,677 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:54:05,678 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:05,678 INFO L273 TraceCheckUtils]: 92: Hoare triple {65154#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65154#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:05,679 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:54:05,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:05,680 INFO L273 TraceCheckUtils]: 95: Hoare triple {65155#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65155#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:05,681 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:54:05,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:05,682 INFO L273 TraceCheckUtils]: 98: Hoare triple {65156#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65156#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:05,683 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:54:05,683 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:05,684 INFO L273 TraceCheckUtils]: 101: Hoare triple {65157#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65157#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:05,684 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:54:05,685 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:05,686 INFO L273 TraceCheckUtils]: 104: Hoare triple {65158#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65158#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:05,686 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:54:05,687 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:05,687 INFO L273 TraceCheckUtils]: 107: Hoare triple {65159#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65159#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:05,688 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:54:05,689 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:05,689 INFO L273 TraceCheckUtils]: 110: Hoare triple {65160#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65160#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:05,690 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:54:05,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:05,691 INFO L273 TraceCheckUtils]: 113: Hoare triple {65161#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65161#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:05,692 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:54:05,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:05,692 INFO L273 TraceCheckUtils]: 116: Hoare triple {65162#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65162#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:05,693 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:54:05,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:05,694 INFO L273 TraceCheckUtils]: 119: Hoare triple {65163#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65163#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:05,695 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:54:05,695 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:05,696 INFO L273 TraceCheckUtils]: 122: Hoare triple {65164#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65164#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:05,697 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:54:05,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:05,698 INFO L273 TraceCheckUtils]: 125: Hoare triple {65165#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65165#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:05,698 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:54:05,699 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:05,699 INFO L273 TraceCheckUtils]: 128: Hoare triple {65166#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65166#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:05,700 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:54:05,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:05,701 INFO L273 TraceCheckUtils]: 131: Hoare triple {65167#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65167#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:05,702 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:54:05,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:05,703 INFO L273 TraceCheckUtils]: 134: Hoare triple {65168#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65168#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:05,704 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:54:05,704 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:05,705 INFO L273 TraceCheckUtils]: 137: Hoare triple {65169#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65169#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:05,706 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:54:05,706 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:05,707 INFO L273 TraceCheckUtils]: 140: Hoare triple {65170#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65170#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:05,707 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:54:05,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:05,708 INFO L273 TraceCheckUtils]: 143: Hoare triple {65171#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65171#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:05,709 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:54:05,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:05,710 INFO L273 TraceCheckUtils]: 146: Hoare triple {65172#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65172#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:05,711 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:54:05,711 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:05,712 INFO L273 TraceCheckUtils]: 149: Hoare triple {65173#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65173#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:05,713 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:54:05,713 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:05,714 INFO L273 TraceCheckUtils]: 152: Hoare triple {65174#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {65174#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:05,714 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:54:05,715 INFO L273 TraceCheckUtils]: 154: Hoare triple {65175#(<= main_~i~0 50)} assume !(~i~0 < 100000); {65125#false} is VALID [2018-11-23 11:54:05,715 INFO L273 TraceCheckUtils]: 155: Hoare triple {65125#false} assume !(0 != ~swapped~0); {65125#false} is VALID [2018-11-23 11:54:05,715 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:54:05,716 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:54:05,716 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:54:05,716 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:54:05,716 INFO L273 TraceCheckUtils]: 160: Hoare triple {65125#false} ~cond := #in~cond; {65125#false} is VALID [2018-11-23 11:54:05,716 INFO L273 TraceCheckUtils]: 161: Hoare triple {65125#false} assume 0 == ~cond; {65125#false} is VALID [2018-11-23 11:54:05,716 INFO L273 TraceCheckUtils]: 162: Hoare triple {65125#false} assume !false; {65125#false} is VALID [2018-11-23 11:54:05,733 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:54:05,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:05,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2018-11-23 11:54:05,753 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 11:54:05,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:05,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 11:54:05,992 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:54:05,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 11:54:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 11:54:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:54:05,993 INFO L87 Difference]: Start difference. First operand 315 states and 416 transitions. Second operand 53 states. [2018-11-23 11:54:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:07,187 INFO L93 Difference]: Finished difference Result 634 states and 842 transitions. [2018-11-23 11:54:07,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 11:54:07,187 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-11-23 11:54:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:54:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 249 transitions. [2018-11-23 11:54:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:54:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 249 transitions. [2018-11-23 11:54:07,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 249 transitions. [2018-11-23 11:54:07,478 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:54:07,486 INFO L225 Difference]: With dead ends: 634 [2018-11-23 11:54:07,486 INFO L226 Difference]: Without dead ends: 325 [2018-11-23 11:54:07,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 11:54:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-23 11:54:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2018-11-23 11:54:07,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:07,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 321 states. [2018-11-23 11:54:07,638 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 321 states. [2018-11-23 11:54:07,638 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 321 states. [2018-11-23 11:54:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:07,645 INFO L93 Difference]: Finished difference Result 325 states and 430 transitions. [2018-11-23 11:54:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 430 transitions. [2018-11-23 11:54:07,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:07,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:07,646 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand 325 states. [2018-11-23 11:54:07,646 INFO L87 Difference]: Start difference. First operand 321 states. Second operand 325 states. [2018-11-23 11:54:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:07,652 INFO L93 Difference]: Finished difference Result 325 states and 430 transitions. [2018-11-23 11:54:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 430 transitions. [2018-11-23 11:54:07,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:07,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:07,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:07,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-23 11:54:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 424 transitions. [2018-11-23 11:54:07,658 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 424 transitions. Word has length 163 [2018-11-23 11:54:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:07,658 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 424 transitions. [2018-11-23 11:54:07,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 11:54:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 424 transitions. [2018-11-23 11:54:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 11:54:07,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:07,659 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:54:07,659 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:07,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1307373455, now seen corresponding path program 50 times [2018-11-23 11:54:07,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:07,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:07,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:07,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:09,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {67597#true} call ULTIMATE.init(); {67597#true} is VALID [2018-11-23 11:54:09,073 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:09,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {67597#true} assume true; {67597#true} is VALID [2018-11-23 11:54:09,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67597#true} {67597#true} #79#return; {67597#true} is VALID [2018-11-23 11:54:09,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {67597#true} call #t~ret8 := main(); {67597#true} is VALID [2018-11-23 11:54:09,074 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:09,074 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:54:09,075 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67599#(= main_~i~0 1)} is VALID [2018-11-23 11:54:09,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {67599#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67599#(= main_~i~0 1)} is VALID [2018-11-23 11:54:09,076 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:54:09,077 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:09,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {67600#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:09,078 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:09,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:09,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {67601#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:09,080 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:09,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:09,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {67602#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:09,082 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:09,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:09,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {67603#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:09,084 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:09,084 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:09,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {67604#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:09,086 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:09,086 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:09,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {67605#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:09,088 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:09,088 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:09,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {67606#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:09,089 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:09,090 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:09,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {67607#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:09,091 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:09,092 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:09,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {67608#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:09,093 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:09,094 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:09,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {67609#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:09,095 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:09,096 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:09,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {67610#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:09,097 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:09,098 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:09,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {67611#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:09,099 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:09,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:09,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {67612#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:09,101 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:09,101 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:09,102 INFO L273 TraceCheckUtils]: 50: Hoare triple {67613#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:09,103 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:09,103 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:09,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {67614#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:09,104 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:09,105 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:09,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {67615#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:09,106 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:09,107 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:09,107 INFO L273 TraceCheckUtils]: 59: Hoare triple {67616#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:09,108 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:09,108 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:09,109 INFO L273 TraceCheckUtils]: 62: Hoare triple {67617#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:09,110 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:09,110 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:09,111 INFO L273 TraceCheckUtils]: 65: Hoare triple {67618#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:09,112 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:09,112 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:09,113 INFO L273 TraceCheckUtils]: 68: Hoare triple {67619#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:09,114 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:09,114 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:09,115 INFO L273 TraceCheckUtils]: 71: Hoare triple {67620#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:09,115 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:09,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:09,117 INFO L273 TraceCheckUtils]: 74: Hoare triple {67621#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:09,117 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:09,118 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:09,118 INFO L273 TraceCheckUtils]: 77: Hoare triple {67622#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:09,119 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:09,120 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:09,120 INFO L273 TraceCheckUtils]: 80: Hoare triple {67623#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:09,121 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:09,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:09,122 INFO L273 TraceCheckUtils]: 83: Hoare triple {67624#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:09,123 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:09,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:09,124 INFO L273 TraceCheckUtils]: 86: Hoare triple {67625#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:09,125 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:09,125 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:09,126 INFO L273 TraceCheckUtils]: 89: Hoare triple {67626#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:09,127 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:09,127 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:09,128 INFO L273 TraceCheckUtils]: 92: Hoare triple {67627#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:09,128 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:09,129 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:09,129 INFO L273 TraceCheckUtils]: 95: Hoare triple {67628#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:09,130 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:09,131 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:09,131 INFO L273 TraceCheckUtils]: 98: Hoare triple {67629#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:09,132 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:09,132 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:09,133 INFO L273 TraceCheckUtils]: 101: Hoare triple {67630#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:09,134 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:09,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:09,135 INFO L273 TraceCheckUtils]: 104: Hoare triple {67631#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:09,136 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:09,136 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:09,137 INFO L273 TraceCheckUtils]: 107: Hoare triple {67632#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:09,137 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:09,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:09,138 INFO L273 TraceCheckUtils]: 110: Hoare triple {67633#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:09,139 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:09,140 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:09,140 INFO L273 TraceCheckUtils]: 113: Hoare triple {67634#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:09,141 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:09,142 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:09,142 INFO L273 TraceCheckUtils]: 116: Hoare triple {67635#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:09,143 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:09,144 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:09,144 INFO L273 TraceCheckUtils]: 119: Hoare triple {67636#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:09,145 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:09,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:09,146 INFO L273 TraceCheckUtils]: 122: Hoare triple {67637#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:09,147 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:09,147 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:09,148 INFO L273 TraceCheckUtils]: 125: Hoare triple {67638#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:09,148 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:09,149 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:09,150 INFO L273 TraceCheckUtils]: 128: Hoare triple {67639#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:09,150 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:09,151 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:09,151 INFO L273 TraceCheckUtils]: 131: Hoare triple {67640#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:09,152 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:09,153 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:09,153 INFO L273 TraceCheckUtils]: 134: Hoare triple {67641#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:09,154 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:09,154 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:09,155 INFO L273 TraceCheckUtils]: 137: Hoare triple {67642#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:09,156 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:09,156 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:09,157 INFO L273 TraceCheckUtils]: 140: Hoare triple {67643#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:09,158 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:09,158 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:09,159 INFO L273 TraceCheckUtils]: 143: Hoare triple {67644#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:09,159 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:09,160 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:09,160 INFO L273 TraceCheckUtils]: 146: Hoare triple {67645#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:09,161 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:09,162 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:09,162 INFO L273 TraceCheckUtils]: 149: Hoare triple {67646#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:09,163 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:09,164 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:09,164 INFO L273 TraceCheckUtils]: 152: Hoare triple {67647#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:09,165 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:09,165 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:09,166 INFO L273 TraceCheckUtils]: 155: Hoare triple {67648#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:09,167 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:09,167 INFO L273 TraceCheckUtils]: 157: Hoare triple {67649#(<= main_~i~0 51)} assume !(~i~0 < 100000); {67598#false} is VALID [2018-11-23 11:54:09,168 INFO L273 TraceCheckUtils]: 158: Hoare triple {67598#false} assume !(0 != ~swapped~0); {67598#false} is VALID [2018-11-23 11:54:09,168 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:09,168 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:09,168 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:09,168 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:09,168 INFO L273 TraceCheckUtils]: 163: Hoare triple {67598#false} ~cond := #in~cond; {67598#false} is VALID [2018-11-23 11:54:09,169 INFO L273 TraceCheckUtils]: 164: Hoare triple {67598#false} assume 0 == ~cond; {67598#false} is VALID [2018-11-23 11:54:09,169 INFO L273 TraceCheckUtils]: 165: Hoare triple {67598#false} assume !false; {67598#false} is VALID [2018-11-23 11:54:09,187 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:09,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:09,187 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:54:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:09,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:09,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:09,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:10,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {67597#true} call ULTIMATE.init(); {67597#true} is VALID [2018-11-23 11:54:10,957 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:10,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {67597#true} assume true; {67597#true} is VALID [2018-11-23 11:54:10,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67597#true} {67597#true} #79#return; {67597#true} is VALID [2018-11-23 11:54:10,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {67597#true} call #t~ret8 := main(); {67597#true} is VALID [2018-11-23 11:54:10,957 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:10,958 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:10,958 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67671#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:10,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {67671#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67671#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:10,959 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:10,959 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:10,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {67600#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67600#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:10,960 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:10,960 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:10,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {67601#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67601#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:10,961 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:10,962 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:10,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {67602#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67602#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:10,963 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:10,963 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:10,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {67603#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67603#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:10,965 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:10,965 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:10,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {67604#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67604#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:10,967 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:10,967 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:10,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {67605#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67605#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:10,968 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:10,969 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:10,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {67606#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67606#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:10,970 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:10,971 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:10,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {67607#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67607#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:10,972 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:10,972 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:10,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {67608#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67608#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:10,974 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:10,974 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:10,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {67609#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67609#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:10,975 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:10,976 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:10,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {67610#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67610#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:10,977 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:10,978 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:10,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {67611#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67611#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:10,979 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:10,980 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:10,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {67612#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67612#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:10,981 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:10,981 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:10,982 INFO L273 TraceCheckUtils]: 50: Hoare triple {67613#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67613#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:10,983 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:10,983 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:10,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {67614#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67614#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:10,984 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:10,985 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:10,986 INFO L273 TraceCheckUtils]: 56: Hoare triple {67615#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67615#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:10,986 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:10,987 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:10,987 INFO L273 TraceCheckUtils]: 59: Hoare triple {67616#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67616#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:10,988 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:10,989 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:10,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {67617#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67617#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:10,990 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:10,991 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:10,991 INFO L273 TraceCheckUtils]: 65: Hoare triple {67618#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67618#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:10,992 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:10,992 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:10,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {67619#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67619#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:10,994 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:10,995 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:10,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {67620#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67620#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:10,996 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:10,996 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:10,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {67621#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67621#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:10,998 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:10,998 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:10,999 INFO L273 TraceCheckUtils]: 77: Hoare triple {67622#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67622#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:10,999 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:11,000 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:11,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {67623#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67623#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:11,001 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:11,002 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:11,002 INFO L273 TraceCheckUtils]: 83: Hoare triple {67624#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67624#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:11,003 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:11,003 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:11,004 INFO L273 TraceCheckUtils]: 86: Hoare triple {67625#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67625#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:11,006 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:11,007 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:11,007 INFO L273 TraceCheckUtils]: 89: Hoare triple {67626#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67626#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:11,007 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:11,008 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:11,008 INFO L273 TraceCheckUtils]: 92: Hoare triple {67627#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67627#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:11,008 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:11,012 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:11,012 INFO L273 TraceCheckUtils]: 95: Hoare triple {67628#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67628#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:11,012 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:11,013 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:11,013 INFO L273 TraceCheckUtils]: 98: Hoare triple {67629#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67629#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:11,013 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:11,014 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:11,014 INFO L273 TraceCheckUtils]: 101: Hoare triple {67630#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67630#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:11,014 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:11,015 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:11,016 INFO L273 TraceCheckUtils]: 104: Hoare triple {67631#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67631#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:11,016 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:11,017 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:11,017 INFO L273 TraceCheckUtils]: 107: Hoare triple {67632#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67632#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:11,018 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:11,018 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:11,019 INFO L273 TraceCheckUtils]: 110: Hoare triple {67633#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67633#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:11,020 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:11,023 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:11,023 INFO L273 TraceCheckUtils]: 113: Hoare triple {67634#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67634#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:11,025 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:11,025 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:11,027 INFO L273 TraceCheckUtils]: 116: Hoare triple {67635#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67635#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:11,027 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:11,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:11,029 INFO L273 TraceCheckUtils]: 119: Hoare triple {67636#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67636#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:11,031 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:11,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:11,033 INFO L273 TraceCheckUtils]: 122: Hoare triple {67637#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67637#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:11,035 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:11,037 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:11,037 INFO L273 TraceCheckUtils]: 125: Hoare triple {67638#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67638#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:11,039 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:11,039 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:11,041 INFO L273 TraceCheckUtils]: 128: Hoare triple {67639#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67639#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:11,041 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:11,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:11,043 INFO L273 TraceCheckUtils]: 131: Hoare triple {67640#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67640#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:11,045 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:11,045 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:11,047 INFO L273 TraceCheckUtils]: 134: Hoare triple {67641#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67641#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:11,047 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:11,049 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:11,049 INFO L273 TraceCheckUtils]: 137: Hoare triple {67642#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67642#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:11,051 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:11,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:11,053 INFO L273 TraceCheckUtils]: 140: Hoare triple {67643#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67643#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:11,053 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:11,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:11,055 INFO L273 TraceCheckUtils]: 143: Hoare triple {67644#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67644#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:11,055 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:11,057 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:11,057 INFO L273 TraceCheckUtils]: 146: Hoare triple {67645#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67645#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:11,059 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:11,059 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:11,061 INFO L273 TraceCheckUtils]: 149: Hoare triple {67646#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67646#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:11,061 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:11,063 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:11,063 INFO L273 TraceCheckUtils]: 152: Hoare triple {67647#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67647#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:11,065 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:11,065 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:11,067 INFO L273 TraceCheckUtils]: 155: Hoare triple {67648#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {67648#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:11,067 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:11,069 INFO L273 TraceCheckUtils]: 157: Hoare triple {67649#(<= main_~i~0 51)} assume !(~i~0 < 100000); {67598#false} is VALID [2018-11-23 11:54:11,069 INFO L273 TraceCheckUtils]: 158: Hoare triple {67598#false} assume !(0 != ~swapped~0); {67598#false} is VALID [2018-11-23 11:54:11,069 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:11,069 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:11,069 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:11,069 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:11,069 INFO L273 TraceCheckUtils]: 163: Hoare triple {67598#false} ~cond := #in~cond; {67598#false} is VALID [2018-11-23 11:54:11,069 INFO L273 TraceCheckUtils]: 164: Hoare triple {67598#false} assume 0 == ~cond; {67598#false} is VALID [2018-11-23 11:54:11,069 INFO L273 TraceCheckUtils]: 165: Hoare triple {67598#false} assume !false; {67598#false} is VALID [2018-11-23 11:54:11,086 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:11,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:11,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-11-23 11:54:11,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 11:54:11,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:11,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:54:11,329 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:11,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:54:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:54:11,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:54:11,331 INFO L87 Difference]: Start difference. First operand 321 states and 424 transitions. Second operand 54 states. [2018-11-23 11:54:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:12,505 INFO L93 Difference]: Finished difference Result 646 states and 858 transitions. [2018-11-23 11:54:12,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 11:54:12,505 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 166 [2018-11-23 11:54:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:54:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 253 transitions. [2018-11-23 11:54:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:54:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 253 transitions. [2018-11-23 11:54:12,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 253 transitions. [2018-11-23 11:54:12,778 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:12,785 INFO L225 Difference]: With dead ends: 646 [2018-11-23 11:54:12,785 INFO L226 Difference]: Without dead ends: 331 [2018-11-23 11:54:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:54:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-23 11:54:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2018-11-23 11:54:12,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:12,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:12,931 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:12,931 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 327 states. [2018-11-23 11:54:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:12,938 INFO L93 Difference]: Finished difference Result 331 states and 438 transitions. [2018-11-23 11:54:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 438 transitions. [2018-11-23 11:54:12,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:12,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:12,939 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand 331 states. [2018-11-23 11:54:12,939 INFO L87 Difference]: Start difference. First operand 327 states. Second operand 331 states. [2018-11-23 11:54:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:12,945 INFO L93 Difference]: Finished difference Result 331 states and 438 transitions. [2018-11-23 11:54:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 438 transitions. [2018-11-23 11:54:12,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:12,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:12,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:12,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-11-23 11:54:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 432 transitions. [2018-11-23 11:54:12,951 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 432 transitions. Word has length 166 [2018-11-23 11:54:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 432 transitions. [2018-11-23 11:54:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 11:54:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 432 transitions. [2018-11-23 11:54:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-23 11:54:12,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:12,952 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:12,952 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:12,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1808469352, now seen corresponding path program 51 times [2018-11-23 11:54:12,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:12,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:12,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:14,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {70116#true} call ULTIMATE.init(); {70116#true} is VALID [2018-11-23 11:54:14,562 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:14,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {70116#true} assume true; {70116#true} is VALID [2018-11-23 11:54:14,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70116#true} {70116#true} #79#return; {70116#true} is VALID [2018-11-23 11:54:14,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {70116#true} call #t~ret8 := main(); {70116#true} is VALID [2018-11-23 11:54:14,563 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:14,563 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:14,564 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70118#(= main_~i~0 1)} is VALID [2018-11-23 11:54:14,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {70118#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70118#(= main_~i~0 1)} is VALID [2018-11-23 11:54:14,564 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:14,565 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:14,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {70119#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:14,566 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:14,566 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:14,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {70120#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:14,567 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:14,567 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:14,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {70121#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:14,568 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:14,569 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:14,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {70122#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:14,570 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:14,570 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:14,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {70123#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:14,571 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:14,572 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:14,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {70124#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:14,573 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:14,574 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:14,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {70125#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:14,575 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:14,575 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:14,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {70126#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:14,576 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:14,577 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:14,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {70127#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:14,578 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:14,579 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:14,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {70128#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:14,580 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:14,580 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:14,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {70129#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:14,582 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:14,582 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:14,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {70130#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:14,583 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:14,584 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:14,585 INFO L273 TraceCheckUtils]: 47: Hoare triple {70131#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:14,585 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:14,586 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:14,586 INFO L273 TraceCheckUtils]: 50: Hoare triple {70132#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:14,587 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:14,587 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:14,588 INFO L273 TraceCheckUtils]: 53: Hoare triple {70133#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:14,589 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:14,589 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:14,590 INFO L273 TraceCheckUtils]: 56: Hoare triple {70134#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:14,590 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:14,591 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:14,591 INFO L273 TraceCheckUtils]: 59: Hoare triple {70135#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:14,592 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:14,593 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:14,593 INFO L273 TraceCheckUtils]: 62: Hoare triple {70136#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:14,594 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:14,594 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:14,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {70137#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:14,596 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:14,596 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:14,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {70138#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:14,597 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:14,598 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:14,598 INFO L273 TraceCheckUtils]: 71: Hoare triple {70139#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:14,599 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:14,599 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:14,600 INFO L273 TraceCheckUtils]: 74: Hoare triple {70140#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:14,601 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:14,601 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:14,602 INFO L273 TraceCheckUtils]: 77: Hoare triple {70141#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:14,602 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:14,603 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:14,603 INFO L273 TraceCheckUtils]: 80: Hoare triple {70142#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:14,604 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:14,604 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:14,605 INFO L273 TraceCheckUtils]: 83: Hoare triple {70143#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:14,606 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:14,606 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:14,607 INFO L273 TraceCheckUtils]: 86: Hoare triple {70144#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:14,607 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:14,608 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:14,608 INFO L273 TraceCheckUtils]: 89: Hoare triple {70145#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:14,609 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:14,609 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:14,610 INFO L273 TraceCheckUtils]: 92: Hoare triple {70146#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:14,611 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:14,611 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:14,612 INFO L273 TraceCheckUtils]: 95: Hoare triple {70147#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:14,612 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:14,613 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:14,613 INFO L273 TraceCheckUtils]: 98: Hoare triple {70148#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:14,614 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:14,614 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:14,615 INFO L273 TraceCheckUtils]: 101: Hoare triple {70149#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:14,616 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:14,616 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:14,617 INFO L273 TraceCheckUtils]: 104: Hoare triple {70150#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:14,617 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:14,618 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:14,618 INFO L273 TraceCheckUtils]: 107: Hoare triple {70151#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:14,619 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:14,620 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:14,620 INFO L273 TraceCheckUtils]: 110: Hoare triple {70152#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:14,621 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:14,621 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:14,622 INFO L273 TraceCheckUtils]: 113: Hoare triple {70153#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:14,623 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:14,623 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:14,624 INFO L273 TraceCheckUtils]: 116: Hoare triple {70154#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:14,624 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:14,625 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:14,625 INFO L273 TraceCheckUtils]: 119: Hoare triple {70155#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:14,626 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:14,627 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:14,627 INFO L273 TraceCheckUtils]: 122: Hoare triple {70156#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:14,628 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:14,628 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:14,629 INFO L273 TraceCheckUtils]: 125: Hoare triple {70157#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:14,629 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:14,630 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:14,630 INFO L273 TraceCheckUtils]: 128: Hoare triple {70158#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:14,631 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:14,632 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:14,632 INFO L273 TraceCheckUtils]: 131: Hoare triple {70159#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:14,633 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:14,633 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:14,634 INFO L273 TraceCheckUtils]: 134: Hoare triple {70160#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:14,634 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:14,635 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:14,635 INFO L273 TraceCheckUtils]: 137: Hoare triple {70161#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:14,636 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:14,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:14,637 INFO L273 TraceCheckUtils]: 140: Hoare triple {70162#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:14,638 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:14,638 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:14,639 INFO L273 TraceCheckUtils]: 143: Hoare triple {70163#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:14,640 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:14,640 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:14,641 INFO L273 TraceCheckUtils]: 146: Hoare triple {70164#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:14,641 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:14,642 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:14,642 INFO L273 TraceCheckUtils]: 149: Hoare triple {70165#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:14,643 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:14,643 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:14,644 INFO L273 TraceCheckUtils]: 152: Hoare triple {70166#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:14,645 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:14,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:14,646 INFO L273 TraceCheckUtils]: 155: Hoare triple {70167#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:14,646 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:14,647 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:14,647 INFO L273 TraceCheckUtils]: 158: Hoare triple {70168#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:14,648 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:14,649 INFO L273 TraceCheckUtils]: 160: Hoare triple {70169#(<= main_~i~0 52)} assume !(~i~0 < 100000); {70117#false} is VALID [2018-11-23 11:54:14,649 INFO L273 TraceCheckUtils]: 161: Hoare triple {70117#false} assume !(0 != ~swapped~0); {70117#false} is VALID [2018-11-23 11:54:14,649 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:14,649 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:14,649 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:14,649 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:14,650 INFO L273 TraceCheckUtils]: 166: Hoare triple {70117#false} ~cond := #in~cond; {70117#false} is VALID [2018-11-23 11:54:14,650 INFO L273 TraceCheckUtils]: 167: Hoare triple {70117#false} assume 0 == ~cond; {70117#false} is VALID [2018-11-23 11:54:14,650 INFO L273 TraceCheckUtils]: 168: Hoare triple {70117#false} assume !false; {70117#false} is VALID [2018-11-23 11:54:14,684 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:14,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:14,685 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:14,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:14,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-11-23 11:54:14,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:14,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:15,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {70116#true} call ULTIMATE.init(); {70116#true} is VALID [2018-11-23 11:54:15,688 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:15,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {70116#true} assume true; {70116#true} is VALID [2018-11-23 11:54:15,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {70116#true} {70116#true} #79#return; {70116#true} is VALID [2018-11-23 11:54:15,689 INFO L256 TraceCheckUtils]: 4: Hoare triple {70116#true} call #t~ret8 := main(); {70116#true} is VALID [2018-11-23 11:54:15,689 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:15,690 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:15,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70191#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:15,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {70191#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70191#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:15,692 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:15,692 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:15,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {70119#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70119#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:15,693 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:15,693 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:15,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {70120#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70120#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:15,694 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:15,694 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:15,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {70121#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70121#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:15,695 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:15,696 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:15,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {70122#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70122#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:15,697 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:15,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:15,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {70123#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70123#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:15,699 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:15,700 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:15,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {70124#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70124#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:15,701 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:15,701 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:15,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {70125#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70125#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:15,703 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:15,703 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:15,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {70126#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70126#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:15,704 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:15,705 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:15,705 INFO L273 TraceCheckUtils]: 35: Hoare triple {70127#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70127#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:15,706 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:15,707 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:15,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {70128#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70128#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:15,708 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:15,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:15,709 INFO L273 TraceCheckUtils]: 41: Hoare triple {70129#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70129#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:15,710 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:15,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:15,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {70130#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70130#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:15,711 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:15,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:15,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {70131#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70131#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:15,713 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:15,714 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:15,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {70132#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70132#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:15,715 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:15,715 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:15,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {70133#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70133#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:15,717 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:15,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:15,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {70134#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70134#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:15,718 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:15,719 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:15,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {70135#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70135#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:15,720 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:15,721 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:15,721 INFO L273 TraceCheckUtils]: 62: Hoare triple {70136#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70136#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:15,722 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:15,722 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:15,723 INFO L273 TraceCheckUtils]: 65: Hoare triple {70137#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70137#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:15,724 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:15,724 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:15,725 INFO L273 TraceCheckUtils]: 68: Hoare triple {70138#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70138#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:15,725 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:15,726 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:15,726 INFO L273 TraceCheckUtils]: 71: Hoare triple {70139#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70139#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:15,727 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:15,728 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:15,728 INFO L273 TraceCheckUtils]: 74: Hoare triple {70140#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70140#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:15,729 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:15,729 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:15,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {70141#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70141#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:15,731 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:15,731 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:15,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {70142#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70142#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:15,732 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:15,733 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:15,733 INFO L273 TraceCheckUtils]: 83: Hoare triple {70143#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70143#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:15,734 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:15,735 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:15,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {70144#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70144#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:15,736 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:15,736 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:15,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {70145#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70145#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:15,738 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:15,738 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:15,739 INFO L273 TraceCheckUtils]: 92: Hoare triple {70146#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70146#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:15,740 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:15,740 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:15,741 INFO L273 TraceCheckUtils]: 95: Hoare triple {70147#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70147#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:15,741 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:15,742 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:15,742 INFO L273 TraceCheckUtils]: 98: Hoare triple {70148#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70148#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:15,743 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:15,743 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:15,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {70149#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70149#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:15,745 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:15,745 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:15,746 INFO L273 TraceCheckUtils]: 104: Hoare triple {70150#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70150#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:15,746 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:15,747 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:15,747 INFO L273 TraceCheckUtils]: 107: Hoare triple {70151#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70151#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:15,748 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:15,749 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:15,749 INFO L273 TraceCheckUtils]: 110: Hoare triple {70152#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70152#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:15,750 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:15,751 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:15,751 INFO L273 TraceCheckUtils]: 113: Hoare triple {70153#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70153#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:15,752 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:15,752 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:15,753 INFO L273 TraceCheckUtils]: 116: Hoare triple {70154#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70154#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:15,754 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:15,754 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:15,755 INFO L273 TraceCheckUtils]: 119: Hoare triple {70155#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70155#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:15,755 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:15,756 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:15,756 INFO L273 TraceCheckUtils]: 122: Hoare triple {70156#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70156#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:15,757 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:15,758 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:15,758 INFO L273 TraceCheckUtils]: 125: Hoare triple {70157#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70157#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:15,759 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:15,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:15,760 INFO L273 TraceCheckUtils]: 128: Hoare triple {70158#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70158#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:15,761 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:15,761 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:15,762 INFO L273 TraceCheckUtils]: 131: Hoare triple {70159#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70159#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:15,762 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:15,763 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:15,763 INFO L273 TraceCheckUtils]: 134: Hoare triple {70160#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70160#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:15,764 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:15,765 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:15,765 INFO L273 TraceCheckUtils]: 137: Hoare triple {70161#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70161#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:15,766 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:15,767 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:15,767 INFO L273 TraceCheckUtils]: 140: Hoare triple {70162#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70162#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:15,768 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:15,768 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:15,769 INFO L273 TraceCheckUtils]: 143: Hoare triple {70163#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70163#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:15,770 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:15,770 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:15,771 INFO L273 TraceCheckUtils]: 146: Hoare triple {70164#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70164#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:15,771 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:15,772 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:15,772 INFO L273 TraceCheckUtils]: 149: Hoare triple {70165#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70165#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:15,773 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:15,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:15,774 INFO L273 TraceCheckUtils]: 152: Hoare triple {70166#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70166#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:15,775 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:15,775 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:15,776 INFO L273 TraceCheckUtils]: 155: Hoare triple {70167#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70167#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:15,776 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:15,777 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:15,777 INFO L273 TraceCheckUtils]: 158: Hoare triple {70168#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {70168#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:15,778 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:15,779 INFO L273 TraceCheckUtils]: 160: Hoare triple {70169#(<= main_~i~0 52)} assume !(~i~0 < 100000); {70117#false} is VALID [2018-11-23 11:54:15,779 INFO L273 TraceCheckUtils]: 161: Hoare triple {70117#false} assume !(0 != ~swapped~0); {70117#false} is VALID [2018-11-23 11:54:15,779 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:15,779 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:15,779 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:15,780 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:15,780 INFO L273 TraceCheckUtils]: 166: Hoare triple {70117#false} ~cond := #in~cond; {70117#false} is VALID [2018-11-23 11:54:15,780 INFO L273 TraceCheckUtils]: 167: Hoare triple {70117#false} assume 0 == ~cond; {70117#false} is VALID [2018-11-23 11:54:15,780 INFO L273 TraceCheckUtils]: 168: Hoare triple {70117#false} assume !false; {70117#false} is VALID [2018-11-23 11:54:15,799 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:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2018-11-23 11:54:15,820 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 11:54:15,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:15,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 11:54:16,004 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:16,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 11:54:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 11:54:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:54:16,006 INFO L87 Difference]: Start difference. First operand 327 states and 432 transitions. Second operand 55 states. [2018-11-23 11:54:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:17,179 INFO L93 Difference]: Finished difference Result 658 states and 874 transitions. [2018-11-23 11:54:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 11:54:17,179 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-11-23 11:54:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:54:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 257 transitions. [2018-11-23 11:54:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:54:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 257 transitions. [2018-11-23 11:54:17,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 257 transitions. [2018-11-23 11:54:17,453 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:17,460 INFO L225 Difference]: With dead ends: 658 [2018-11-23 11:54:17,460 INFO L226 Difference]: Without dead ends: 337 [2018-11-23 11:54:17,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:54:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-23 11:54:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2018-11-23 11:54:17,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:17,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:17,623 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:17,623 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 333 states. [2018-11-23 11:54:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:17,630 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2018-11-23 11:54:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2018-11-23 11:54:17,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:17,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:17,631 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 337 states. [2018-11-23 11:54:17,631 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 337 states. [2018-11-23 11:54:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:17,636 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2018-11-23 11:54:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2018-11-23 11:54:17,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:17,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:17,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:17,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 11:54:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 440 transitions. [2018-11-23 11:54:17,643 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 440 transitions. Word has length 169 [2018-11-23 11:54:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:17,643 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 440 transitions. [2018-11-23 11:54:17,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 11:54:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 440 transitions. [2018-11-23 11:54:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 11:54:17,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:17,644 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:17,644 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:17,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1246635759, now seen corresponding path program 52 times [2018-11-23 11:54:17,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:17,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:17,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:17,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:17,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:19,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {72681#true} call ULTIMATE.init(); {72681#true} is VALID [2018-11-23 11:54:19,189 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:19,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {72681#true} assume true; {72681#true} is VALID [2018-11-23 11:54:19,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {72681#true} {72681#true} #79#return; {72681#true} is VALID [2018-11-23 11:54:19,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {72681#true} call #t~ret8 := main(); {72681#true} is VALID [2018-11-23 11:54:19,190 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:19,191 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:19,191 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72683#(= main_~i~0 1)} is VALID [2018-11-23 11:54:19,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {72683#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72683#(= main_~i~0 1)} is VALID [2018-11-23 11:54:19,192 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:19,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:19,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {72684#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:19,193 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:19,194 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:19,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {72685#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:19,195 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:19,196 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:19,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {72686#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:19,197 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:19,197 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:19,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {72687#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:19,198 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:19,199 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:19,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {72688#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:19,200 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:19,201 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:19,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {72689#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:19,202 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:19,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:19,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {72690#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:19,204 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:19,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:19,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {72691#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:19,206 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:19,206 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:19,207 INFO L273 TraceCheckUtils]: 35: Hoare triple {72692#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:19,207 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:19,208 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:19,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {72693#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:19,209 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:19,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:19,210 INFO L273 TraceCheckUtils]: 41: Hoare triple {72694#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:19,211 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:19,211 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:19,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {72695#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:19,213 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:19,213 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:19,214 INFO L273 TraceCheckUtils]: 47: Hoare triple {72696#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:19,215 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:19,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:19,216 INFO L273 TraceCheckUtils]: 50: Hoare triple {72697#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:19,216 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:19,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:19,217 INFO L273 TraceCheckUtils]: 53: Hoare triple {72698#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:19,218 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:19,219 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:19,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {72699#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:19,220 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:19,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:19,221 INFO L273 TraceCheckUtils]: 59: Hoare triple {72700#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:19,222 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:19,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:19,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {72701#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:19,224 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:19,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:19,225 INFO L273 TraceCheckUtils]: 65: Hoare triple {72702#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:19,225 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:19,226 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:19,226 INFO L273 TraceCheckUtils]: 68: Hoare triple {72703#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:19,227 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:19,228 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:19,228 INFO L273 TraceCheckUtils]: 71: Hoare triple {72704#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:19,229 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:19,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:19,230 INFO L273 TraceCheckUtils]: 74: Hoare triple {72705#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:19,230 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:19,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:19,231 INFO L273 TraceCheckUtils]: 77: Hoare triple {72706#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:19,232 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:19,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:19,233 INFO L273 TraceCheckUtils]: 80: Hoare triple {72707#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:19,234 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:19,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:19,235 INFO L273 TraceCheckUtils]: 83: Hoare triple {72708#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:19,236 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:19,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:19,237 INFO L273 TraceCheckUtils]: 86: Hoare triple {72709#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:19,237 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:19,238 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:19,239 INFO L273 TraceCheckUtils]: 89: Hoare triple {72710#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:19,239 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:19,240 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:19,240 INFO L273 TraceCheckUtils]: 92: Hoare triple {72711#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:19,241 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:19,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:19,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {72712#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:19,243 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:19,243 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:19,244 INFO L273 TraceCheckUtils]: 98: Hoare triple {72713#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:19,245 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:19,245 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:19,245 INFO L273 TraceCheckUtils]: 101: Hoare triple {72714#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:19,246 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:19,247 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:19,247 INFO L273 TraceCheckUtils]: 104: Hoare triple {72715#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:19,248 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:19,248 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:19,249 INFO L273 TraceCheckUtils]: 107: Hoare triple {72716#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:19,250 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:19,250 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:19,251 INFO L273 TraceCheckUtils]: 110: Hoare triple {72717#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:19,252 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:19,252 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:19,253 INFO L273 TraceCheckUtils]: 113: Hoare triple {72718#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:19,253 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:19,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:19,254 INFO L273 TraceCheckUtils]: 116: Hoare triple {72719#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:19,255 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:19,255 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:19,256 INFO L273 TraceCheckUtils]: 119: Hoare triple {72720#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:19,257 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:19,257 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:19,258 INFO L273 TraceCheckUtils]: 122: Hoare triple {72721#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:19,258 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:19,259 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:19,259 INFO L273 TraceCheckUtils]: 125: Hoare triple {72722#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:19,260 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:19,261 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:19,261 INFO L273 TraceCheckUtils]: 128: Hoare triple {72723#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:19,262 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:19,262 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:19,263 INFO L273 TraceCheckUtils]: 131: Hoare triple {72724#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:19,263 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:19,264 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:19,264 INFO L273 TraceCheckUtils]: 134: Hoare triple {72725#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:19,265 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:19,266 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:19,266 INFO L273 TraceCheckUtils]: 137: Hoare triple {72726#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:19,267 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:19,268 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:19,268 INFO L273 TraceCheckUtils]: 140: Hoare triple {72727#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:19,269 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:19,269 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:19,270 INFO L273 TraceCheckUtils]: 143: Hoare triple {72728#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:19,270 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:19,271 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:19,272 INFO L273 TraceCheckUtils]: 146: Hoare triple {72729#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:19,272 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:19,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:19,273 INFO L273 TraceCheckUtils]: 149: Hoare triple {72730#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:19,274 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:19,275 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:19,275 INFO L273 TraceCheckUtils]: 152: Hoare triple {72731#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:19,276 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:19,276 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:19,277 INFO L273 TraceCheckUtils]: 155: Hoare triple {72732#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:19,278 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:19,278 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:19,279 INFO L273 TraceCheckUtils]: 158: Hoare triple {72733#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:19,280 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:19,280 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:19,281 INFO L273 TraceCheckUtils]: 161: Hoare triple {72734#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:19,281 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:19,282 INFO L273 TraceCheckUtils]: 163: Hoare triple {72735#(<= main_~i~0 53)} assume !(~i~0 < 100000); {72682#false} is VALID [2018-11-23 11:54:19,282 INFO L273 TraceCheckUtils]: 164: Hoare triple {72682#false} assume !(0 != ~swapped~0); {72682#false} is VALID [2018-11-23 11:54:19,282 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:19,283 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:19,283 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:19,283 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:19,283 INFO L273 TraceCheckUtils]: 169: Hoare triple {72682#false} ~cond := #in~cond; {72682#false} is VALID [2018-11-23 11:54:19,283 INFO L273 TraceCheckUtils]: 170: Hoare triple {72682#false} assume 0 == ~cond; {72682#false} is VALID [2018-11-23 11:54:19,283 INFO L273 TraceCheckUtils]: 171: Hoare triple {72682#false} assume !false; {72682#false} is VALID [2018-11-23 11:54:19,303 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:19,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:19,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:19,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:54:19,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:54:19,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:19,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:20,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {72681#true} call ULTIMATE.init(); {72681#true} is VALID [2018-11-23 11:54:20,073 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:20,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {72681#true} assume true; {72681#true} is VALID [2018-11-23 11:54:20,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {72681#true} {72681#true} #79#return; {72681#true} is VALID [2018-11-23 11:54:20,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {72681#true} call #t~ret8 := main(); {72681#true} is VALID [2018-11-23 11:54:20,074 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:20,075 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:20,075 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72757#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:20,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {72757#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72757#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:20,076 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:20,076 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:20,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {72684#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72684#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:20,077 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:20,078 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:20,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {72685#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72685#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:20,079 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:20,080 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:20,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {72686#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72686#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:20,081 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:20,081 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:20,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {72687#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72687#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:20,083 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:20,083 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:20,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {72688#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72688#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:20,084 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:20,085 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:20,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {72689#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72689#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:20,086 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:20,087 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:20,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {72690#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72690#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:20,088 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:20,088 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:20,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {72691#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72691#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:20,090 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:20,090 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:20,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {72692#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72692#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:20,091 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:20,092 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:20,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {72693#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72693#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:20,093 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:20,093 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:20,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {72694#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72694#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:20,094 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:20,095 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:20,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {72695#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72695#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:20,096 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:20,097 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:20,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {72696#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72696#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:20,098 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:20,098 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:20,099 INFO L273 TraceCheckUtils]: 50: Hoare triple {72697#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72697#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:20,100 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:20,100 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:20,101 INFO L273 TraceCheckUtils]: 53: Hoare triple {72698#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72698#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:20,101 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:20,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:20,102 INFO L273 TraceCheckUtils]: 56: Hoare triple {72699#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72699#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:20,103 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:20,103 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:20,104 INFO L273 TraceCheckUtils]: 59: Hoare triple {72700#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72700#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:20,105 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:20,105 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:20,106 INFO L273 TraceCheckUtils]: 62: Hoare triple {72701#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72701#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:20,106 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:20,107 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:20,108 INFO L273 TraceCheckUtils]: 65: Hoare triple {72702#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72702#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:20,108 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:20,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:20,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {72703#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72703#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:20,110 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:20,111 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:20,111 INFO L273 TraceCheckUtils]: 71: Hoare triple {72704#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72704#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:20,112 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:20,112 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:20,113 INFO L273 TraceCheckUtils]: 74: Hoare triple {72705#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72705#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:20,114 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:20,114 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:20,115 INFO L273 TraceCheckUtils]: 77: Hoare triple {72706#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72706#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:20,115 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:20,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:20,116 INFO L273 TraceCheckUtils]: 80: Hoare triple {72707#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72707#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:20,117 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:20,117 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:20,118 INFO L273 TraceCheckUtils]: 83: Hoare triple {72708#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72708#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:20,119 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:20,119 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:20,120 INFO L273 TraceCheckUtils]: 86: Hoare triple {72709#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72709#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:20,121 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:20,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:20,121 INFO L273 TraceCheckUtils]: 89: Hoare triple {72710#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72710#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:20,122 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:20,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:20,123 INFO L273 TraceCheckUtils]: 92: Hoare triple {72711#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72711#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:20,124 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:20,124 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:20,125 INFO L273 TraceCheckUtils]: 95: Hoare triple {72712#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72712#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:20,126 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:20,126 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:20,127 INFO L273 TraceCheckUtils]: 98: Hoare triple {72713#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72713#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:20,127 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:20,128 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:20,128 INFO L273 TraceCheckUtils]: 101: Hoare triple {72714#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72714#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:20,129 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:20,129 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:20,130 INFO L273 TraceCheckUtils]: 104: Hoare triple {72715#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72715#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:20,131 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:20,131 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:20,131 INFO L273 TraceCheckUtils]: 107: Hoare triple {72716#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72716#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:20,132 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:20,133 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:20,133 INFO L273 TraceCheckUtils]: 110: Hoare triple {72717#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72717#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:20,134 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:20,134 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:20,135 INFO L273 TraceCheckUtils]: 113: Hoare triple {72718#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72718#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:20,136 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:20,136 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:20,137 INFO L273 TraceCheckUtils]: 116: Hoare triple {72719#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72719#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:20,137 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:20,138 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:20,138 INFO L273 TraceCheckUtils]: 119: Hoare triple {72720#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72720#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:20,139 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:20,139 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:20,140 INFO L273 TraceCheckUtils]: 122: Hoare triple {72721#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72721#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:20,141 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:20,141 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:20,142 INFO L273 TraceCheckUtils]: 125: Hoare triple {72722#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72722#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:20,142 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:20,143 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:20,143 INFO L273 TraceCheckUtils]: 128: Hoare triple {72723#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72723#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:20,144 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:20,145 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:20,145 INFO L273 TraceCheckUtils]: 131: Hoare triple {72724#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72724#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:20,146 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:20,146 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:20,147 INFO L273 TraceCheckUtils]: 134: Hoare triple {72725#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72725#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:20,148 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:20,148 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:20,149 INFO L273 TraceCheckUtils]: 137: Hoare triple {72726#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72726#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:20,149 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:20,150 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:20,150 INFO L273 TraceCheckUtils]: 140: Hoare triple {72727#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72727#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:20,151 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:20,152 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:20,152 INFO L273 TraceCheckUtils]: 143: Hoare triple {72728#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72728#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:20,153 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:20,153 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:20,154 INFO L273 TraceCheckUtils]: 146: Hoare triple {72729#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72729#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:20,154 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:20,155 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:20,156 INFO L273 TraceCheckUtils]: 149: Hoare triple {72730#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72730#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:20,156 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:20,157 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:20,157 INFO L273 TraceCheckUtils]: 152: Hoare triple {72731#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72731#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:20,158 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:20,158 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:20,159 INFO L273 TraceCheckUtils]: 155: Hoare triple {72732#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72732#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:20,160 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:20,160 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:20,161 INFO L273 TraceCheckUtils]: 158: Hoare triple {72733#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72733#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:20,161 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:20,162 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:20,162 INFO L273 TraceCheckUtils]: 161: Hoare triple {72734#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {72734#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:20,163 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:20,164 INFO L273 TraceCheckUtils]: 163: Hoare triple {72735#(<= main_~i~0 53)} assume !(~i~0 < 100000); {72682#false} is VALID [2018-11-23 11:54:20,164 INFO L273 TraceCheckUtils]: 164: Hoare triple {72682#false} assume !(0 != ~swapped~0); {72682#false} is VALID [2018-11-23 11:54:20,164 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:20,164 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:20,164 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:20,165 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:20,165 INFO L273 TraceCheckUtils]: 169: Hoare triple {72682#false} ~cond := #in~cond; {72682#false} is VALID [2018-11-23 11:54:20,165 INFO L273 TraceCheckUtils]: 170: Hoare triple {72682#false} assume 0 == ~cond; {72682#false} is VALID [2018-11-23 11:54:20,165 INFO L273 TraceCheckUtils]: 171: Hoare triple {72682#false} assume !false; {72682#false} is VALID [2018-11-23 11:54:20,184 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:20,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:20,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-11-23 11:54:20,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 11:54:20,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:20,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 11:54:20,425 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:20,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 11:54:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 11:54:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:54:20,426 INFO L87 Difference]: Start difference. First operand 333 states and 440 transitions. Second operand 56 states. [2018-11-23 11:54:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:21,682 INFO L93 Difference]: Finished difference Result 670 states and 890 transitions. [2018-11-23 11:54:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 11:54:21,683 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 172 [2018-11-23 11:54:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:54:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2018-11-23 11:54:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:54:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2018-11-23 11:54:21,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 261 transitions. [2018-11-23 11:54:21,979 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:21,987 INFO L225 Difference]: With dead ends: 670 [2018-11-23 11:54:21,987 INFO L226 Difference]: Without dead ends: 343 [2018-11-23 11:54:21,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 11:54:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-23 11:54:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2018-11-23 11:54:22,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:22,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:22,149 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:22,149 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 339 states. [2018-11-23 11:54:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:22,155 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2018-11-23 11:54:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 454 transitions. [2018-11-23 11:54:22,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:22,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:22,156 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 343 states. [2018-11-23 11:54:22,156 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 343 states. [2018-11-23 11:54:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:22,162 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2018-11-23 11:54:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 454 transitions. [2018-11-23 11:54:22,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:22,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:22,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:22,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-23 11:54:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2018-11-23 11:54:22,168 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 172 [2018-11-23 11:54:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:22,168 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2018-11-23 11:54:22,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 11:54:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2018-11-23 11:54:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 11:54:22,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:22,169 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:22,170 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:22,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1231028024, now seen corresponding path program 53 times [2018-11-23 11:54:22,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:22,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:22,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:23,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {75292#true} call ULTIMATE.init(); {75292#true} is VALID [2018-11-23 11:54:23,676 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:23,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {75292#true} assume true; {75292#true} is VALID [2018-11-23 11:54:23,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {75292#true} {75292#true} #79#return; {75292#true} is VALID [2018-11-23 11:54:23,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {75292#true} call #t~ret8 := main(); {75292#true} is VALID [2018-11-23 11:54:23,677 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:23,678 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:23,678 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75294#(= main_~i~0 1)} is VALID [2018-11-23 11:54:23,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {75294#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75294#(= main_~i~0 1)} is VALID [2018-11-23 11:54:23,679 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:23,679 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:23,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {75295#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:23,680 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:23,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:23,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {75296#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:23,681 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:23,681 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:23,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {75297#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:23,683 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:23,683 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:23,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {75298#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:23,684 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:23,685 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:23,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {75299#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:23,686 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:23,686 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:23,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {75300#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:23,688 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:23,688 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:23,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {75301#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:23,689 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:23,690 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:23,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {75302#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:23,691 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:23,691 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:23,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {75303#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:23,693 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:23,693 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:23,694 INFO L273 TraceCheckUtils]: 38: Hoare triple {75304#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:23,694 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:23,695 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:23,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {75305#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:23,696 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:23,697 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:23,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {75306#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:23,698 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:23,698 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:23,699 INFO L273 TraceCheckUtils]: 47: Hoare triple {75307#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:23,699 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:23,700 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:23,700 INFO L273 TraceCheckUtils]: 50: Hoare triple {75308#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:23,701 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:23,702 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:23,702 INFO L273 TraceCheckUtils]: 53: Hoare triple {75309#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:23,703 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:23,703 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:23,704 INFO L273 TraceCheckUtils]: 56: Hoare triple {75310#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:23,705 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:23,705 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:23,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {75311#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:23,706 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:23,707 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:23,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {75312#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:23,708 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:23,708 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:23,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {75313#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:23,710 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:23,710 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:23,711 INFO L273 TraceCheckUtils]: 68: Hoare triple {75314#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:23,711 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:23,712 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:23,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {75315#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:23,713 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:23,713 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:23,714 INFO L273 TraceCheckUtils]: 74: Hoare triple {75316#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:23,715 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:23,715 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:23,715 INFO L273 TraceCheckUtils]: 77: Hoare triple {75317#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:23,716 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:23,717 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:23,717 INFO L273 TraceCheckUtils]: 80: Hoare triple {75318#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:23,718 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:23,718 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:23,719 INFO L273 TraceCheckUtils]: 83: Hoare triple {75319#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:23,719 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:23,720 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:23,721 INFO L273 TraceCheckUtils]: 86: Hoare triple {75320#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:23,721 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:23,722 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:23,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {75321#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:23,723 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:23,723 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:23,724 INFO L273 TraceCheckUtils]: 92: Hoare triple {75322#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:23,725 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:23,725 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:23,726 INFO L273 TraceCheckUtils]: 95: Hoare triple {75323#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:23,726 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:23,727 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:23,727 INFO L273 TraceCheckUtils]: 98: Hoare triple {75324#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:23,728 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:23,729 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:23,729 INFO L273 TraceCheckUtils]: 101: Hoare triple {75325#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:23,730 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:23,730 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:23,731 INFO L273 TraceCheckUtils]: 104: Hoare triple {75326#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:23,731 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:23,732 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:23,732 INFO L273 TraceCheckUtils]: 107: Hoare triple {75327#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:23,733 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:23,733 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:23,734 INFO L273 TraceCheckUtils]: 110: Hoare triple {75328#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:23,735 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:23,735 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:23,736 INFO L273 TraceCheckUtils]: 113: Hoare triple {75329#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:23,736 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:23,737 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:23,737 INFO L273 TraceCheckUtils]: 116: Hoare triple {75330#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:23,738 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:23,739 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:23,739 INFO L273 TraceCheckUtils]: 119: Hoare triple {75331#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:23,740 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:23,740 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:23,741 INFO L273 TraceCheckUtils]: 122: Hoare triple {75332#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:23,741 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:23,742 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:23,742 INFO L273 TraceCheckUtils]: 125: Hoare triple {75333#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:23,743 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:23,744 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:23,744 INFO L273 TraceCheckUtils]: 128: Hoare triple {75334#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:23,745 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:23,745 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:23,746 INFO L273 TraceCheckUtils]: 131: Hoare triple {75335#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:23,747 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:23,747 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:23,748 INFO L273 TraceCheckUtils]: 134: Hoare triple {75336#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:23,748 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:23,749 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:23,749 INFO L273 TraceCheckUtils]: 137: Hoare triple {75337#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:23,750 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:23,750 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:23,751 INFO L273 TraceCheckUtils]: 140: Hoare triple {75338#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:23,752 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:23,752 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:23,753 INFO L273 TraceCheckUtils]: 143: Hoare triple {75339#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:23,753 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:23,754 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:23,754 INFO L273 TraceCheckUtils]: 146: Hoare triple {75340#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:23,755 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:23,756 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:23,756 INFO L273 TraceCheckUtils]: 149: Hoare triple {75341#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:23,757 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:23,757 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:23,758 INFO L273 TraceCheckUtils]: 152: Hoare triple {75342#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:23,758 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:23,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:23,759 INFO L273 TraceCheckUtils]: 155: Hoare triple {75343#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:23,760 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:23,761 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:23,761 INFO L273 TraceCheckUtils]: 158: Hoare triple {75344#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:23,762 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:23,762 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:23,763 INFO L273 TraceCheckUtils]: 161: Hoare triple {75345#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:23,764 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:23,764 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:23,765 INFO L273 TraceCheckUtils]: 164: Hoare triple {75346#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:23,765 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:23,766 INFO L273 TraceCheckUtils]: 166: Hoare triple {75347#(<= main_~i~0 54)} assume !(~i~0 < 100000); {75293#false} is VALID [2018-11-23 11:54:23,766 INFO L273 TraceCheckUtils]: 167: Hoare triple {75293#false} assume !(0 != ~swapped~0); {75293#false} is VALID [2018-11-23 11:54:23,766 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:23,767 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:23,767 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:23,767 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:23,767 INFO L273 TraceCheckUtils]: 172: Hoare triple {75293#false} ~cond := #in~cond; {75293#false} is VALID [2018-11-23 11:54:23,767 INFO L273 TraceCheckUtils]: 173: Hoare triple {75293#false} assume 0 == ~cond; {75293#false} is VALID [2018-11-23 11:54:23,767 INFO L273 TraceCheckUtils]: 174: Hoare triple {75293#false} assume !false; {75293#false} is VALID [2018-11-23 11:54:23,786 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:23,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:23,786 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:23,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:54:24,052 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 11:54:24,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:24,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:24,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {75292#true} call ULTIMATE.init(); {75292#true} is VALID [2018-11-23 11:54:24,590 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:24,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {75292#true} assume true; {75292#true} is VALID [2018-11-23 11:54:24,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {75292#true} {75292#true} #79#return; {75292#true} is VALID [2018-11-23 11:54:24,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {75292#true} call #t~ret8 := main(); {75292#true} is VALID [2018-11-23 11:54:24,591 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:24,592 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:24,593 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75369#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:24,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {75369#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75369#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:24,594 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:24,594 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:24,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {75295#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75295#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:24,595 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:24,595 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:24,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {75296#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75296#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:24,596 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:24,597 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:24,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {75297#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75297#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:24,598 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:24,599 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:24,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {75298#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75298#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:24,600 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:24,600 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:24,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {75299#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75299#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:24,602 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:24,602 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:24,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {75300#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75300#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:24,603 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:24,604 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:24,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {75301#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75301#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:24,605 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:24,605 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:24,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {75302#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75302#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:24,606 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:24,607 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:24,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {75303#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75303#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:24,608 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:24,609 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:24,609 INFO L273 TraceCheckUtils]: 38: Hoare triple {75304#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75304#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:24,610 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:24,611 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:24,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {75305#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75305#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:24,612 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:24,612 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:24,613 INFO L273 TraceCheckUtils]: 44: Hoare triple {75306#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75306#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:24,614 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:24,614 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:24,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {75307#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75307#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:24,615 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:24,616 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:24,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {75308#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75308#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:24,617 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:24,618 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:24,618 INFO L273 TraceCheckUtils]: 53: Hoare triple {75309#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75309#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:24,619 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:24,619 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:24,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {75310#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75310#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:24,620 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:24,621 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:24,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {75311#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75311#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:24,622 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:24,623 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:24,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {75312#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75312#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:24,624 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:24,624 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:24,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {75313#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75313#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:24,626 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:24,626 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:24,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {75314#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75314#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:24,627 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:24,628 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:24,629 INFO L273 TraceCheckUtils]: 71: Hoare triple {75315#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75315#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:24,629 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:24,630 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:24,630 INFO L273 TraceCheckUtils]: 74: Hoare triple {75316#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75316#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:24,631 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:24,632 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:24,632 INFO L273 TraceCheckUtils]: 77: Hoare triple {75317#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75317#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:24,633 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:24,634 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:24,634 INFO L273 TraceCheckUtils]: 80: Hoare triple {75318#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75318#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:24,635 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:24,635 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:24,636 INFO L273 TraceCheckUtils]: 83: Hoare triple {75319#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75319#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:24,637 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:24,637 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:24,638 INFO L273 TraceCheckUtils]: 86: Hoare triple {75320#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75320#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:24,638 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:24,639 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:24,639 INFO L273 TraceCheckUtils]: 89: Hoare triple {75321#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75321#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:24,640 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:24,640 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:24,641 INFO L273 TraceCheckUtils]: 92: Hoare triple {75322#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75322#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:24,642 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:24,642 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:24,643 INFO L273 TraceCheckUtils]: 95: Hoare triple {75323#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75323#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:24,643 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:24,644 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:24,644 INFO L273 TraceCheckUtils]: 98: Hoare triple {75324#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75324#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:24,645 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:24,645 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:24,646 INFO L273 TraceCheckUtils]: 101: Hoare triple {75325#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75325#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:24,647 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:24,647 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:24,648 INFO L273 TraceCheckUtils]: 104: Hoare triple {75326#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75326#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:24,648 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:24,649 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:24,649 INFO L273 TraceCheckUtils]: 107: Hoare triple {75327#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75327#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:24,650 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:24,651 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:24,651 INFO L273 TraceCheckUtils]: 110: Hoare triple {75328#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75328#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:24,652 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:24,652 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:24,653 INFO L273 TraceCheckUtils]: 113: Hoare triple {75329#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75329#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:24,654 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:24,654 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:24,655 INFO L273 TraceCheckUtils]: 116: Hoare triple {75330#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75330#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:24,656 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:24,656 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:24,656 INFO L273 TraceCheckUtils]: 119: Hoare triple {75331#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75331#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:24,657 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:24,658 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:24,658 INFO L273 TraceCheckUtils]: 122: Hoare triple {75332#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75332#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:24,659 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:24,659 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:24,660 INFO L273 TraceCheckUtils]: 125: Hoare triple {75333#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75333#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:24,660 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:24,661 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:24,661 INFO L273 TraceCheckUtils]: 128: Hoare triple {75334#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75334#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:24,662 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:24,663 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:24,663 INFO L273 TraceCheckUtils]: 131: Hoare triple {75335#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75335#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:24,664 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:24,664 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:24,665 INFO L273 TraceCheckUtils]: 134: Hoare triple {75336#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75336#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:24,665 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:24,666 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:24,667 INFO L273 TraceCheckUtils]: 137: Hoare triple {75337#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75337#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:24,667 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:24,668 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:24,668 INFO L273 TraceCheckUtils]: 140: Hoare triple {75338#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75338#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:24,669 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:24,669 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:24,670 INFO L273 TraceCheckUtils]: 143: Hoare triple {75339#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75339#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:24,671 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:24,671 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:24,672 INFO L273 TraceCheckUtils]: 146: Hoare triple {75340#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75340#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:24,672 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:24,673 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:24,674 INFO L273 TraceCheckUtils]: 149: Hoare triple {75341#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75341#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:24,674 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:24,675 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:24,675 INFO L273 TraceCheckUtils]: 152: Hoare triple {75342#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75342#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:24,676 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:24,677 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:24,677 INFO L273 TraceCheckUtils]: 155: Hoare triple {75343#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75343#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:24,678 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:24,678 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:24,679 INFO L273 TraceCheckUtils]: 158: Hoare triple {75344#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75344#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:24,680 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:24,680 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:24,681 INFO L273 TraceCheckUtils]: 161: Hoare triple {75345#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75345#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:24,681 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:24,682 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:24,682 INFO L273 TraceCheckUtils]: 164: Hoare triple {75346#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {75346#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:24,683 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:24,684 INFO L273 TraceCheckUtils]: 166: Hoare triple {75347#(<= main_~i~0 54)} assume !(~i~0 < 100000); {75293#false} is VALID [2018-11-23 11:54:24,684 INFO L273 TraceCheckUtils]: 167: Hoare triple {75293#false} assume !(0 != ~swapped~0); {75293#false} is VALID [2018-11-23 11:54:24,684 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:24,684 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:24,684 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:24,684 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:24,685 INFO L273 TraceCheckUtils]: 172: Hoare triple {75293#false} ~cond := #in~cond; {75293#false} is VALID [2018-11-23 11:54:24,685 INFO L273 TraceCheckUtils]: 173: Hoare triple {75293#false} assume 0 == ~cond; {75293#false} is VALID [2018-11-23 11:54:24,685 INFO L273 TraceCheckUtils]: 174: Hoare triple {75293#false} assume !false; {75293#false} is VALID [2018-11-23 11:54:24,704 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:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2018-11-23 11:54:24,724 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 11:54:24,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:24,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 11:54:24,929 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:24,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 11:54:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 11:54:24,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:54:24,930 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand 57 states. [2018-11-23 11:54:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,205 INFO L93 Difference]: Finished difference Result 682 states and 906 transitions. [2018-11-23 11:54:26,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 11:54:26,205 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-11-23 11:54:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:54:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 265 transitions. [2018-11-23 11:54:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:54:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 265 transitions. [2018-11-23 11:54:26,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 265 transitions. [2018-11-23 11:54:26,580 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:26,588 INFO L225 Difference]: With dead ends: 682 [2018-11-23 11:54:26,588 INFO L226 Difference]: Without dead ends: 349 [2018-11-23 11:54:26,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 11:54:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-23 11:54:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-11-23 11:54:26,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:26,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:26,766 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:26,766 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 345 states. [2018-11-23 11:54:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,774 INFO L93 Difference]: Finished difference Result 349 states and 462 transitions. [2018-11-23 11:54:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 462 transitions. [2018-11-23 11:54:26,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:26,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:26,774 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand 349 states. [2018-11-23 11:54:26,774 INFO L87 Difference]: Start difference. First operand 345 states. Second operand 349 states. [2018-11-23 11:54:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:26,780 INFO L93 Difference]: Finished difference Result 349 states and 462 transitions. [2018-11-23 11:54:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 462 transitions. [2018-11-23 11:54:26,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:26,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:26,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:26,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-23 11:54:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 456 transitions. [2018-11-23 11:54:26,787 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 456 transitions. Word has length 175 [2018-11-23 11:54:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:26,787 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 456 transitions. [2018-11-23 11:54:26,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 11:54:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2018-11-23 11:54:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-23 11:54:26,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:26,788 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:26,788 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:26,789 INFO L82 PathProgramCache]: Analyzing trace with hash -117462607, now seen corresponding path program 54 times [2018-11-23 11:54:26,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:26,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:26,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:26,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:28,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {77949#true} call ULTIMATE.init(); {77949#true} is VALID [2018-11-23 11:54:28,336 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:28,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {77949#true} assume true; {77949#true} is VALID [2018-11-23 11:54:28,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {77949#true} {77949#true} #79#return; {77949#true} is VALID [2018-11-23 11:54:28,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {77949#true} call #t~ret8 := main(); {77949#true} is VALID [2018-11-23 11:54:28,337 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:28,337 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:28,338 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77951#(= main_~i~0 1)} is VALID [2018-11-23 11:54:28,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {77951#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77951#(= main_~i~0 1)} is VALID [2018-11-23 11:54:28,340 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:28,340 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:28,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {77952#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:28,341 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:28,342 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:28,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {77953#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:28,343 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:28,344 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:28,344 INFO L273 TraceCheckUtils]: 17: Hoare triple {77954#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:28,345 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:28,346 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:28,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {77955#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:28,347 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:28,348 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:28,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {77956#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:28,349 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:28,350 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:28,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {77957#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:28,351 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:28,352 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:28,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {77958#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:28,353 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:28,353 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:28,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {77959#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:28,355 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:28,355 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:28,356 INFO L273 TraceCheckUtils]: 35: Hoare triple {77960#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:28,357 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:28,357 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:28,357 INFO L273 TraceCheckUtils]: 38: Hoare triple {77961#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:28,358 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:28,359 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:28,359 INFO L273 TraceCheckUtils]: 41: Hoare triple {77962#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:28,360 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:28,361 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:28,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {77963#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:28,362 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:28,362 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:28,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {77964#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:28,364 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:28,364 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:28,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {77965#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:28,365 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:28,366 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:28,367 INFO L273 TraceCheckUtils]: 53: Hoare triple {77966#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:28,367 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:28,368 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:28,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {77967#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:28,369 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:28,370 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:28,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {77968#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:28,371 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:28,371 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:28,372 INFO L273 TraceCheckUtils]: 62: Hoare triple {77969#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:28,373 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:28,373 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:28,374 INFO L273 TraceCheckUtils]: 65: Hoare triple {77970#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:28,374 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:28,375 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:28,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {77971#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:28,376 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:28,377 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:28,377 INFO L273 TraceCheckUtils]: 71: Hoare triple {77972#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:28,378 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:28,378 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:28,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {77973#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:28,380 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:28,380 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:28,381 INFO L273 TraceCheckUtils]: 77: Hoare triple {77974#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:28,381 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:28,382 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:28,382 INFO L273 TraceCheckUtils]: 80: Hoare triple {77975#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:28,383 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:28,384 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:28,384 INFO L273 TraceCheckUtils]: 83: Hoare triple {77976#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:28,385 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:28,386 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:28,386 INFO L273 TraceCheckUtils]: 86: Hoare triple {77977#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:28,387 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:28,387 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:28,388 INFO L273 TraceCheckUtils]: 89: Hoare triple {77978#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:28,389 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:28,389 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:28,390 INFO L273 TraceCheckUtils]: 92: Hoare triple {77979#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:28,391 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:28,391 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:28,392 INFO L273 TraceCheckUtils]: 95: Hoare triple {77980#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:28,392 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:28,393 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:28,393 INFO L273 TraceCheckUtils]: 98: Hoare triple {77981#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:28,394 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:28,395 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:28,395 INFO L273 TraceCheckUtils]: 101: Hoare triple {77982#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:28,396 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:28,396 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:28,397 INFO L273 TraceCheckUtils]: 104: Hoare triple {77983#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:28,398 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:28,398 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:28,398 INFO L273 TraceCheckUtils]: 107: Hoare triple {77984#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:28,399 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:28,400 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:28,400 INFO L273 TraceCheckUtils]: 110: Hoare triple {77985#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:28,401 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:28,402 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:28,402 INFO L273 TraceCheckUtils]: 113: Hoare triple {77986#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:28,403 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:28,403 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:28,404 INFO L273 TraceCheckUtils]: 116: Hoare triple {77987#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:28,405 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:28,405 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:28,406 INFO L273 TraceCheckUtils]: 119: Hoare triple {77988#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:28,406 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:28,407 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:28,407 INFO L273 TraceCheckUtils]: 122: Hoare triple {77989#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:28,408 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:28,408 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:28,409 INFO L273 TraceCheckUtils]: 125: Hoare triple {77990#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:28,410 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:28,410 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:28,411 INFO L273 TraceCheckUtils]: 128: Hoare triple {77991#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:28,411 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:28,412 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:28,412 INFO L273 TraceCheckUtils]: 131: Hoare triple {77992#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:28,413 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:28,414 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:28,414 INFO L273 TraceCheckUtils]: 134: Hoare triple {77993#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:28,415 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:28,415 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:28,416 INFO L273 TraceCheckUtils]: 137: Hoare triple {77994#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:28,417 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:28,417 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:28,418 INFO L273 TraceCheckUtils]: 140: Hoare triple {77995#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:28,418 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:28,419 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:28,419 INFO L273 TraceCheckUtils]: 143: Hoare triple {77996#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:28,420 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:28,421 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:28,421 INFO L273 TraceCheckUtils]: 146: Hoare triple {77997#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:28,422 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:28,422 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:28,423 INFO L273 TraceCheckUtils]: 149: Hoare triple {77998#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:28,424 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:28,424 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:28,425 INFO L273 TraceCheckUtils]: 152: Hoare triple {77999#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:28,425 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:28,426 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:28,426 INFO L273 TraceCheckUtils]: 155: Hoare triple {78000#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:28,427 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:28,428 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:28,428 INFO L273 TraceCheckUtils]: 158: Hoare triple {78001#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:28,429 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:28,429 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:28,430 INFO L273 TraceCheckUtils]: 161: Hoare triple {78002#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:28,431 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:28,431 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:28,432 INFO L273 TraceCheckUtils]: 164: Hoare triple {78003#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:28,432 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:28,433 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:28,433 INFO L273 TraceCheckUtils]: 167: Hoare triple {78004#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:28,434 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:28,435 INFO L273 TraceCheckUtils]: 169: Hoare triple {78005#(<= main_~i~0 55)} assume !(~i~0 < 100000); {77950#false} is VALID [2018-11-23 11:54:28,435 INFO L273 TraceCheckUtils]: 170: Hoare triple {77950#false} assume !(0 != ~swapped~0); {77950#false} is VALID [2018-11-23 11:54:28,435 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:28,435 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:28,436 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:28,436 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:28,436 INFO L273 TraceCheckUtils]: 175: Hoare triple {77950#false} ~cond := #in~cond; {77950#false} is VALID [2018-11-23 11:54:28,436 INFO L273 TraceCheckUtils]: 176: Hoare triple {77950#false} assume 0 == ~cond; {77950#false} is VALID [2018-11-23 11:54:28,436 INFO L273 TraceCheckUtils]: 177: Hoare triple {77950#false} assume !false; {77950#false} is VALID [2018-11-23 11:54:28,457 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:28,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:28,457 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:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:54:28,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-11-23 11:54:28,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:28,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:30,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {77949#true} call ULTIMATE.init(); {77949#true} is VALID [2018-11-23 11:54:30,186 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:30,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {77949#true} assume true; {77949#true} is VALID [2018-11-23 11:54:30,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {77949#true} {77949#true} #79#return; {77949#true} is VALID [2018-11-23 11:54:30,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {77949#true} call #t~ret8 := main(); {77949#true} is VALID [2018-11-23 11:54:30,187 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:30,187 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:30,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78027#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {78027#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78027#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:30,188 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:30,189 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {77952#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77952#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:30,189 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:30,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {77953#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77953#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:30,191 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:30,192 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {77954#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77954#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:30,193 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:30,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {77955#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77955#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:30,195 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:30,195 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {77956#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77956#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:30,196 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:30,197 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {77957#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77957#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:30,198 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:30,198 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {77958#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77958#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:30,200 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:30,200 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {77959#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77959#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:30,201 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:30,202 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {77960#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77960#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:30,203 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:30,204 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:30,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {77961#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77961#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:30,205 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:30,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:30,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {77962#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77962#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:30,206 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:30,207 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:30,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {77963#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77963#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:30,208 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:30,209 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:30,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {77964#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77964#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:30,210 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:30,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:30,211 INFO L273 TraceCheckUtils]: 50: Hoare triple {77965#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77965#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:30,212 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:30,212 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:30,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {77966#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77966#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:30,213 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:30,214 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:30,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {77967#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77967#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:30,215 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:30,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:30,216 INFO L273 TraceCheckUtils]: 59: Hoare triple {77968#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77968#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:30,217 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:30,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:30,218 INFO L273 TraceCheckUtils]: 62: Hoare triple {77969#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77969#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:30,218 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:30,219 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:30,219 INFO L273 TraceCheckUtils]: 65: Hoare triple {77970#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77970#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:30,220 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:30,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:30,221 INFO L273 TraceCheckUtils]: 68: Hoare triple {77971#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77971#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:30,222 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:30,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:30,223 INFO L273 TraceCheckUtils]: 71: Hoare triple {77972#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77972#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:30,224 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:30,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:30,225 INFO L273 TraceCheckUtils]: 74: Hoare triple {77973#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77973#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:30,225 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:30,226 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:30,226 INFO L273 TraceCheckUtils]: 77: Hoare triple {77974#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77974#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:30,227 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:30,228 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:30,228 INFO L273 TraceCheckUtils]: 80: Hoare triple {77975#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77975#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:30,229 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:30,230 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:30,230 INFO L273 TraceCheckUtils]: 83: Hoare triple {77976#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77976#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:30,231 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:30,231 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:30,232 INFO L273 TraceCheckUtils]: 86: Hoare triple {77977#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77977#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:30,233 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:30,233 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:30,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {77978#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77978#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:30,235 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:30,235 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:30,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {77979#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77979#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:30,236 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:30,237 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:30,237 INFO L273 TraceCheckUtils]: 95: Hoare triple {77980#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77980#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:30,238 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:30,239 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:30,239 INFO L273 TraceCheckUtils]: 98: Hoare triple {77981#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77981#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:30,240 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:30,240 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:30,241 INFO L273 TraceCheckUtils]: 101: Hoare triple {77982#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77982#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:30,242 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:30,242 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:30,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {77983#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77983#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:30,244 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:30,244 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:30,245 INFO L273 TraceCheckUtils]: 107: Hoare triple {77984#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77984#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:30,245 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:30,246 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:30,246 INFO L273 TraceCheckUtils]: 110: Hoare triple {77985#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77985#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:30,247 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:30,248 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:30,248 INFO L273 TraceCheckUtils]: 113: Hoare triple {77986#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77986#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:30,249 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:30,249 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:30,250 INFO L273 TraceCheckUtils]: 116: Hoare triple {77987#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77987#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:30,250 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:30,251 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:30,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {77988#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77988#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:30,252 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:30,253 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:30,253 INFO L273 TraceCheckUtils]: 122: Hoare triple {77989#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77989#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:30,254 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:30,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:30,255 INFO L273 TraceCheckUtils]: 125: Hoare triple {77990#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77990#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:30,256 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:30,256 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:30,257 INFO L273 TraceCheckUtils]: 128: Hoare triple {77991#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77991#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:30,257 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:30,258 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:30,258 INFO L273 TraceCheckUtils]: 131: Hoare triple {77992#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77992#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:30,259 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:30,259 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:30,260 INFO L273 TraceCheckUtils]: 134: Hoare triple {77993#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77993#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:30,261 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:30,261 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:30,262 INFO L273 TraceCheckUtils]: 137: Hoare triple {77994#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77994#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:30,262 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:30,263 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:30,264 INFO L273 TraceCheckUtils]: 140: Hoare triple {77995#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77995#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:30,264 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:30,265 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:30,265 INFO L273 TraceCheckUtils]: 143: Hoare triple {77996#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77996#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:30,266 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:30,267 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:30,267 INFO L273 TraceCheckUtils]: 146: Hoare triple {77997#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77997#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:30,268 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:30,268 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:30,269 INFO L273 TraceCheckUtils]: 149: Hoare triple {77998#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77998#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:30,269 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:30,270 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:30,271 INFO L273 TraceCheckUtils]: 152: Hoare triple {77999#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {77999#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:30,271 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:30,272 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:30,272 INFO L273 TraceCheckUtils]: 155: Hoare triple {78000#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78000#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:30,273 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:30,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:30,274 INFO L273 TraceCheckUtils]: 158: Hoare triple {78001#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78001#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:30,275 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:30,275 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:30,275 INFO L273 TraceCheckUtils]: 161: Hoare triple {78002#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78002#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:30,276 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:30,277 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:30,277 INFO L273 TraceCheckUtils]: 164: Hoare triple {78003#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78003#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:30,278 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:30,279 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:30,279 INFO L273 TraceCheckUtils]: 167: Hoare triple {78004#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {78004#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:30,280 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:30,280 INFO L273 TraceCheckUtils]: 169: Hoare triple {78005#(<= main_~i~0 55)} assume !(~i~0 < 100000); {77950#false} is VALID [2018-11-23 11:54:30,281 INFO L273 TraceCheckUtils]: 170: Hoare triple {77950#false} assume !(0 != ~swapped~0); {77950#false} is VALID [2018-11-23 11:54:30,281 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:30,281 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:30,281 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:30,281 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:30,281 INFO L273 TraceCheckUtils]: 175: Hoare triple {77950#false} ~cond := #in~cond; {77950#false} is VALID [2018-11-23 11:54:30,282 INFO L273 TraceCheckUtils]: 176: Hoare triple {77950#false} assume 0 == ~cond; {77950#false} is VALID [2018-11-23 11:54:30,282 INFO L273 TraceCheckUtils]: 177: Hoare triple {77950#false} assume !false; {77950#false} is VALID [2018-11-23 11:54:30,302 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:30,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:30,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-11-23 11:54:30,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 11:54:30,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:30,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 11:54:30,512 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:30,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 11:54:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 11:54:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:54:30,514 INFO L87 Difference]: Start difference. First operand 345 states and 456 transitions. Second operand 58 states. [2018-11-23 11:54:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:31,990 INFO L93 Difference]: Finished difference Result 694 states and 922 transitions. [2018-11-23 11:54:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 11:54:31,991 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 178 [2018-11-23 11:54:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:54:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 269 transitions. [2018-11-23 11:54:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:54:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 269 transitions. [2018-11-23 11:54:31,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 269 transitions. [2018-11-23 11:54:32,300 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:32,308 INFO L225 Difference]: With dead ends: 694 [2018-11-23 11:54:32,308 INFO L226 Difference]: Without dead ends: 355 [2018-11-23 11:54:32,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 11:54:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-23 11:54:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-11-23 11:54:32,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:32,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:32,446 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:32,447 INFO L87 Difference]: Start difference. First operand 355 states. Second operand 351 states. [2018-11-23 11:54:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,455 INFO L93 Difference]: Finished difference Result 355 states and 470 transitions. [2018-11-23 11:54:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 470 transitions. [2018-11-23 11:54:32,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,455 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand 355 states. [2018-11-23 11:54:32,455 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 355 states. [2018-11-23 11:54:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:32,462 INFO L93 Difference]: Finished difference Result 355 states and 470 transitions. [2018-11-23 11:54:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 470 transitions. [2018-11-23 11:54:32,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:32,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:32,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:32,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-23 11:54:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 464 transitions. [2018-11-23 11:54:32,469 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 464 transitions. Word has length 178 [2018-11-23 11:54:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:32,469 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 464 transitions. [2018-11-23 11:54:32,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 11:54:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 464 transitions. [2018-11-23 11:54:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-23 11:54:32,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:32,471 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:32,471 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:32,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -217519064, now seen corresponding path program 55 times [2018-11-23 11:54:32,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {80652#true} call ULTIMATE.init(); {80652#true} is VALID [2018-11-23 11:54:34,239 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:34,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {80652#true} assume true; {80652#true} is VALID [2018-11-23 11:54:34,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {80652#true} {80652#true} #79#return; {80652#true} is VALID [2018-11-23 11:54:34,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {80652#true} call #t~ret8 := main(); {80652#true} is VALID [2018-11-23 11:54:34,239 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:34,240 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:34,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80654#(= main_~i~0 1)} is VALID [2018-11-23 11:54:34,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {80654#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80654#(= main_~i~0 1)} is VALID [2018-11-23 11:54:34,242 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:34,242 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {80655#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:34,243 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:34,244 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {80656#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:34,245 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:34,246 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {80657#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:34,247 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:34,247 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {80658#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:34,249 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:34,249 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {80659#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:34,250 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:34,251 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {80660#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:34,252 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:34,252 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {80661#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:34,254 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:34,254 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {80662#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:34,255 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:34,256 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {80663#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:34,257 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:34,258 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {80664#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:34,259 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:34,259 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {80665#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:34,260 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:34,261 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {80666#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:34,262 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:34,263 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,263 INFO L273 TraceCheckUtils]: 47: Hoare triple {80667#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:34,264 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:34,264 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {80668#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:34,265 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:34,266 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {80669#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:34,267 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:34,268 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,268 INFO L273 TraceCheckUtils]: 56: Hoare triple {80670#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:34,269 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:34,269 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,270 INFO L273 TraceCheckUtils]: 59: Hoare triple {80671#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:34,271 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:34,271 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,271 INFO L273 TraceCheckUtils]: 62: Hoare triple {80672#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:34,272 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:34,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,273 INFO L273 TraceCheckUtils]: 65: Hoare triple {80673#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:34,274 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:34,274 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {80674#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:34,276 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:34,276 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {80675#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:34,277 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:34,278 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {80676#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:34,279 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:34,279 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,280 INFO L273 TraceCheckUtils]: 77: Hoare triple {80677#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:34,281 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:34,281 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,282 INFO L273 TraceCheckUtils]: 80: Hoare triple {80678#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:34,282 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:34,283 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,283 INFO L273 TraceCheckUtils]: 83: Hoare triple {80679#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:34,284 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:34,285 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,285 INFO L273 TraceCheckUtils]: 86: Hoare triple {80680#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:34,286 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:34,286 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,287 INFO L273 TraceCheckUtils]: 89: Hoare triple {80681#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:34,287 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:34,288 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {80682#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:34,289 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:34,290 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,290 INFO L273 TraceCheckUtils]: 95: Hoare triple {80683#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:34,291 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:34,291 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,292 INFO L273 TraceCheckUtils]: 98: Hoare triple {80684#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:34,293 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:34,293 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,294 INFO L273 TraceCheckUtils]: 101: Hoare triple {80685#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:34,294 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:34,295 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,295 INFO L273 TraceCheckUtils]: 104: Hoare triple {80686#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:34,296 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:34,296 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,297 INFO L273 TraceCheckUtils]: 107: Hoare triple {80687#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:34,298 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:34,298 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,299 INFO L273 TraceCheckUtils]: 110: Hoare triple {80688#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:34,299 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:34,300 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,300 INFO L273 TraceCheckUtils]: 113: Hoare triple {80689#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:34,301 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:34,302 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,302 INFO L273 TraceCheckUtils]: 116: Hoare triple {80690#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:34,303 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:34,303 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,304 INFO L273 TraceCheckUtils]: 119: Hoare triple {80691#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:34,305 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:34,305 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,306 INFO L273 TraceCheckUtils]: 122: Hoare triple {80692#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:34,307 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:34,307 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,308 INFO L273 TraceCheckUtils]: 125: Hoare triple {80693#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:34,308 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:34,309 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,309 INFO L273 TraceCheckUtils]: 128: Hoare triple {80694#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:34,310 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:34,311 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,311 INFO L273 TraceCheckUtils]: 131: Hoare triple {80695#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:34,312 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:34,312 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,313 INFO L273 TraceCheckUtils]: 134: Hoare triple {80696#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:34,314 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:34,314 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,315 INFO L273 TraceCheckUtils]: 137: Hoare triple {80697#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:34,315 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:34,316 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,316 INFO L273 TraceCheckUtils]: 140: Hoare triple {80698#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:34,317 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:34,317 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,318 INFO L273 TraceCheckUtils]: 143: Hoare triple {80699#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:34,319 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:34,319 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,320 INFO L273 TraceCheckUtils]: 146: Hoare triple {80700#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:34,320 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:34,321 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,321 INFO L273 TraceCheckUtils]: 149: Hoare triple {80701#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:34,322 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:34,323 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,323 INFO L273 TraceCheckUtils]: 152: Hoare triple {80702#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:34,324 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:34,324 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,325 INFO L273 TraceCheckUtils]: 155: Hoare triple {80703#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:34,325 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:34,326 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,326 INFO L273 TraceCheckUtils]: 158: Hoare triple {80704#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:34,327 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:34,328 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,328 INFO L273 TraceCheckUtils]: 161: Hoare triple {80705#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:34,329 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:34,329 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,330 INFO L273 TraceCheckUtils]: 164: Hoare triple {80706#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:34,330 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:34,331 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,332 INFO L273 TraceCheckUtils]: 167: Hoare triple {80707#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:34,332 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:34,333 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,333 INFO L273 TraceCheckUtils]: 170: Hoare triple {80708#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:34,334 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:34,335 INFO L273 TraceCheckUtils]: 172: Hoare triple {80709#(<= main_~i~0 56)} assume !(~i~0 < 100000); {80653#false} is VALID [2018-11-23 11:54:34,335 INFO L273 TraceCheckUtils]: 173: Hoare triple {80653#false} assume !(0 != ~swapped~0); {80653#false} is VALID [2018-11-23 11:54:34,335 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:34,335 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:34,335 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:34,336 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:34,336 INFO L273 TraceCheckUtils]: 178: Hoare triple {80653#false} ~cond := #in~cond; {80653#false} is VALID [2018-11-23 11:54:34,336 INFO L273 TraceCheckUtils]: 179: Hoare triple {80653#false} assume 0 == ~cond; {80653#false} is VALID [2018-11-23 11:54:34,336 INFO L273 TraceCheckUtils]: 180: Hoare triple {80653#false} assume !false; {80653#false} is VALID [2018-11-23 11:54:34,357 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:34,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:34,357 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:34,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:34,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:35,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {80652#true} call ULTIMATE.init(); {80652#true} is VALID [2018-11-23 11:54:35,097 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:35,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {80652#true} assume true; {80652#true} is VALID [2018-11-23 11:54:35,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {80652#true} {80652#true} #79#return; {80652#true} is VALID [2018-11-23 11:54:35,098 INFO L256 TraceCheckUtils]: 4: Hoare triple {80652#true} call #t~ret8 := main(); {80652#true} is VALID [2018-11-23 11:54:35,098 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:35,099 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:35,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80731#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:35,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {80731#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80731#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:35,100 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:35,101 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:35,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {80655#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80655#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:35,101 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:35,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:35,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {80656#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80656#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:35,103 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:35,103 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:35,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {80657#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80657#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:35,104 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:35,105 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:35,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {80658#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80658#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:35,106 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:35,107 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:35,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {80659#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80659#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:35,108 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:35,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:35,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {80660#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80660#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:35,110 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:35,110 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:35,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {80661#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80661#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:35,112 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:35,112 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:35,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {80662#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80662#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:35,113 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:35,114 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:35,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {80663#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80663#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:35,115 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:35,116 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:35,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {80664#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80664#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:35,117 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:35,117 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:35,118 INFO L273 TraceCheckUtils]: 41: Hoare triple {80665#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80665#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:35,119 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:35,119 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:35,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {80666#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80666#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:35,120 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:35,121 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:35,121 INFO L273 TraceCheckUtils]: 47: Hoare triple {80667#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80667#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:35,122 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:35,123 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:35,123 INFO L273 TraceCheckUtils]: 50: Hoare triple {80668#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80668#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:35,124 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:35,124 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:35,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {80669#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80669#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:35,126 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:35,126 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:35,127 INFO L273 TraceCheckUtils]: 56: Hoare triple {80670#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80670#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:35,127 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:35,128 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:35,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {80671#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80671#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:35,129 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:35,130 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:35,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {80672#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80672#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:35,131 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:35,132 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:35,132 INFO L273 TraceCheckUtils]: 65: Hoare triple {80673#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80673#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:35,133 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:35,133 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:35,134 INFO L273 TraceCheckUtils]: 68: Hoare triple {80674#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80674#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:35,135 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:35,135 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:35,136 INFO L273 TraceCheckUtils]: 71: Hoare triple {80675#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80675#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:35,136 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:35,137 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:35,137 INFO L273 TraceCheckUtils]: 74: Hoare triple {80676#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80676#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:35,138 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:35,139 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:35,139 INFO L273 TraceCheckUtils]: 77: Hoare triple {80677#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80677#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:35,140 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:35,140 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:35,141 INFO L273 TraceCheckUtils]: 80: Hoare triple {80678#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80678#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:35,142 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:35,142 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:35,143 INFO L273 TraceCheckUtils]: 83: Hoare triple {80679#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80679#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:35,143 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:35,144 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:35,144 INFO L273 TraceCheckUtils]: 86: Hoare triple {80680#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80680#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:35,145 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:35,146 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:35,146 INFO L273 TraceCheckUtils]: 89: Hoare triple {80681#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80681#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:35,147 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:35,147 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:35,148 INFO L273 TraceCheckUtils]: 92: Hoare triple {80682#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80682#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:35,149 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:35,149 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:35,150 INFO L273 TraceCheckUtils]: 95: Hoare triple {80683#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80683#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:35,150 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:35,151 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:35,151 INFO L273 TraceCheckUtils]: 98: Hoare triple {80684#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80684#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:35,152 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:35,153 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:35,153 INFO L273 TraceCheckUtils]: 101: Hoare triple {80685#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80685#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:35,154 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:35,154 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:35,155 INFO L273 TraceCheckUtils]: 104: Hoare triple {80686#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80686#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:35,156 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:35,156 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:35,157 INFO L273 TraceCheckUtils]: 107: Hoare triple {80687#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80687#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:35,157 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:35,158 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:35,159 INFO L273 TraceCheckUtils]: 110: Hoare triple {80688#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80688#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:35,159 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:35,160 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:35,160 INFO L273 TraceCheckUtils]: 113: Hoare triple {80689#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80689#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:35,161 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:35,162 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:35,162 INFO L273 TraceCheckUtils]: 116: Hoare triple {80690#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80690#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:35,163 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:35,163 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:35,164 INFO L273 TraceCheckUtils]: 119: Hoare triple {80691#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80691#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:35,165 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:35,165 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:35,166 INFO L273 TraceCheckUtils]: 122: Hoare triple {80692#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80692#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:35,166 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:35,167 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:35,167 INFO L273 TraceCheckUtils]: 125: Hoare triple {80693#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80693#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:35,168 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:35,169 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:35,169 INFO L273 TraceCheckUtils]: 128: Hoare triple {80694#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80694#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:35,170 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:35,170 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:35,171 INFO L273 TraceCheckUtils]: 131: Hoare triple {80695#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80695#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:35,171 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:35,172 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:35,173 INFO L273 TraceCheckUtils]: 134: Hoare triple {80696#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80696#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:35,173 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:35,174 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:35,174 INFO L273 TraceCheckUtils]: 137: Hoare triple {80697#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80697#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:35,175 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:35,176 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:35,176 INFO L273 TraceCheckUtils]: 140: Hoare triple {80698#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80698#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:35,177 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:35,177 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:35,178 INFO L273 TraceCheckUtils]: 143: Hoare triple {80699#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80699#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:35,178 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:35,179 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:35,179 INFO L273 TraceCheckUtils]: 146: Hoare triple {80700#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80700#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:35,180 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:35,181 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:35,181 INFO L273 TraceCheckUtils]: 149: Hoare triple {80701#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80701#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:35,182 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:35,183 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:35,183 INFO L273 TraceCheckUtils]: 152: Hoare triple {80702#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80702#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:35,184 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:35,184 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:35,185 INFO L273 TraceCheckUtils]: 155: Hoare triple {80703#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80703#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:35,186 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:35,186 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:35,187 INFO L273 TraceCheckUtils]: 158: Hoare triple {80704#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80704#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:35,187 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:35,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:35,188 INFO L273 TraceCheckUtils]: 161: Hoare triple {80705#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80705#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:35,189 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:35,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:35,190 INFO L273 TraceCheckUtils]: 164: Hoare triple {80706#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80706#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:35,191 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:35,191 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:35,192 INFO L273 TraceCheckUtils]: 167: Hoare triple {80707#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80707#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:35,193 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:35,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:35,194 INFO L273 TraceCheckUtils]: 170: Hoare triple {80708#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {80708#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:35,194 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:35,195 INFO L273 TraceCheckUtils]: 172: Hoare triple {80709#(<= main_~i~0 56)} assume !(~i~0 < 100000); {80653#false} is VALID [2018-11-23 11:54:35,195 INFO L273 TraceCheckUtils]: 173: Hoare triple {80653#false} assume !(0 != ~swapped~0); {80653#false} is VALID [2018-11-23 11:54:35,195 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:35,195 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:35,196 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:35,196 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:35,196 INFO L273 TraceCheckUtils]: 178: Hoare triple {80653#false} ~cond := #in~cond; {80653#false} is VALID [2018-11-23 11:54:35,196 INFO L273 TraceCheckUtils]: 179: Hoare triple {80653#false} assume 0 == ~cond; {80653#false} is VALID [2018-11-23 11:54:35,196 INFO L273 TraceCheckUtils]: 180: Hoare triple {80653#false} assume !false; {80653#false} is VALID [2018-11-23 11:54:35,217 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:35,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:35,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2018-11-23 11:54:35,237 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 11:54:35,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:35,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2018-11-23 11:54:35,435 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:35,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 11:54:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 11:54:35,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:54:35,437 INFO L87 Difference]: Start difference. First operand 351 states and 464 transitions. Second operand 59 states. [2018-11-23 11:54:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:36,938 INFO L93 Difference]: Finished difference Result 706 states and 938 transitions. [2018-11-23 11:54:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 11:54:36,939 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-11-23 11:54:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:54:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 273 transitions. [2018-11-23 11:54:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:54:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 273 transitions. [2018-11-23 11:54:36,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 273 transitions. [2018-11-23 11:54:37,232 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:37,240 INFO L225 Difference]: With dead ends: 706 [2018-11-23 11:54:37,240 INFO L226 Difference]: Without dead ends: 361 [2018-11-23 11:54:37,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 11:54:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-23 11:54:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2018-11-23 11:54:37,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:37,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:37,430 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:37,430 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 357 states. [2018-11-23 11:54:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:37,438 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2018-11-23 11:54:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 478 transitions. [2018-11-23 11:54:37,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:37,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:37,439 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand 361 states. [2018-11-23 11:54:37,439 INFO L87 Difference]: Start difference. First operand 357 states. Second operand 361 states. [2018-11-23 11:54:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:37,445 INFO L93 Difference]: Finished difference Result 361 states and 478 transitions. [2018-11-23 11:54:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 478 transitions. [2018-11-23 11:54:37,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:37,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:37,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:37,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-23 11:54:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 472 transitions. [2018-11-23 11:54:37,452 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 472 transitions. Word has length 181 [2018-11-23 11:54:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:37,453 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 472 transitions. [2018-11-23 11:54:37,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 11:54:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 472 transitions. [2018-11-23 11:54:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 11:54:37,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:37,454 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:37,454 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -292126127, now seen corresponding path program 56 times [2018-11-23 11:54:37,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:37,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:54:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:39,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {83401#true} call ULTIMATE.init(); {83401#true} is VALID [2018-11-23 11:54:39,180 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:39,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {83401#true} assume true; {83401#true} is VALID [2018-11-23 11:54:39,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83401#true} {83401#true} #79#return; {83401#true} is VALID [2018-11-23 11:54:39,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {83401#true} call #t~ret8 := main(); {83401#true} is VALID [2018-11-23 11:54:39,180 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:39,181 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:39,182 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83403#(= main_~i~0 1)} is VALID [2018-11-23 11:54:39,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {83403#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83403#(= main_~i~0 1)} is VALID [2018-11-23 11:54:39,183 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:39,183 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:39,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {83404#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:39,184 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:39,185 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:39,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {83405#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:39,186 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:39,187 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:39,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {83406#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:39,188 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:39,188 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:39,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {83407#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:39,189 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:39,190 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:39,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {83408#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:39,191 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:39,192 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:39,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {83409#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:39,193 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:39,193 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:39,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {83410#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:39,194 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:39,195 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:39,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {83411#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:39,196 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:39,197 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:39,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {83412#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:39,198 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:39,198 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:39,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {83413#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:39,199 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:39,200 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:39,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {83414#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:39,201 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:39,202 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:39,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {83415#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:39,203 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:39,203 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:39,204 INFO L273 TraceCheckUtils]: 47: Hoare triple {83416#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:39,205 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:39,205 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:39,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {83417#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:39,206 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:39,207 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:39,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {83418#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:39,208 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:39,209 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:39,209 INFO L273 TraceCheckUtils]: 56: Hoare triple {83419#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:39,210 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:39,210 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:39,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {83420#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:39,211 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:39,212 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:39,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {83421#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:39,213 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:39,214 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:39,214 INFO L273 TraceCheckUtils]: 65: Hoare triple {83422#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:39,215 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:39,215 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:39,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {83423#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:39,217 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:39,217 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:39,218 INFO L273 TraceCheckUtils]: 71: Hoare triple {83424#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:39,218 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:39,219 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:39,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {83425#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:39,220 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:39,220 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:39,221 INFO L273 TraceCheckUtils]: 77: Hoare triple {83426#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:39,221 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:39,222 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:39,222 INFO L273 TraceCheckUtils]: 80: Hoare triple {83427#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:39,223 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:39,224 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:39,224 INFO L273 TraceCheckUtils]: 83: Hoare triple {83428#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:39,225 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:39,225 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:39,226 INFO L273 TraceCheckUtils]: 86: Hoare triple {83429#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:39,227 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:39,227 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:39,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {83430#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:39,228 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:39,229 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:39,229 INFO L273 TraceCheckUtils]: 92: Hoare triple {83431#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:39,230 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:39,230 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:39,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {83432#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:39,232 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:39,232 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:39,233 INFO L273 TraceCheckUtils]: 98: Hoare triple {83433#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:39,233 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:39,234 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:39,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {83434#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:39,235 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:39,236 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:39,236 INFO L273 TraceCheckUtils]: 104: Hoare triple {83435#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:39,237 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:39,237 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:39,238 INFO L273 TraceCheckUtils]: 107: Hoare triple {83436#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:39,239 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:39,239 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:39,240 INFO L273 TraceCheckUtils]: 110: Hoare triple {83437#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:39,240 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:39,241 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:39,241 INFO L273 TraceCheckUtils]: 113: Hoare triple {83438#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:39,242 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:39,242 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:39,243 INFO L273 TraceCheckUtils]: 116: Hoare triple {83439#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:39,244 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:39,244 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:39,245 INFO L273 TraceCheckUtils]: 119: Hoare triple {83440#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:39,245 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:39,246 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:39,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {83441#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:39,247 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:39,248 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:39,248 INFO L273 TraceCheckUtils]: 125: Hoare triple {83442#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:39,249 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:39,250 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:39,250 INFO L273 TraceCheckUtils]: 128: Hoare triple {83443#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:39,251 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:39,251 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:39,252 INFO L273 TraceCheckUtils]: 131: Hoare triple {83444#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:39,253 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:39,253 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:39,254 INFO L273 TraceCheckUtils]: 134: Hoare triple {83445#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:39,254 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:39,255 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:39,255 INFO L273 TraceCheckUtils]: 137: Hoare triple {83446#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:39,256 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:39,257 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:39,257 INFO L273 TraceCheckUtils]: 140: Hoare triple {83447#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:39,258 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:39,258 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:39,259 INFO L273 TraceCheckUtils]: 143: Hoare triple {83448#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:39,260 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:39,260 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:39,261 INFO L273 TraceCheckUtils]: 146: Hoare triple {83449#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:39,261 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:39,262 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:39,262 INFO L273 TraceCheckUtils]: 149: Hoare triple {83450#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:39,263 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:39,263 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:39,264 INFO L273 TraceCheckUtils]: 152: Hoare triple {83451#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:39,264 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:39,265 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:39,265 INFO L273 TraceCheckUtils]: 155: Hoare triple {83452#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:39,266 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:39,267 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:39,267 INFO L273 TraceCheckUtils]: 158: Hoare triple {83453#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:39,268 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:39,268 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:39,269 INFO L273 TraceCheckUtils]: 161: Hoare triple {83454#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:39,270 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:39,270 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:39,271 INFO L273 TraceCheckUtils]: 164: Hoare triple {83455#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:39,271 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:39,272 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:39,272 INFO L273 TraceCheckUtils]: 167: Hoare triple {83456#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:39,273 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:39,273 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:39,274 INFO L273 TraceCheckUtils]: 170: Hoare triple {83457#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:39,274 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:39,275 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:39,275 INFO L273 TraceCheckUtils]: 173: Hoare triple {83458#(<= main_~i~0 56)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:39,276 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:39,277 INFO L273 TraceCheckUtils]: 175: Hoare triple {83459#(<= main_~i~0 57)} assume !(~i~0 < 100000); {83402#false} is VALID [2018-11-23 11:54:39,277 INFO L273 TraceCheckUtils]: 176: Hoare triple {83402#false} assume !(0 != ~swapped~0); {83402#false} is VALID [2018-11-23 11:54:39,277 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:39,277 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:39,277 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:39,278 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:39,278 INFO L273 TraceCheckUtils]: 181: Hoare triple {83402#false} ~cond := #in~cond; {83402#false} is VALID [2018-11-23 11:54:39,278 INFO L273 TraceCheckUtils]: 182: Hoare triple {83402#false} assume 0 == ~cond; {83402#false} is VALID [2018-11-23 11:54:39,278 INFO L273 TraceCheckUtils]: 183: Hoare triple {83402#false} assume !false; {83402#false} is VALID [2018-11-23 11:54:39,299 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:39,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:39,299 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:39,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:54:39,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:54:39,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:39,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:40,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {83401#true} call ULTIMATE.init(); {83401#true} is VALID [2018-11-23 11:54:40,018 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:40,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {83401#true} assume true; {83401#true} is VALID [2018-11-23 11:54:40,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83401#true} {83401#true} #79#return; {83401#true} is VALID [2018-11-23 11:54:40,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {83401#true} call #t~ret8 := main(); {83401#true} is VALID [2018-11-23 11:54:40,018 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:40,019 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:40,020 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83481#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:40,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {83481#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83481#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:40,021 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:40,021 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:40,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {83404#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83404#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:40,022 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:40,022 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:40,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {83405#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83405#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:40,023 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:40,024 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:40,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {83406#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83406#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:40,025 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:40,026 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:40,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {83407#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83407#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:40,027 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:40,027 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:40,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {83408#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83408#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:40,029 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:40,029 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:40,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {83409#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83409#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:40,030 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:40,031 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:40,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {83410#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83410#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:40,032 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:40,033 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:40,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {83411#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83411#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:40,034 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:40,035 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:40,035 INFO L273 TraceCheckUtils]: 35: Hoare triple {83412#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83412#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:40,036 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:40,036 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:40,037 INFO L273 TraceCheckUtils]: 38: Hoare triple {83413#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83413#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:40,037 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:40,038 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:40,038 INFO L273 TraceCheckUtils]: 41: Hoare triple {83414#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83414#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:40,039 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:40,039 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:40,040 INFO L273 TraceCheckUtils]: 44: Hoare triple {83415#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83415#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:40,041 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:40,041 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:40,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {83416#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83416#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:40,042 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:40,043 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:40,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {83417#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83417#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:40,044 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:40,045 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:40,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {83418#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83418#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:40,046 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:40,046 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:40,047 INFO L273 TraceCheckUtils]: 56: Hoare triple {83419#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83419#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:40,047 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:40,048 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:40,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {83420#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83420#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:40,049 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:40,050 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:40,050 INFO L273 TraceCheckUtils]: 62: Hoare triple {83421#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83421#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:40,051 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:40,051 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:40,052 INFO L273 TraceCheckUtils]: 65: Hoare triple {83422#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83422#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:40,053 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:40,053 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:40,054 INFO L273 TraceCheckUtils]: 68: Hoare triple {83423#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83423#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:40,054 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:40,055 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:40,055 INFO L273 TraceCheckUtils]: 71: Hoare triple {83424#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83424#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:40,056 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:40,057 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:40,057 INFO L273 TraceCheckUtils]: 74: Hoare triple {83425#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83425#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:40,058 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:40,058 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:40,059 INFO L273 TraceCheckUtils]: 77: Hoare triple {83426#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83426#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:40,060 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:40,060 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:40,061 INFO L273 TraceCheckUtils]: 80: Hoare triple {83427#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83427#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:40,061 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:40,062 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:40,062 INFO L273 TraceCheckUtils]: 83: Hoare triple {83428#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83428#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:40,063 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:40,064 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:40,064 INFO L273 TraceCheckUtils]: 86: Hoare triple {83429#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83429#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:40,065 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:40,065 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:40,066 INFO L273 TraceCheckUtils]: 89: Hoare triple {83430#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83430#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:40,067 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:40,067 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:40,068 INFO L273 TraceCheckUtils]: 92: Hoare triple {83431#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83431#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:40,068 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:40,069 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:40,069 INFO L273 TraceCheckUtils]: 95: Hoare triple {83432#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83432#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:40,070 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:40,070 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:40,071 INFO L273 TraceCheckUtils]: 98: Hoare triple {83433#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83433#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:40,072 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:40,072 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:40,073 INFO L273 TraceCheckUtils]: 101: Hoare triple {83434#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83434#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:40,073 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:40,074 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:40,074 INFO L273 TraceCheckUtils]: 104: Hoare triple {83435#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83435#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:40,075 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:40,075 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:40,076 INFO L273 TraceCheckUtils]: 107: Hoare triple {83436#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83436#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:40,077 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:40,077 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:40,078 INFO L273 TraceCheckUtils]: 110: Hoare triple {83437#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83437#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:40,078 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:40,079 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:40,079 INFO L273 TraceCheckUtils]: 113: Hoare triple {83438#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83438#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:40,080 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:40,080 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:40,081 INFO L273 TraceCheckUtils]: 116: Hoare triple {83439#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83439#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:40,082 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:40,082 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:40,083 INFO L273 TraceCheckUtils]: 119: Hoare triple {83440#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83440#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:40,083 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:40,084 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:40,084 INFO L273 TraceCheckUtils]: 122: Hoare triple {83441#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83441#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:40,085 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:40,085 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:40,086 INFO L273 TraceCheckUtils]: 125: Hoare triple {83442#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83442#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:40,087 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:40,087 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:40,088 INFO L273 TraceCheckUtils]: 128: Hoare triple {83443#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83443#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:40,088 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:40,089 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:40,089 INFO L273 TraceCheckUtils]: 131: Hoare triple {83444#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83444#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:40,090 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:40,090 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:40,091 INFO L273 TraceCheckUtils]: 134: Hoare triple {83445#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83445#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:40,092 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:40,092 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:40,093 INFO L273 TraceCheckUtils]: 137: Hoare triple {83446#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83446#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:40,093 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:40,094 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:40,094 INFO L273 TraceCheckUtils]: 140: Hoare triple {83447#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83447#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:40,095 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:40,096 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:40,096 INFO L273 TraceCheckUtils]: 143: Hoare triple {83448#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83448#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:40,097 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:40,097 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:40,098 INFO L273 TraceCheckUtils]: 146: Hoare triple {83449#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83449#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:40,099 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:40,099 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:40,099 INFO L273 TraceCheckUtils]: 149: Hoare triple {83450#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83450#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:40,100 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:40,101 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:40,101 INFO L273 TraceCheckUtils]: 152: Hoare triple {83451#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83451#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:40,102 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:40,102 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:40,103 INFO L273 TraceCheckUtils]: 155: Hoare triple {83452#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83452#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:40,104 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:40,104 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:40,105 INFO L273 TraceCheckUtils]: 158: Hoare triple {83453#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83453#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:40,105 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:40,106 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:40,106 INFO L273 TraceCheckUtils]: 161: Hoare triple {83454#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83454#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:40,107 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:40,107 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:40,108 INFO L273 TraceCheckUtils]: 164: Hoare triple {83455#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83455#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:40,109 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:40,109 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:40,110 INFO L273 TraceCheckUtils]: 167: Hoare triple {83456#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83456#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:40,110 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:40,111 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:40,111 INFO L273 TraceCheckUtils]: 170: Hoare triple {83457#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83457#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:40,112 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:40,113 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:40,113 INFO L273 TraceCheckUtils]: 173: Hoare triple {83458#(<= main_~i~0 56)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {83458#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:40,114 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:40,114 INFO L273 TraceCheckUtils]: 175: Hoare triple {83459#(<= main_~i~0 57)} assume !(~i~0 < 100000); {83402#false} is VALID [2018-11-23 11:54:40,115 INFO L273 TraceCheckUtils]: 176: Hoare triple {83402#false} assume !(0 != ~swapped~0); {83402#false} is VALID [2018-11-23 11:54:40,115 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:40,115 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:40,115 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:40,115 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:40,115 INFO L273 TraceCheckUtils]: 181: Hoare triple {83402#false} ~cond := #in~cond; {83402#false} is VALID [2018-11-23 11:54:40,116 INFO L273 TraceCheckUtils]: 182: Hoare triple {83402#false} assume 0 == ~cond; {83402#false} is VALID [2018-11-23 11:54:40,116 INFO L273 TraceCheckUtils]: 183: Hoare triple {83402#false} assume !false; {83402#false} is VALID [2018-11-23 11:54:40,137 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:40,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:40,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-11-23 11:54:40,158 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 11:54:40,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:40,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2018-11-23 11:54:40,350 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:40,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-23 11:54:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-23 11:54:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:54:40,351 INFO L87 Difference]: Start difference. First operand 357 states and 472 transitions. Second operand 60 states. [2018-11-23 11:54:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:41,441 INFO L93 Difference]: Finished difference Result 718 states and 954 transitions. [2018-11-23 11:54:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 11:54:41,441 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 184 [2018-11-23 11:54:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:54:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:54:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2018-11-23 11:54:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 11:54:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2018-11-23 11:54:41,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 277 transitions. [2018-11-23 11:54:41,824 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:41,832 INFO L225 Difference]: With dead ends: 718 [2018-11-23 11:54:41,832 INFO L226 Difference]: Without dead ends: 367 [2018-11-23 11:54:41,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-11-23 11:54:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-23 11:54:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2018-11-23 11:54:42,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:54:42,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:42,098 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:42,098 INFO L87 Difference]: Start difference. First operand 367 states. Second operand 363 states. [2018-11-23 11:54:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:42,106 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2018-11-23 11:54:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 486 transitions. [2018-11-23 11:54:42,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:42,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:42,107 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand 367 states. [2018-11-23 11:54:42,107 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 367 states. [2018-11-23 11:54:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:54:42,113 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2018-11-23 11:54:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 486 transitions. [2018-11-23 11:54:42,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:54:42,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:54:42,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:54:42,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:54:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 11:54:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 480 transitions. [2018-11-23 11:54:42,123 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 480 transitions. Word has length 184 [2018-11-23 11:54:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:54:42,123 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 480 transitions. [2018-11-23 11:54:42,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-23 11:54:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 480 transitions. [2018-11-23 11:54:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-23 11:54:42,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:54:42,124 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:42,124 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:54:42,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:54:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1881919368, now seen corresponding path program 57 times [2018-11-23 11:54:42,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:54:42,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:54:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:42,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:54:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:54:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:43,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {86196#true} call ULTIMATE.init(); {86196#true} is VALID [2018-11-23 11:54:43,819 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:43,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {86196#true} assume true; {86196#true} is VALID [2018-11-23 11:54:43,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {86196#true} {86196#true} #79#return; {86196#true} is VALID [2018-11-23 11:54:43,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {86196#true} call #t~ret8 := main(); {86196#true} is VALID [2018-11-23 11:54:43,820 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:43,820 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:43,821 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86198#(= main_~i~0 1)} is VALID [2018-11-23 11:54:43,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {86198#(= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86198#(= main_~i~0 1)} is VALID [2018-11-23 11:54:43,822 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:43,822 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:43,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {86199#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:43,823 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:43,823 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:43,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {86200#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:43,824 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:43,824 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:43,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {86201#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:43,826 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:43,826 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:43,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {86202#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:43,827 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:43,828 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:43,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {86203#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:43,829 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:43,829 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:43,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {86204#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:43,831 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:43,831 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:43,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {86205#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:43,832 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:43,833 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:43,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {86206#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:43,834 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:43,835 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:43,835 INFO L273 TraceCheckUtils]: 35: Hoare triple {86207#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:43,836 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:43,836 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:43,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {86208#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:43,837 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:43,838 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:43,838 INFO L273 TraceCheckUtils]: 41: Hoare triple {86209#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:43,839 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:43,839 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:43,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {86210#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:43,840 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:43,841 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:43,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {86211#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:43,842 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:43,843 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:43,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {86212#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:43,844 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:43,844 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:43,845 INFO L273 TraceCheckUtils]: 53: Hoare triple {86213#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:43,846 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:43,846 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:43,847 INFO L273 TraceCheckUtils]: 56: Hoare triple {86214#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:43,847 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:43,848 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:43,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {86215#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:43,849 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:43,850 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:43,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {86216#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:43,851 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:43,852 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:43,852 INFO L273 TraceCheckUtils]: 65: Hoare triple {86217#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:43,853 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:43,853 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:43,854 INFO L273 TraceCheckUtils]: 68: Hoare triple {86218#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:43,855 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:43,855 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:43,856 INFO L273 TraceCheckUtils]: 71: Hoare triple {86219#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:43,856 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:43,857 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:43,857 INFO L273 TraceCheckUtils]: 74: Hoare triple {86220#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:43,858 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:43,858 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:43,859 INFO L273 TraceCheckUtils]: 77: Hoare triple {86221#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:43,860 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:43,860 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:43,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {86222#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:43,861 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:43,862 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:43,862 INFO L273 TraceCheckUtils]: 83: Hoare triple {86223#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:43,863 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:43,864 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:43,864 INFO L273 TraceCheckUtils]: 86: Hoare triple {86224#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:43,865 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:43,865 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:43,866 INFO L273 TraceCheckUtils]: 89: Hoare triple {86225#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:43,867 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:43,867 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:43,868 INFO L273 TraceCheckUtils]: 92: Hoare triple {86226#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:43,868 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:43,869 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:43,869 INFO L273 TraceCheckUtils]: 95: Hoare triple {86227#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:43,870 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:43,870 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:43,871 INFO L273 TraceCheckUtils]: 98: Hoare triple {86228#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:43,872 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:43,872 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:43,873 INFO L273 TraceCheckUtils]: 101: Hoare triple {86229#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:43,873 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:43,874 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:43,874 INFO L273 TraceCheckUtils]: 104: Hoare triple {86230#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:43,875 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:43,876 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:43,876 INFO L273 TraceCheckUtils]: 107: Hoare triple {86231#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:43,877 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:43,877 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:43,878 INFO L273 TraceCheckUtils]: 110: Hoare triple {86232#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:43,879 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:43,879 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:43,880 INFO L273 TraceCheckUtils]: 113: Hoare triple {86233#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:43,880 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:43,881 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:43,881 INFO L273 TraceCheckUtils]: 116: Hoare triple {86234#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:43,882 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:43,882 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:43,883 INFO L273 TraceCheckUtils]: 119: Hoare triple {86235#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:43,884 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:43,884 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:43,885 INFO L273 TraceCheckUtils]: 122: Hoare triple {86236#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:43,885 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:43,886 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:43,886 INFO L273 TraceCheckUtils]: 125: Hoare triple {86237#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:43,887 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:43,888 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:43,888 INFO L273 TraceCheckUtils]: 128: Hoare triple {86238#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:43,889 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:43,889 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:43,890 INFO L273 TraceCheckUtils]: 131: Hoare triple {86239#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:43,890 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:43,891 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:43,891 INFO L273 TraceCheckUtils]: 134: Hoare triple {86240#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:43,892 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:43,893 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:43,893 INFO L273 TraceCheckUtils]: 137: Hoare triple {86241#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:43,894 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:43,894 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:43,895 INFO L273 TraceCheckUtils]: 140: Hoare triple {86242#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:43,895 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:43,896 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:43,896 INFO L273 TraceCheckUtils]: 143: Hoare triple {86243#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:43,897 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:43,898 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:43,898 INFO L273 TraceCheckUtils]: 146: Hoare triple {86244#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:43,899 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:43,899 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:43,900 INFO L273 TraceCheckUtils]: 149: Hoare triple {86245#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:43,901 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:43,901 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:43,902 INFO L273 TraceCheckUtils]: 152: Hoare triple {86246#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:43,902 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:43,903 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:43,904 INFO L273 TraceCheckUtils]: 155: Hoare triple {86247#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:43,904 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:43,905 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:43,905 INFO L273 TraceCheckUtils]: 158: Hoare triple {86248#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:43,906 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:43,906 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:43,907 INFO L273 TraceCheckUtils]: 161: Hoare triple {86249#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:43,908 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:43,908 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:43,909 INFO L273 TraceCheckUtils]: 164: Hoare triple {86250#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:43,909 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:43,910 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:43,910 INFO L273 TraceCheckUtils]: 167: Hoare triple {86251#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:43,911 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:43,912 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:43,912 INFO L273 TraceCheckUtils]: 170: Hoare triple {86252#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:43,913 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:43,914 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:43,914 INFO L273 TraceCheckUtils]: 173: Hoare triple {86253#(<= main_~i~0 56)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:43,915 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:43,915 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:43,916 INFO L273 TraceCheckUtils]: 176: Hoare triple {86254#(<= main_~i~0 57)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:43,916 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:43,917 INFO L273 TraceCheckUtils]: 178: Hoare triple {86255#(<= main_~i~0 58)} assume !(~i~0 < 100000); {86197#false} is VALID [2018-11-23 11:54:43,917 INFO L273 TraceCheckUtils]: 179: Hoare triple {86197#false} assume !(0 != ~swapped~0); {86197#false} is VALID [2018-11-23 11:54:43,917 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:43,918 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:43,918 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:43,918 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:43,918 INFO L273 TraceCheckUtils]: 184: Hoare triple {86197#false} ~cond := #in~cond; {86197#false} is VALID [2018-11-23 11:54:43,918 INFO L273 TraceCheckUtils]: 185: Hoare triple {86197#false} assume 0 == ~cond; {86197#false} is VALID [2018-11-23 11:54:43,918 INFO L273 TraceCheckUtils]: 186: Hoare triple {86197#false} assume !false; {86197#false} is VALID [2018-11-23 11:54:43,940 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:43,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:54:43,940 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:43,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:54:44,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-11-23 11:54:44,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:54:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:54:44,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:54:44,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {86196#true} call ULTIMATE.init(); {86196#true} is VALID [2018-11-23 11:54:44,747 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:44,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {86196#true} assume true; {86196#true} is VALID [2018-11-23 11:54:44,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {86196#true} {86196#true} #79#return; {86196#true} is VALID [2018-11-23 11:54:44,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {86196#true} call #t~ret8 := main(); {86196#true} is VALID [2018-11-23 11:54:44,748 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:44,748 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:44,749 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86277#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:44,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {86277#(<= main_~i~0 1)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86277#(<= main_~i~0 1)} is VALID [2018-11-23 11:54:44,750 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:44,750 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:44,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {86199#(<= main_~i~0 2)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86199#(<= main_~i~0 2)} is VALID [2018-11-23 11:54:44,751 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:44,751 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:44,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {86200#(<= main_~i~0 3)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86200#(<= main_~i~0 3)} is VALID [2018-11-23 11:54:44,753 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:44,753 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:44,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {86201#(<= main_~i~0 4)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86201#(<= main_~i~0 4)} is VALID [2018-11-23 11:54:44,754 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:44,755 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:44,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {86202#(<= main_~i~0 5)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86202#(<= main_~i~0 5)} is VALID [2018-11-23 11:54:44,756 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:44,757 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:44,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {86203#(<= main_~i~0 6)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86203#(<= main_~i~0 6)} is VALID [2018-11-23 11:54:44,758 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:44,759 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:44,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {86204#(<= main_~i~0 7)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86204#(<= main_~i~0 7)} is VALID [2018-11-23 11:54:44,760 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:44,760 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:44,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {86205#(<= main_~i~0 8)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86205#(<= main_~i~0 8)} is VALID [2018-11-23 11:54:44,762 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:44,762 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:44,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {86206#(<= main_~i~0 9)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86206#(<= main_~i~0 9)} is VALID [2018-11-23 11:54:44,763 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:44,764 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:44,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {86207#(<= main_~i~0 10)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86207#(<= main_~i~0 10)} is VALID [2018-11-23 11:54:44,765 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:44,765 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:44,766 INFO L273 TraceCheckUtils]: 38: Hoare triple {86208#(<= main_~i~0 11)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86208#(<= main_~i~0 11)} is VALID [2018-11-23 11:54:44,767 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:44,767 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:44,768 INFO L273 TraceCheckUtils]: 41: Hoare triple {86209#(<= main_~i~0 12)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86209#(<= main_~i~0 12)} is VALID [2018-11-23 11:54:44,769 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:44,769 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:44,770 INFO L273 TraceCheckUtils]: 44: Hoare triple {86210#(<= main_~i~0 13)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86210#(<= main_~i~0 13)} is VALID [2018-11-23 11:54:44,770 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:44,771 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:44,771 INFO L273 TraceCheckUtils]: 47: Hoare triple {86211#(<= main_~i~0 14)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86211#(<= main_~i~0 14)} is VALID [2018-11-23 11:54:44,772 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:44,773 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:44,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {86212#(<= main_~i~0 15)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86212#(<= main_~i~0 15)} is VALID [2018-11-23 11:54:44,774 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:44,774 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:44,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {86213#(<= main_~i~0 16)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86213#(<= main_~i~0 16)} is VALID [2018-11-23 11:54:44,776 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:44,776 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:44,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {86214#(<= main_~i~0 17)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86214#(<= main_~i~0 17)} is VALID [2018-11-23 11:54:44,777 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:44,778 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:44,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {86215#(<= main_~i~0 18)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86215#(<= main_~i~0 18)} is VALID [2018-11-23 11:54:44,779 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:44,780 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:44,780 INFO L273 TraceCheckUtils]: 62: Hoare triple {86216#(<= main_~i~0 19)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86216#(<= main_~i~0 19)} is VALID [2018-11-23 11:54:44,781 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:44,782 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:44,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {86217#(<= main_~i~0 20)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86217#(<= main_~i~0 20)} is VALID [2018-11-23 11:54:44,783 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:44,783 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:44,784 INFO L273 TraceCheckUtils]: 68: Hoare triple {86218#(<= main_~i~0 21)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86218#(<= main_~i~0 21)} is VALID [2018-11-23 11:54:44,785 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:44,785 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:44,785 INFO L273 TraceCheckUtils]: 71: Hoare triple {86219#(<= main_~i~0 22)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86219#(<= main_~i~0 22)} is VALID [2018-11-23 11:54:44,786 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:44,787 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:44,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {86220#(<= main_~i~0 23)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86220#(<= main_~i~0 23)} is VALID [2018-11-23 11:54:44,788 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:44,788 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:44,789 INFO L273 TraceCheckUtils]: 77: Hoare triple {86221#(<= main_~i~0 24)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86221#(<= main_~i~0 24)} is VALID [2018-11-23 11:54:44,789 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:44,790 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:44,790 INFO L273 TraceCheckUtils]: 80: Hoare triple {86222#(<= main_~i~0 25)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86222#(<= main_~i~0 25)} is VALID [2018-11-23 11:54:44,791 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:44,792 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:44,792 INFO L273 TraceCheckUtils]: 83: Hoare triple {86223#(<= main_~i~0 26)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86223#(<= main_~i~0 26)} is VALID [2018-11-23 11:54:44,793 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:44,794 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:44,794 INFO L273 TraceCheckUtils]: 86: Hoare triple {86224#(<= main_~i~0 27)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86224#(<= main_~i~0 27)} is VALID [2018-11-23 11:54:44,795 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:44,796 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:44,796 INFO L273 TraceCheckUtils]: 89: Hoare triple {86225#(<= main_~i~0 28)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86225#(<= main_~i~0 28)} is VALID [2018-11-23 11:54:44,797 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:44,797 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:44,798 INFO L273 TraceCheckUtils]: 92: Hoare triple {86226#(<= main_~i~0 29)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86226#(<= main_~i~0 29)} is VALID [2018-11-23 11:54:44,798 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:44,799 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:44,800 INFO L273 TraceCheckUtils]: 95: Hoare triple {86227#(<= main_~i~0 30)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86227#(<= main_~i~0 30)} is VALID [2018-11-23 11:54:44,800 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:44,801 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:44,801 INFO L273 TraceCheckUtils]: 98: Hoare triple {86228#(<= main_~i~0 31)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86228#(<= main_~i~0 31)} is VALID [2018-11-23 11:54:44,802 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:44,803 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:44,803 INFO L273 TraceCheckUtils]: 101: Hoare triple {86229#(<= main_~i~0 32)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86229#(<= main_~i~0 32)} is VALID [2018-11-23 11:54:44,804 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:44,804 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:44,805 INFO L273 TraceCheckUtils]: 104: Hoare triple {86230#(<= main_~i~0 33)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86230#(<= main_~i~0 33)} is VALID [2018-11-23 11:54:44,806 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:44,806 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:44,807 INFO L273 TraceCheckUtils]: 107: Hoare triple {86231#(<= main_~i~0 34)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86231#(<= main_~i~0 34)} is VALID [2018-11-23 11:54:44,807 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:44,808 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:44,808 INFO L273 TraceCheckUtils]: 110: Hoare triple {86232#(<= main_~i~0 35)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86232#(<= main_~i~0 35)} is VALID [2018-11-23 11:54:44,809 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:44,809 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:44,810 INFO L273 TraceCheckUtils]: 113: Hoare triple {86233#(<= main_~i~0 36)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86233#(<= main_~i~0 36)} is VALID [2018-11-23 11:54:44,811 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:44,811 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:44,812 INFO L273 TraceCheckUtils]: 116: Hoare triple {86234#(<= main_~i~0 37)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86234#(<= main_~i~0 37)} is VALID [2018-11-23 11:54:44,812 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:44,813 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:44,814 INFO L273 TraceCheckUtils]: 119: Hoare triple {86235#(<= main_~i~0 38)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86235#(<= main_~i~0 38)} is VALID [2018-11-23 11:54:44,814 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:44,815 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:44,815 INFO L273 TraceCheckUtils]: 122: Hoare triple {86236#(<= main_~i~0 39)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86236#(<= main_~i~0 39)} is VALID [2018-11-23 11:54:44,816 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:44,817 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:44,817 INFO L273 TraceCheckUtils]: 125: Hoare triple {86237#(<= main_~i~0 40)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86237#(<= main_~i~0 40)} is VALID [2018-11-23 11:54:44,818 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:44,819 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:44,819 INFO L273 TraceCheckUtils]: 128: Hoare triple {86238#(<= main_~i~0 41)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86238#(<= main_~i~0 41)} is VALID [2018-11-23 11:54:44,820 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:44,821 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:44,821 INFO L273 TraceCheckUtils]: 131: Hoare triple {86239#(<= main_~i~0 42)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86239#(<= main_~i~0 42)} is VALID [2018-11-23 11:54:44,822 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:44,823 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:44,823 INFO L273 TraceCheckUtils]: 134: Hoare triple {86240#(<= main_~i~0 43)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86240#(<= main_~i~0 43)} is VALID [2018-11-23 11:54:44,824 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:44,824 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:44,825 INFO L273 TraceCheckUtils]: 137: Hoare triple {86241#(<= main_~i~0 44)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86241#(<= main_~i~0 44)} is VALID [2018-11-23 11:54:44,826 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:44,826 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:44,827 INFO L273 TraceCheckUtils]: 140: Hoare triple {86242#(<= main_~i~0 45)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86242#(<= main_~i~0 45)} is VALID [2018-11-23 11:54:44,827 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:44,828 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:44,829 INFO L273 TraceCheckUtils]: 143: Hoare triple {86243#(<= main_~i~0 46)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86243#(<= main_~i~0 46)} is VALID [2018-11-23 11:54:44,829 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:44,830 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:44,830 INFO L273 TraceCheckUtils]: 146: Hoare triple {86244#(<= main_~i~0 47)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86244#(<= main_~i~0 47)} is VALID [2018-11-23 11:54:44,831 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:44,831 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:44,832 INFO L273 TraceCheckUtils]: 149: Hoare triple {86245#(<= main_~i~0 48)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86245#(<= main_~i~0 48)} is VALID [2018-11-23 11:54:44,833 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:44,833 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:44,834 INFO L273 TraceCheckUtils]: 152: Hoare triple {86246#(<= main_~i~0 49)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86246#(<= main_~i~0 49)} is VALID [2018-11-23 11:54:44,834 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:44,835 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:44,835 INFO L273 TraceCheckUtils]: 155: Hoare triple {86247#(<= main_~i~0 50)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86247#(<= main_~i~0 50)} is VALID [2018-11-23 11:54:44,836 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:44,837 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:44,837 INFO L273 TraceCheckUtils]: 158: Hoare triple {86248#(<= main_~i~0 51)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86248#(<= main_~i~0 51)} is VALID [2018-11-23 11:54:44,838 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:44,838 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:44,839 INFO L273 TraceCheckUtils]: 161: Hoare triple {86249#(<= main_~i~0 52)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86249#(<= main_~i~0 52)} is VALID [2018-11-23 11:54:44,840 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:44,840 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:44,841 INFO L273 TraceCheckUtils]: 164: Hoare triple {86250#(<= main_~i~0 53)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86250#(<= main_~i~0 53)} is VALID [2018-11-23 11:54:44,842 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:44,842 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:44,843 INFO L273 TraceCheckUtils]: 167: Hoare triple {86251#(<= main_~i~0 54)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86251#(<= main_~i~0 54)} is VALID [2018-11-23 11:54:44,843 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:44,844 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:44,849 INFO L273 TraceCheckUtils]: 170: Hoare triple {86252#(<= main_~i~0 55)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86252#(<= main_~i~0 55)} is VALID [2018-11-23 11:54:44,849 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:44,849 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:44,850 INFO L273 TraceCheckUtils]: 173: Hoare triple {86253#(<= main_~i~0 56)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86253#(<= main_~i~0 56)} is VALID [2018-11-23 11:54:44,850 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:44,851 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 - 1), 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:44,851 INFO L273 TraceCheckUtils]: 176: Hoare triple {86254#(<= main_~i~0 57)} assume !(#t~mem0 < #t~mem1);havoc #t~mem1;havoc #t~mem0; {86254#(<= main_~i~0 57)} is VALID [2018-11-23 11:54:44,851 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:44,852 INFO L273 TraceCheckUtils]: 178: Hoare triple {86255#(<= main_~i~0 58)} assume !(~i~0 < 100000); {86197#false} is VALID [2018-11-23 11:54:44,852 INFO L273 TraceCheckUtils]: 179: Hoare triple {86197#false} assume !(0 != ~swapped~0); {86197#false} is VALID [2018-11-23 11:54:44,852 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:44,852 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:44,852 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:44,852 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:44,852 INFO L273 TraceCheckUtils]: 184: Hoare triple {86197#false} ~cond := #in~cond; {86197#false} is VALID [2018-11-23 11:54:44,853 INFO L273 TraceCheckUtils]: 185: Hoare triple {86197#false} assume 0 == ~cond; {86197#false} is VALID [2018-11-23 11:54:44,853 INFO L273 TraceCheckUtils]: 186: Hoare triple {86197#false} assume !false; {86197#false} is VALID [2018-11-23 11:54:44,874 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:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:54:44,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2018-11-23 11:54:44,895 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-11-23 11:54:44,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:54:44,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2018-11-23 11:54:45,102 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:45,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-11-23 11:54:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 11:54:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 11:54:45,103 INFO L87 Difference]: Start difference. First operand 363 states and 480 transitions. Second operand 61 states.