java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:53:51,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:53:51,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:53:51,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:53:51,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:53:51,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:53:51,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:53:51,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:53:51,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:53:51,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:53:51,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:53:51,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:53:51,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:53:51,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:53:51,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:53:51,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:53:51,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:53:51,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:53:51,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:53:51,471 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:53:51,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:53:51,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:53:51,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:53:51,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:53:51,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:53:51,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:53:51,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:53:51,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:53:51,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:53:51,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:53:51,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:53:51,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:53:51,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:53:51,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:53:51,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:53:51,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:53:51,487 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:53:51,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:53:51,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:53:51,515 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:53:51,515 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:53:51,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:53:51,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:53:51,516 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:53:51,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:53:51,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:53:51,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:53:51,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:53:51,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:53:51,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:53:51,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:53:51,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:53:51,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:53:51,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:53:51,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:53:51,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:53:51,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:53:51,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:53:51,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:53:51,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:53:51,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:53:51,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:53:51,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:53:51,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:53:51,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:53:51,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:53:51,597 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:53:51,599 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_true-unreach-call_ground.i [2018-11-14 16:53:51,671 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b0a764e/65136cb146d0432087b6461e7adf7848/FLAG8cb064bb7 [2018-11-14 16:53:52,173 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:53:52,173 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_true-unreach-call_ground.i [2018-11-14 16:53:52,180 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b0a764e/65136cb146d0432087b6461e7adf7848/FLAG8cb064bb7 [2018-11-14 16:53:52,196 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b0a764e/65136cb146d0432087b6461e7adf7848 [2018-11-14 16:53:52,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:53:52,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:53:52,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:53:52,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:53:52,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:53:52,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e944962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52, skipping insertion in model container [2018-11-14 16:53:52,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:53:52,251 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:53:52,485 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:53:52,491 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:53:52,531 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:53:52,569 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:53:52,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52 WrapperNode [2018-11-14 16:53:52,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:53:52,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:53:52,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:53:52,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:53:52,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... [2018-11-14 16:53:52,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:53:52,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:53:52,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:53:52,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:53:52,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:53:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:53:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:53:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:53:52,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:53:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:53:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:53:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:53:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:53:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:53:53,409 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:53:53,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:53:53 BoogieIcfgContainer [2018-11-14 16:53:53,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:53:53,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:53:53,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:53:53,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:53:53,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:53:52" (1/3) ... [2018-11-14 16:53:53,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2192b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:53:53, skipping insertion in model container [2018-11-14 16:53:53,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:53:52" (2/3) ... [2018-11-14 16:53:53,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce2192b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:53:53, skipping insertion in model container [2018-11-14 16:53:53,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:53:53" (3/3) ... [2018-11-14 16:53:53,420 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_true-unreach-call_ground.i [2018-11-14 16:53:53,429 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:53:53,436 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:53:53,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:53:53,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:53:53,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:53:53,485 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:53:53,485 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:53:53,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:53:53,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:53:53,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:53:53,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:53:53,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:53:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 16:53:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:53:53,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:53,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:53,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:53,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash -712186415, now seen corresponding path program 1 times [2018-11-14 16:53:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:53,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:53,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:53,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 16:53:53,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-14 16:53:53,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 16:53:53,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #83#return; {35#true} is VALID [2018-11-14 16:53:53,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2018-11-14 16:53:53,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {35#true} is VALID [2018-11-14 16:53:53,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-14 16:53:53,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {36#false} is VALID [2018-11-14 16:53:53,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 16:53:53,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {36#false} is VALID [2018-11-14 16:53:53,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 16:53:53,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {36#false} is VALID [2018-11-14 16:53:53,692 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {36#false} is VALID [2018-11-14 16:53:53,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 16:53:53,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 16:53:53,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 16:53:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:53,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:53:53,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:53:53,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:53:53,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:53,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:53:53,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:53,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:53:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:53:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:53:53,841 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-14 16:53:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:54,169 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-14 16:53:54,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:53:54,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:53:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:53:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 16:53:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:53:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-14 16:53:54,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-14 16:53:54,476 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-14 16:53:54,487 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:53:54,487 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:53:54,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:53:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:53:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 16:53:54,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:54,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 16:53:54,534 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:53:54,534 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:53:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:54,538 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 16:53:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:53:54,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:54,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:53:54,540 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:53:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:54,543 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 16:53:54,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:53:54,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:54,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:54,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:54,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:53:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-14 16:53:54,549 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2018-11-14 16:53:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:54,550 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-14 16:53:54,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:53:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-14 16:53:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:53:54,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:54,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:54,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:54,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1922293170, now seen corresponding path program 1 times [2018-11-14 16:53:54,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:54,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:54,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:54,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-14 16:53:54,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-14 16:53:54,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-14 16:53:54,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #83#return; {204#true} is VALID [2018-11-14 16:53:54,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret8 := main(); {204#true} is VALID [2018-11-14 16:53:54,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {206#(<= 1 main_~swapped~0)} is VALID [2018-11-14 16:53:54,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(<= 1 main_~swapped~0)} assume true; {206#(<= 1 main_~swapped~0)} is VALID [2018-11-14 16:53:54,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#(<= 1 main_~swapped~0)} assume !(~swapped~0 != 0); {205#false} is VALID [2018-11-14 16:53:54,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {205#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {205#false} is VALID [2018-11-14 16:53:54,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {205#false} assume true; {205#false} is VALID [2018-11-14 16:53:54,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {205#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {205#false} is VALID [2018-11-14 16:53:54,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#false} assume true; {205#false} is VALID [2018-11-14 16:53:54,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {205#false} is VALID [2018-11-14 16:53:54,671 INFO L256 TraceCheckUtils]: 13: Hoare triple {205#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {205#false} is VALID [2018-11-14 16:53:54,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2018-11-14 16:53:54,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {205#false} assume ~cond == 0; {205#false} is VALID [2018-11-14 16:53:54,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-14 16:53:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:54,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:53:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:53:54,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 16:53:54,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:54,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:53:54,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:54,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:53:54,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:53:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:53:54,711 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-14 16:53:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:55,142 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 16:53:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:53:55,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 16:53:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:53:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 16:53:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:53:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 16:53:55,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-14 16:53:55,329 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-14 16:53:55,332 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:53:55,332 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 16:53:55,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:53:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 16:53:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 16:53:55,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:55,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 16:53:55,358 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 16:53:55,358 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 16:53:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:55,361 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 16:53:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 16:53:55,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:55,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:55,362 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 16:53:55,362 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 16:53:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:55,365 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 16:53:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 16:53:55,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:55,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:55,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:55,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:53:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-14 16:53:55,370 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2018-11-14 16:53:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:55,370 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-14 16:53:55,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:53:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 16:53:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:53:55,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:55,372 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:55,372 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:55,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1246945532, now seen corresponding path program 1 times [2018-11-14 16:53:55,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:55,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:55,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:55,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:55,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-14 16:53:55,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {384#true} is VALID [2018-11-14 16:53:55,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-14 16:53:55,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {384#true} {384#true} #83#return; {384#true} is VALID [2018-11-14 16:53:55,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {384#true} call #t~ret8 := main(); {384#true} is VALID [2018-11-14 16:53:55,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {384#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {384#true} is VALID [2018-11-14 16:53:55,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-14 16:53:55,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {386#(= main_~i~0 1)} is VALID [2018-11-14 16:53:55,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(= main_~i~0 1)} assume true; {386#(= main_~i~0 1)} is VALID [2018-11-14 16:53:55,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#(= main_~i~0 1)} assume !(~i~0 < 100000); {385#false} is VALID [2018-11-14 16:53:55,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 16:53:55,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#false} assume !(~swapped~0 != 0); {385#false} is VALID [2018-11-14 16:53:55,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {385#false} is VALID [2018-11-14 16:53:55,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 16:53:55,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {385#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {385#false} is VALID [2018-11-14 16:53:55,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {385#false} assume true; {385#false} is VALID [2018-11-14 16:53:55,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {385#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {385#false} is VALID [2018-11-14 16:53:55,501 INFO L256 TraceCheckUtils]: 17: Hoare triple {385#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {385#false} is VALID [2018-11-14 16:53:55,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-14 16:53:55,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume ~cond == 0; {385#false} is VALID [2018-11-14 16:53:55,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-14 16:53:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:55,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:53:55,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:53:55,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:53:55,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:55,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:53:55,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:55,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:53:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:53:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:53:55,540 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-14 16:53:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:55,892 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 16:53:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:53:55,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:53:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:53:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 16:53:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:53:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 16:53:55,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 16:53:56,008 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-14 16:53:56,010 INFO L225 Difference]: With dead ends: 65 [2018-11-14 16:53:56,011 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 16:53:56,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:53:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 16:53:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-14 16:53:56,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:56,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-14 16:53:56,028 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-14 16:53:56,028 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-14 16:53:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:56,032 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 16:53:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 16:53:56,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:56,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:56,034 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-14 16:53:56,034 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-14 16:53:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:56,037 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 16:53:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 16:53:56,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:56,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:56,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:56,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:53:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 16:53:56,041 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2018-11-14 16:53:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:56,041 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 16:53:56,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:53:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 16:53:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:53:56,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:56,043 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:56,043 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:56,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:56,044 INFO L82 PathProgramCache]: Analyzing trace with hash -923621540, now seen corresponding path program 1 times [2018-11-14 16:53:56,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:56,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:56,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:56,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:56,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 16:53:56,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 16:53:56,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 16:53:56,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #83#return; {599#true} is VALID [2018-11-14 16:53:56,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret8 := main(); {599#true} is VALID [2018-11-14 16:53:56,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {599#true} is VALID [2018-11-14 16:53:56,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 16:53:56,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {601#(= main_~i~0 1)} is VALID [2018-11-14 16:53:56,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {601#(= main_~i~0 1)} assume true; {601#(= main_~i~0 1)} is VALID [2018-11-14 16:53:56,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {601#(= main_~i~0 1)} is VALID [2018-11-14 16:53:56,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {601#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {601#(= main_~i~0 1)} is VALID [2018-11-14 16:53:56,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {601#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {602#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:56,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(<= main_~i~0 2)} assume true; {602#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:56,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#(<= main_~i~0 2)} assume !(~i~0 < 100000); {600#false} is VALID [2018-11-14 16:53:56,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#false} assume !(~swapped~0 != 0); {600#false} is VALID [2018-11-14 16:53:56,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {600#false} is VALID [2018-11-14 16:53:56,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {600#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {600#false} is VALID [2018-11-14 16:53:56,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {600#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {600#false} is VALID [2018-11-14 16:53:56,173 INFO L256 TraceCheckUtils]: 21: Hoare triple {600#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {600#false} is VALID [2018-11-14 16:53:56,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {600#false} ~cond := #in~cond; {600#false} is VALID [2018-11-14 16:53:56,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {600#false} assume ~cond == 0; {600#false} is VALID [2018-11-14 16:53:56,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 16:53:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:56,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:56,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:56,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:56,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:56,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 16:53:56,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 16:53:56,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 16:53:56,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #83#return; {599#true} is VALID [2018-11-14 16:53:56,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret8 := main(); {599#true} is VALID [2018-11-14 16:53:56,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {599#true} is VALID [2018-11-14 16:53:56,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 16:53:56,515 INFO L273 TraceCheckUtils]: 7: Hoare triple {599#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {627#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:56,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {627#(<= main_~i~0 1)} assume true; {627#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:56,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {627#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {627#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:56,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {627#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:56,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {627#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {602#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:56,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#(<= main_~i~0 2)} assume true; {602#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:56,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#(<= main_~i~0 2)} assume !(~i~0 < 100000); {600#false} is VALID [2018-11-14 16:53:56,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#false} assume !(~swapped~0 != 0); {600#false} is VALID [2018-11-14 16:53:56,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {600#false} is VALID [2018-11-14 16:53:56,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {600#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {600#false} is VALID [2018-11-14 16:53:56,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {600#false} assume true; {600#false} is VALID [2018-11-14 16:53:56,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {600#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {600#false} is VALID [2018-11-14 16:53:56,535 INFO L256 TraceCheckUtils]: 21: Hoare triple {600#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {600#false} is VALID [2018-11-14 16:53:56,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {600#false} ~cond := #in~cond; {600#false} is VALID [2018-11-14 16:53:56,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {600#false} assume ~cond == 0; {600#false} is VALID [2018-11-14 16:53:56,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 16:53:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:56,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:56,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:53:56,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:53:56,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:56,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:53:56,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:56,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:53:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:53:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:53:56,628 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2018-11-14 16:53:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:56,953 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-14 16:53:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:53:56,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:53:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:53:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-14 16:53:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:53:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-14 16:53:56,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2018-11-14 16:53:57,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:57,093 INFO L225 Difference]: With dead ends: 75 [2018-11-14 16:53:57,094 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 16:53:57,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-14 16:53:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 16:53:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-11-14 16:53:57,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:57,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 42 states. [2018-11-14 16:53:57,134 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 42 states. [2018-11-14 16:53:57,134 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 42 states. [2018-11-14 16:53:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:57,137 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-14 16:53:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-14 16:53:57,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:57,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:57,138 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 46 states. [2018-11-14 16:53:57,139 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 46 states. [2018-11-14 16:53:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:57,141 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-14 16:53:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-14 16:53:57,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:57,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:57,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:57,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:53:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 16:53:57,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-11-14 16:53:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:57,146 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 16:53:57,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:53:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 16:53:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:53:57,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:57,148 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:57,148 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:57,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash 856441780, now seen corresponding path program 2 times [2018-11-14 16:53:57,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:57,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:53:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:57,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-14 16:53:57,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-14 16:53:57,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 16:53:57,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #83#return; {926#true} is VALID [2018-11-14 16:53:57,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret8 := main(); {926#true} is VALID [2018-11-14 16:53:57,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {926#true} is VALID [2018-11-14 16:53:57,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 16:53:57,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {928#(= main_~i~0 1)} is VALID [2018-11-14 16:53:57,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {928#(= main_~i~0 1)} assume true; {928#(= main_~i~0 1)} is VALID [2018-11-14 16:53:57,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {928#(= main_~i~0 1)} is VALID [2018-11-14 16:53:57,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {928#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {928#(= main_~i~0 1)} is VALID [2018-11-14 16:53:57,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {928#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {929#(<= main_~i~0 2)} assume true; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {929#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {930#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:57,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {930#(<= main_~i~0 3)} assume true; {930#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:57,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {930#(<= main_~i~0 3)} assume !(~i~0 < 100000); {927#false} is VALID [2018-11-14 16:53:57,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {927#false} assume !(~swapped~0 != 0); {927#false} is VALID [2018-11-14 16:53:57,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {927#false} is VALID [2018-11-14 16:53:57,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {927#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {927#false} is VALID [2018-11-14 16:53:57,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {927#false} is VALID [2018-11-14 16:53:57,307 INFO L256 TraceCheckUtils]: 25: Hoare triple {927#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {927#false} is VALID [2018-11-14 16:53:57,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2018-11-14 16:53:57,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {927#false} assume ~cond == 0; {927#false} is VALID [2018-11-14 16:53:57,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-14 16:53:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:57,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:57,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:53:57,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:53:57,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:57,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:57,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-14 16:53:57,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-14 16:53:57,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 16:53:57,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #83#return; {926#true} is VALID [2018-11-14 16:53:57,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret8 := main(); {926#true} is VALID [2018-11-14 16:53:57,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {926#true} is VALID [2018-11-14 16:53:57,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-14 16:53:57,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {926#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {955#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:57,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {955#(<= main_~i~0 1)} assume true; {955#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:57,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {955#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:57,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {955#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {955#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:57,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {955#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {929#(<= main_~i~0 2)} assume true; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {929#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {929#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {929#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:57,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {930#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:57,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {930#(<= main_~i~0 3)} assume true; {930#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:57,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {930#(<= main_~i~0 3)} assume !(~i~0 < 100000); {927#false} is VALID [2018-11-14 16:53:57,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {927#false} assume !(~swapped~0 != 0); {927#false} is VALID [2018-11-14 16:53:57,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {927#false} is VALID [2018-11-14 16:53:57,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {927#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {927#false} is VALID [2018-11-14 16:53:57,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-14 16:53:57,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {927#false} is VALID [2018-11-14 16:53:57,537 INFO L256 TraceCheckUtils]: 25: Hoare triple {927#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {927#false} is VALID [2018-11-14 16:53:57,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {927#false} ~cond := #in~cond; {927#false} is VALID [2018-11-14 16:53:57,538 INFO L273 TraceCheckUtils]: 27: Hoare triple {927#false} assume ~cond == 0; {927#false} is VALID [2018-11-14 16:53:57,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-14 16:53:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:53:57,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 16:53:57,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:53:57,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:57,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:53:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:53:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:53:57,619 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2018-11-14 16:53:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:57,856 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-11-14 16:53:57,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:53:57,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-14 16:53:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:53:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-14 16:53:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:53:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2018-11-14 16:53:57,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2018-11-14 16:53:58,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:58,044 INFO L225 Difference]: With dead ends: 90 [2018-11-14 16:53:58,044 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 16:53:58,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-14 16:53:58,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 16:53:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-14 16:53:58,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:58,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-14 16:53:58,113 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-14 16:53:58,113 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-14 16:53:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:58,117 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 16:53:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 16:53:58,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:58,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:58,118 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-14 16:53:58,118 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-14 16:53:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:58,121 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 16:53:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 16:53:58,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:58,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:58,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:58,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:53:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2018-11-14 16:53:58,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 29 [2018-11-14 16:53:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:58,126 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2018-11-14 16:53:58,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:53:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 16:53:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 16:53:58,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:58,127 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:58,127 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:58,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2083523572, now seen corresponding path program 3 times [2018-11-14 16:53:58,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:58,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:58,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:58,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-14 16:53:58,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1311#true} is VALID [2018-11-14 16:53:58,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 16:53:58,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #83#return; {1311#true} is VALID [2018-11-14 16:53:58,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret8 := main(); {1311#true} is VALID [2018-11-14 16:53:58,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1311#true} is VALID [2018-11-14 16:53:58,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 16:53:58,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1313#(= main_~i~0 1)} is VALID [2018-11-14 16:53:58,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {1313#(= main_~i~0 1)} assume true; {1313#(= main_~i~0 1)} is VALID [2018-11-14 16:53:58,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {1313#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1313#(= main_~i~0 1)} is VALID [2018-11-14 16:53:58,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1313#(= main_~i~0 1)} is VALID [2018-11-14 16:53:58,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 2)} assume true; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 3)} assume true; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {1315#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {1315#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:58,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#(<= main_~i~0 4)} assume true; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:58,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1312#false} is VALID [2018-11-14 16:53:58,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {1312#false} assume !(~swapped~0 != 0); {1312#false} is VALID [2018-11-14 16:53:58,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {1312#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1312#false} is VALID [2018-11-14 16:53:58,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {1312#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1312#false} is VALID [2018-11-14 16:53:58,289 INFO L273 TraceCheckUtils]: 27: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {1312#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1312#false} is VALID [2018-11-14 16:53:58,290 INFO L256 TraceCheckUtils]: 29: Hoare triple {1312#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1312#false} is VALID [2018-11-14 16:53:58,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-14 16:53:58,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {1312#false} assume ~cond == 0; {1312#false} is VALID [2018-11-14 16:53:58,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-14 16:53:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:58,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:58,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:53:58,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:53:58,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:58,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:58,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-14 16:53:58,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1311#true} is VALID [2018-11-14 16:53:58,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 16:53:58,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #83#return; {1311#true} is VALID [2018-11-14 16:53:58,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret8 := main(); {1311#true} is VALID [2018-11-14 16:53:58,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1311#true} is VALID [2018-11-14 16:53:58,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-14 16:53:58,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:58,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {1341#(<= main_~i~0 1)} assume true; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:58,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {1341#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1341#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:58,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {1341#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1341#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:58,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {1341#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~i~0 2)} assume true; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {1314#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1314#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:58,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {1314#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {1315#(<= main_~i~0 3)} assume true; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {1315#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1315#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:58,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {1315#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:58,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#(<= main_~i~0 4)} assume true; {1316#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:58,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1312#false} is VALID [2018-11-14 16:53:58,513 INFO L273 TraceCheckUtils]: 22: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {1312#false} assume !(~swapped~0 != 0); {1312#false} is VALID [2018-11-14 16:53:58,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {1312#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1312#false} is VALID [2018-11-14 16:53:58,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {1312#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1312#false} is VALID [2018-11-14 16:53:58,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {1312#false} assume true; {1312#false} is VALID [2018-11-14 16:53:58,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {1312#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1312#false} is VALID [2018-11-14 16:53:58,516 INFO L256 TraceCheckUtils]: 29: Hoare triple {1312#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1312#false} is VALID [2018-11-14 16:53:58,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-14 16:53:58,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {1312#false} assume ~cond == 0; {1312#false} is VALID [2018-11-14 16:53:58,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-14 16:53:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:58,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:58,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:53:58,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 16:53:58,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:58,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:53:58,601 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-14 16:53:58,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:53:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:53:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:53:58,602 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 7 states. [2018-11-14 16:53:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:58,801 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2018-11-14 16:53:58,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:53:58,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-14 16:53:58,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:53:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 16:53:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:53:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-14 16:53:58,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-14 16:53:58,915 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-14 16:53:58,918 INFO L225 Difference]: With dead ends: 106 [2018-11-14 16:53:58,918 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:53:58,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:53:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:53:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-14 16:53:58,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:58,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 58 states. [2018-11-14 16:53:58,948 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 58 states. [2018-11-14 16:53:58,948 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 58 states. [2018-11-14 16:53:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:58,951 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-14 16:53:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-14 16:53:58,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:58,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:58,952 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 62 states. [2018-11-14 16:53:58,953 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 62 states. [2018-11-14 16:53:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:58,956 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-14 16:53:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-11-14 16:53:58,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:58,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:58,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:58,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:53:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-14 16:53:58,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 33 [2018-11-14 16:53:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:58,960 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-14 16:53:58,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:53:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 16:53:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:53:58,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:58,962 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:58,962 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:58,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1880340580, now seen corresponding path program 4 times [2018-11-14 16:53:58,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:58,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:58,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:59,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {1755#true} call ULTIMATE.init(); {1755#true} is VALID [2018-11-14 16:53:59,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {1755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1755#true} is VALID [2018-11-14 16:53:59,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 16:53:59,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1755#true} {1755#true} #83#return; {1755#true} is VALID [2018-11-14 16:53:59,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {1755#true} call #t~ret8 := main(); {1755#true} is VALID [2018-11-14 16:53:59,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {1755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1755#true} is VALID [2018-11-14 16:53:59,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 16:53:59,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {1755#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1757#(= main_~i~0 1)} is VALID [2018-11-14 16:53:59,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {1757#(= main_~i~0 1)} assume true; {1757#(= main_~i~0 1)} is VALID [2018-11-14 16:53:59,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {1757#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1757#(= main_~i~0 1)} is VALID [2018-11-14 16:53:59,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {1757#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1757#(= main_~i~0 1)} is VALID [2018-11-14 16:53:59,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {1757#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {1758#(<= main_~i~0 2)} assume true; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {1758#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {1758#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {1759#(<= main_~i~0 3)} assume true; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {1759#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {1759#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {1759#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {1760#(<= main_~i~0 4)} assume true; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {1760#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {1760#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {1760#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:59,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {1761#(<= main_~i~0 5)} assume true; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:59,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {1761#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1756#false} is VALID [2018-11-14 16:53:59,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,127 INFO L273 TraceCheckUtils]: 27: Hoare triple {1756#false} assume !(~swapped~0 != 0); {1756#false} is VALID [2018-11-14 16:53:59,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {1756#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1756#false} is VALID [2018-11-14 16:53:59,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,128 INFO L273 TraceCheckUtils]: 30: Hoare triple {1756#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1756#false} is VALID [2018-11-14 16:53:59,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {1756#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1756#false} is VALID [2018-11-14 16:53:59,128 INFO L256 TraceCheckUtils]: 33: Hoare triple {1756#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1756#false} is VALID [2018-11-14 16:53:59,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {1756#false} ~cond := #in~cond; {1756#false} is VALID [2018-11-14 16:53:59,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {1756#false} assume ~cond == 0; {1756#false} is VALID [2018-11-14 16:53:59,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {1756#false} assume !false; {1756#false} is VALID [2018-11-14 16:53:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:59,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:59,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:53:59,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:53:59,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:53:59,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:59,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:59,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {1755#true} call ULTIMATE.init(); {1755#true} is VALID [2018-11-14 16:53:59,472 INFO L273 TraceCheckUtils]: 1: Hoare triple {1755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1755#true} is VALID [2018-11-14 16:53:59,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 16:53:59,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1755#true} {1755#true} #83#return; {1755#true} is VALID [2018-11-14 16:53:59,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {1755#true} call #t~ret8 := main(); {1755#true} is VALID [2018-11-14 16:53:59,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {1755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {1755#true} is VALID [2018-11-14 16:53:59,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {1755#true} assume true; {1755#true} is VALID [2018-11-14 16:53:59,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {1755#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:59,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(<= main_~i~0 1)} assume true; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:59,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1786#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:59,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1786#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:59,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {1786#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {1758#(<= main_~i~0 2)} assume true; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {1758#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {1758#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1758#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:59,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {1759#(<= main_~i~0 3)} assume true; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,481 INFO L273 TraceCheckUtils]: 17: Hoare triple {1759#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {1759#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1759#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:59,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {1759#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {1760#(<= main_~i~0 4)} assume true; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {1760#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {1760#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {1760#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:59,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {1760#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:59,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {1761#(<= main_~i~0 5)} assume true; {1761#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:59,488 INFO L273 TraceCheckUtils]: 25: Hoare triple {1761#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1756#false} is VALID [2018-11-14 16:53:59,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {1756#false} assume !(~swapped~0 != 0); {1756#false} is VALID [2018-11-14 16:53:59,489 INFO L273 TraceCheckUtils]: 28: Hoare triple {1756#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {1756#false} is VALID [2018-11-14 16:53:59,489 INFO L273 TraceCheckUtils]: 29: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {1756#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {1756#false} is VALID [2018-11-14 16:53:59,490 INFO L273 TraceCheckUtils]: 31: Hoare triple {1756#false} assume true; {1756#false} is VALID [2018-11-14 16:53:59,490 INFO L273 TraceCheckUtils]: 32: Hoare triple {1756#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {1756#false} is VALID [2018-11-14 16:53:59,491 INFO L256 TraceCheckUtils]: 33: Hoare triple {1756#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {1756#false} is VALID [2018-11-14 16:53:59,491 INFO L273 TraceCheckUtils]: 34: Hoare triple {1756#false} ~cond := #in~cond; {1756#false} is VALID [2018-11-14 16:53:59,491 INFO L273 TraceCheckUtils]: 35: Hoare triple {1756#false} assume ~cond == 0; {1756#false} is VALID [2018-11-14 16:53:59,492 INFO L273 TraceCheckUtils]: 36: Hoare triple {1756#false} assume !false; {1756#false} is VALID [2018-11-14 16:53:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:53:59,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:59,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:53:59,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 16:53:59,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:59,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:53:59,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:59,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:53:59,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:53:59,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:53:59,601 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 8 states. [2018-11-14 16:53:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:59,885 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-11-14 16:53:59,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:53:59,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-14 16:53:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:53:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 16:53:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:53:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-11-14 16:53:59,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2018-11-14 16:54:00,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:00,025 INFO L225 Difference]: With dead ends: 122 [2018-11-14 16:54:00,025 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 16:54:00,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:54:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 16:54:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-11-14 16:54:00,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:00,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 66 states. [2018-11-14 16:54:00,097 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 66 states. [2018-11-14 16:54:00,097 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 66 states. [2018-11-14 16:54:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:00,102 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2018-11-14 16:54:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-11-14 16:54:00,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:00,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:00,103 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 70 states. [2018-11-14 16:54:00,103 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 70 states. [2018-11-14 16:54:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:00,109 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2018-11-14 16:54:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2018-11-14 16:54:00,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:00,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:00,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:00,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:54:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-14 16:54:00,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 37 [2018-11-14 16:54:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:00,114 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-14 16:54:00,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:54:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 16:54:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:54:00,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:00,115 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:00,115 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:00,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1370329276, now seen corresponding path program 5 times [2018-11-14 16:54:00,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:00,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:00,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:00,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2018-11-14 16:54:00,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2258#true} is VALID [2018-11-14 16:54:00,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 16:54:00,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #83#return; {2258#true} is VALID [2018-11-14 16:54:00,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret8 := main(); {2258#true} is VALID [2018-11-14 16:54:00,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {2258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2258#true} is VALID [2018-11-14 16:54:00,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 16:54:00,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {2258#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2260#(= main_~i~0 1)} is VALID [2018-11-14 16:54:00,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {2260#(= main_~i~0 1)} assume true; {2260#(= main_~i~0 1)} is VALID [2018-11-14 16:54:00,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {2260#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2260#(= main_~i~0 1)} is VALID [2018-11-14 16:54:00,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {2260#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2260#(= main_~i~0 1)} is VALID [2018-11-14 16:54:00,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {2260#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {2261#(<= main_~i~0 2)} assume true; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {2261#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {2261#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {2262#(<= main_~i~0 3)} assume true; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,331 INFO L273 TraceCheckUtils]: 18: Hoare triple {2262#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {2262#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(<= main_~i~0 4)} assume true; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,333 INFO L273 TraceCheckUtils]: 21: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {2263#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {2263#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,335 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#(<= main_~i~0 5)} assume true; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,336 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:00,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {2265#(<= main_~i~0 6)} assume true; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:00,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {2265#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2259#false} is VALID [2018-11-14 16:54:00,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {2259#false} assume !(~swapped~0 != 0); {2259#false} is VALID [2018-11-14 16:54:00,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {2259#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2259#false} is VALID [2018-11-14 16:54:00,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {2259#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2259#false} is VALID [2018-11-14 16:54:00,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,341 INFO L273 TraceCheckUtils]: 36: Hoare triple {2259#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2259#false} is VALID [2018-11-14 16:54:00,341 INFO L256 TraceCheckUtils]: 37: Hoare triple {2259#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2259#false} is VALID [2018-11-14 16:54:00,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {2259#false} ~cond := #in~cond; {2259#false} is VALID [2018-11-14 16:54:00,342 INFO L273 TraceCheckUtils]: 39: Hoare triple {2259#false} assume ~cond == 0; {2259#false} is VALID [2018-11-14 16:54:00,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2018-11-14 16:54:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:00,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:00,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:00,356 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:54:00,377 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:54:00,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:00,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:00,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2018-11-14 16:54:00,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2258#true} is VALID [2018-11-14 16:54:00,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 16:54:00,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #83#return; {2258#true} is VALID [2018-11-14 16:54:00,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret8 := main(); {2258#true} is VALID [2018-11-14 16:54:00,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {2258#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2258#true} is VALID [2018-11-14 16:54:00,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {2258#true} assume true; {2258#true} is VALID [2018-11-14 16:54:00,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {2258#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:00,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {2290#(<= main_~i~0 1)} assume true; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:00,516 INFO L273 TraceCheckUtils]: 9: Hoare triple {2290#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:00,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {2290#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2290#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:00,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {2290#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {2261#(<= main_~i~0 2)} assume true; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {2261#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {2261#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2261#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:00,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {2261#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {2262#(<= main_~i~0 3)} assume true; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {2262#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {2262#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2262#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:00,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {2262#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {2263#(<= main_~i~0 4)} assume true; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {2263#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {2263#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2263#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:00,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {2263#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#(<= main_~i~0 5)} assume true; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2264#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:00,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:00,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {2265#(<= main_~i~0 6)} assume true; {2265#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:00,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {2265#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2259#false} is VALID [2018-11-14 16:54:00,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {2259#false} assume !(~swapped~0 != 0); {2259#false} is VALID [2018-11-14 16:54:00,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {2259#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2259#false} is VALID [2018-11-14 16:54:00,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {2259#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2259#false} is VALID [2018-11-14 16:54:00,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {2259#false} assume true; {2259#false} is VALID [2018-11-14 16:54:00,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {2259#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2259#false} is VALID [2018-11-14 16:54:00,535 INFO L256 TraceCheckUtils]: 37: Hoare triple {2259#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2259#false} is VALID [2018-11-14 16:54:00,536 INFO L273 TraceCheckUtils]: 38: Hoare triple {2259#false} ~cond := #in~cond; {2259#false} is VALID [2018-11-14 16:54:00,536 INFO L273 TraceCheckUtils]: 39: Hoare triple {2259#false} assume ~cond == 0; {2259#false} is VALID [2018-11-14 16:54:00,536 INFO L273 TraceCheckUtils]: 40: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2018-11-14 16:54:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:54:00,564 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 16:54:00,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:00,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:54:00,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:54:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:54:00,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:54:00,662 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 9 states. [2018-11-14 16:54:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:01,344 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2018-11-14 16:54:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:54:01,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 16:54:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:54:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 16:54:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:54:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2018-11-14 16:54:01,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2018-11-14 16:54:01,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:01,565 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:54:01,565 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 16:54:01,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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-14 16:54:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 16:54:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-11-14 16:54:01,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:01,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 74 states. [2018-11-14 16:54:01,613 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 74 states. [2018-11-14 16:54:01,613 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 74 states. [2018-11-14 16:54:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:01,616 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-14 16:54:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-14 16:54:01,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:01,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:01,616 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 78 states. [2018-11-14 16:54:01,617 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 78 states. [2018-11-14 16:54:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:01,619 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-11-14 16:54:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-14 16:54:01,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:01,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:01,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:01,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:54:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2018-11-14 16:54:01,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 41 [2018-11-14 16:54:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:01,623 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2018-11-14 16:54:01,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:54:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2018-11-14 16:54:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:54:01,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:01,624 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:01,625 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1485603564, now seen corresponding path program 6 times [2018-11-14 16:54:01,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:01,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {2820#true} call ULTIMATE.init(); {2820#true} is VALID [2018-11-14 16:54:01,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {2820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2820#true} is VALID [2018-11-14 16:54:01,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 16:54:01,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #83#return; {2820#true} is VALID [2018-11-14 16:54:01,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {2820#true} call #t~ret8 := main(); {2820#true} is VALID [2018-11-14 16:54:01,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {2820#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2820#true} is VALID [2018-11-14 16:54:01,816 INFO L273 TraceCheckUtils]: 6: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 16:54:01,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {2820#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2822#(= main_~i~0 1)} is VALID [2018-11-14 16:54:01,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {2822#(= main_~i~0 1)} assume true; {2822#(= main_~i~0 1)} is VALID [2018-11-14 16:54:01,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {2822#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2822#(= main_~i~0 1)} is VALID [2018-11-14 16:54:01,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {2822#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2822#(= main_~i~0 1)} is VALID [2018-11-14 16:54:01,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {2822#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:01,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {2823#(<= main_~i~0 2)} assume true; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:01,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {2823#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:01,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {2823#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:01,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {2823#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:01,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {2824#(<= main_~i~0 3)} assume true; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:01,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {2824#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:01,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {2824#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:01,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {2824#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:01,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {2825#(<= main_~i~0 4)} assume true; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:01,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {2825#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:01,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {2825#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:01,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {2825#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:01,896 INFO L273 TraceCheckUtils]: 24: Hoare triple {2826#(<= main_~i~0 5)} assume true; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:01,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {2826#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:01,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {2826#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:01,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {2826#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:01,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {2827#(<= main_~i~0 6)} assume true; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:01,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {2827#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:01,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {2827#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:01,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {2827#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:01,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {2828#(<= main_~i~0 7)} assume true; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:01,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {2828#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2821#false} is VALID [2018-11-14 16:54:01,900 INFO L273 TraceCheckUtils]: 34: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:01,900 INFO L273 TraceCheckUtils]: 35: Hoare triple {2821#false} assume !(~swapped~0 != 0); {2821#false} is VALID [2018-11-14 16:54:01,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {2821#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2821#false} is VALID [2018-11-14 16:54:01,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:01,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {2821#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2821#false} is VALID [2018-11-14 16:54:01,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:01,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {2821#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2821#false} is VALID [2018-11-14 16:54:01,902 INFO L256 TraceCheckUtils]: 41: Hoare triple {2821#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2821#false} is VALID [2018-11-14 16:54:01,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2018-11-14 16:54:01,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {2821#false} assume ~cond == 0; {2821#false} is VALID [2018-11-14 16:54:01,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2018-11-14 16:54:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:01,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:01,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:54:02,046 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-14 16:54:02,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:02,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:02,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {2820#true} call ULTIMATE.init(); {2820#true} is VALID [2018-11-14 16:54:02,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {2820#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2820#true} is VALID [2018-11-14 16:54:02,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 16:54:02,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #83#return; {2820#true} is VALID [2018-11-14 16:54:02,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {2820#true} call #t~ret8 := main(); {2820#true} is VALID [2018-11-14 16:54:02,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {2820#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {2820#true} is VALID [2018-11-14 16:54:02,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {2820#true} assume true; {2820#true} is VALID [2018-11-14 16:54:02,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {2820#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:02,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {2853#(<= main_~i~0 1)} assume true; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:02,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {2853#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2853#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:02,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {2853#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2853#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:02,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {2853#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:02,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {2823#(<= main_~i~0 2)} assume true; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:02,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {2823#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:02,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {2823#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2823#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:02,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {2823#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:02,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {2824#(<= main_~i~0 3)} assume true; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:02,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {2824#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:02,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {2824#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2824#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:02,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {2824#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:02,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {2825#(<= main_~i~0 4)} assume true; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:02,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {2825#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:02,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {2825#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2825#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:02,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {2825#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:02,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {2826#(<= main_~i~0 5)} assume true; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:02,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {2826#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:02,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {2826#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2826#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:02,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {2826#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:02,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {2827#(<= main_~i~0 6)} assume true; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:02,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {2827#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:02,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {2827#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {2827#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:02,853 INFO L273 TraceCheckUtils]: 31: Hoare triple {2827#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:02,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {2828#(<= main_~i~0 7)} assume true; {2828#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:02,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {2828#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2821#false} is VALID [2018-11-14 16:54:02,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:02,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {2821#false} assume !(~swapped~0 != 0); {2821#false} is VALID [2018-11-14 16:54:02,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {2821#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {2821#false} is VALID [2018-11-14 16:54:02,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:02,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {2821#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {2821#false} is VALID [2018-11-14 16:54:02,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {2821#false} assume true; {2821#false} is VALID [2018-11-14 16:54:02,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {2821#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {2821#false} is VALID [2018-11-14 16:54:02,856 INFO L256 TraceCheckUtils]: 41: Hoare triple {2821#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {2821#false} is VALID [2018-11-14 16:54:02,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2018-11-14 16:54:02,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {2821#false} assume ~cond == 0; {2821#false} is VALID [2018-11-14 16:54:02,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2018-11-14 16:54:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:54:02,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 16:54:02,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:02,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:54:03,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:03,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:54:03,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:54:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:54:03,002 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 10 states. [2018-11-14 16:54:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,326 INFO L93 Difference]: Finished difference Result 154 states and 190 transitions. [2018-11-14 16:54:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:54:03,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-14 16:54:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:54:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-14 16:54:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:54:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2018-11-14 16:54:03,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2018-11-14 16:54:03,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:03,445 INFO L225 Difference]: With dead ends: 154 [2018-11-14 16:54:03,445 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 16:54:03,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:54:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 16:54:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-14 16:54:03,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:03,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 82 states. [2018-11-14 16:54:03,471 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 82 states. [2018-11-14 16:54:03,471 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 82 states. [2018-11-14 16:54:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,475 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-14 16:54:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-14 16:54:03,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:03,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:03,476 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 86 states. [2018-11-14 16:54:03,476 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 86 states. [2018-11-14 16:54:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:03,479 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-14 16:54:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-11-14 16:54:03,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:03,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:03,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:03,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:54:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-14 16:54:03,483 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 45 [2018-11-14 16:54:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:03,483 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-14 16:54:03,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:54:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2018-11-14 16:54:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 16:54:03,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:03,485 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:03,485 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:03,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1791263380, now seen corresponding path program 7 times [2018-11-14 16:54:03,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:03,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:03,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:03,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {3441#true} call ULTIMATE.init(); {3441#true} is VALID [2018-11-14 16:54:03,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {3441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3441#true} is VALID [2018-11-14 16:54:03,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 16:54:03,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3441#true} {3441#true} #83#return; {3441#true} is VALID [2018-11-14 16:54:03,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {3441#true} call #t~ret8 := main(); {3441#true} is VALID [2018-11-14 16:54:03,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {3441#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3441#true} is VALID [2018-11-14 16:54:03,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 16:54:03,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {3441#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {3443#(= main_~i~0 1)} is VALID [2018-11-14 16:54:03,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {3443#(= main_~i~0 1)} assume true; {3443#(= main_~i~0 1)} is VALID [2018-11-14 16:54:03,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {3443#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3443#(= main_~i~0 1)} is VALID [2018-11-14 16:54:03,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {3443#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3443#(= main_~i~0 1)} is VALID [2018-11-14 16:54:03,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {3443#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:03,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#(<= main_~i~0 2)} assume true; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:03,649 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:03,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:03,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:03,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 3)} assume true; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:03,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:03,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {3445#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:03,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {3445#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:03,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {3446#(<= main_~i~0 4)} assume true; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:03,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:03,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:03,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {3446#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:03,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {3447#(<= main_~i~0 5)} assume true; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:03,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {3447#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:03,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {3447#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:03,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {3447#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:03,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#(<= main_~i~0 6)} assume true; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:03,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:03,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:03,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:03,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#(<= main_~i~0 7)} assume true; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:03,660 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:03,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:03,661 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:03,662 INFO L273 TraceCheckUtils]: 36: Hoare triple {3450#(<= main_~i~0 8)} assume true; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:03,663 INFO L273 TraceCheckUtils]: 37: Hoare triple {3450#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3442#false} is VALID [2018-11-14 16:54:03,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:03,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {3442#false} assume !(~swapped~0 != 0); {3442#false} is VALID [2018-11-14 16:54:03,665 INFO L273 TraceCheckUtils]: 40: Hoare triple {3442#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3442#false} is VALID [2018-11-14 16:54:03,666 INFO L273 TraceCheckUtils]: 41: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:03,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {3442#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {3442#false} is VALID [2018-11-14 16:54:03,666 INFO L273 TraceCheckUtils]: 43: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:03,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {3442#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {3442#false} is VALID [2018-11-14 16:54:03,667 INFO L256 TraceCheckUtils]: 45: Hoare triple {3442#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3442#false} is VALID [2018-11-14 16:54:03,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {3442#false} ~cond := #in~cond; {3442#false} is VALID [2018-11-14 16:54:03,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {3442#false} assume ~cond == 0; {3442#false} is VALID [2018-11-14 16:54:03,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {3442#false} assume !false; {3442#false} is VALID [2018-11-14 16:54:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:03,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:03,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:03,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:04,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {3441#true} call ULTIMATE.init(); {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {3441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3441#true} {3441#true} #83#return; {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {3441#true} call #t~ret8 := main(); {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {3441#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {3441#true} is VALID [2018-11-14 16:54:04,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#true} assume true; {3441#true} is VALID [2018-11-14 16:54:04,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {3441#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:04,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {3475#(<= main_~i~0 1)} assume true; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:04,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {3475#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3475#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:04,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {3475#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3475#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:04,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {3475#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:04,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#(<= main_~i~0 2)} assume true; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:04,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:04,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3444#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:04,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:04,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 3)} assume true; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:04,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:04,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {3445#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3445#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:04,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {3445#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:04,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {3446#(<= main_~i~0 4)} assume true; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:04,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:04,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3446#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:04,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {3446#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:04,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {3447#(<= main_~i~0 5)} assume true; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:04,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {3447#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:04,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {3447#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3447#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:04,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {3447#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:04,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {3448#(<= main_~i~0 6)} assume true; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:04,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {3448#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:04,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {3448#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3448#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:04,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {3448#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:04,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {3449#(<= main_~i~0 7)} assume true; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:04,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {3449#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:04,109 INFO L273 TraceCheckUtils]: 34: Hoare triple {3449#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {3449#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:04,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {3449#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:04,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {3450#(<= main_~i~0 8)} assume true; {3450#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:04,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {3450#(<= main_~i~0 8)} assume !(~i~0 < 100000); {3442#false} is VALID [2018-11-14 16:54:04,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:04,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {3442#false} assume !(~swapped~0 != 0); {3442#false} is VALID [2018-11-14 16:54:04,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {3442#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {3442#false} is VALID [2018-11-14 16:54:04,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:04,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {3442#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {3442#false} is VALID [2018-11-14 16:54:04,113 INFO L273 TraceCheckUtils]: 43: Hoare triple {3442#false} assume true; {3442#false} is VALID [2018-11-14 16:54:04,113 INFO L273 TraceCheckUtils]: 44: Hoare triple {3442#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {3442#false} is VALID [2018-11-14 16:54:04,113 INFO L256 TraceCheckUtils]: 45: Hoare triple {3442#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {3442#false} is VALID [2018-11-14 16:54:04,113 INFO L273 TraceCheckUtils]: 46: Hoare triple {3442#false} ~cond := #in~cond; {3442#false} is VALID [2018-11-14 16:54:04,113 INFO L273 TraceCheckUtils]: 47: Hoare triple {3442#false} assume ~cond == 0; {3442#false} is VALID [2018-11-14 16:54:04,114 INFO L273 TraceCheckUtils]: 48: Hoare triple {3442#false} assume !false; {3442#false} is VALID [2018-11-14 16:54:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:04,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:04,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:54:04,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 16:54:04,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:04,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:54:04,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:04,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:54:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:54:04,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:04,189 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 11 states. [2018-11-14 16:54:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,554 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2018-11-14 16:54:04,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:54:04,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-14 16:54:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-14 16:54:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:54:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2018-11-14 16:54:04,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2018-11-14 16:54:04,725 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-14 16:54:04,726 INFO L225 Difference]: With dead ends: 170 [2018-11-14 16:54:04,727 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 16:54:04,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:54:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 16:54:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-11-14 16:54:04,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:04,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 90 states. [2018-11-14 16:54:04,770 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 90 states. [2018-11-14 16:54:04,770 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 90 states. [2018-11-14 16:54:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,772 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-14 16:54:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-11-14 16:54:04,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,773 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 94 states. [2018-11-14 16:54:04,773 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 94 states. [2018-11-14 16:54:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:04,775 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-14 16:54:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-11-14 16:54:04,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:04,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:04,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:04,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 16:54:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2018-11-14 16:54:04,778 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 49 [2018-11-14 16:54:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:04,778 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2018-11-14 16:54:04,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:54:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2018-11-14 16:54:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:54:04,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:04,780 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:04,780 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:04,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1675334084, now seen corresponding path program 8 times [2018-11-14 16:54:04,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:04,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:06,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-14 16:54:06,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4121#true} is VALID [2018-11-14 16:54:06,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 16:54:06,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #83#return; {4121#true} is VALID [2018-11-14 16:54:06,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret8 := main(); {4121#true} is VALID [2018-11-14 16:54:06,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4121#true} is VALID [2018-11-14 16:54:06,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 16:54:06,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4123#(= main_~i~0 1)} is VALID [2018-11-14 16:54:06,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {4123#(= main_~i~0 1)} assume true; {4123#(= main_~i~0 1)} is VALID [2018-11-14 16:54:06,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {4123#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4123#(= main_~i~0 1)} is VALID [2018-11-14 16:54:06,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {4123#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4123#(= main_~i~0 1)} is VALID [2018-11-14 16:54:06,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {4123#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#(<= main_~i~0 2)} assume true; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {4125#(<= main_~i~0 3)} assume true; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {4125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 4)} assume true; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 5)} assume true; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,031 INFO L273 TraceCheckUtils]: 27: Hoare triple {4127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,031 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 6)} assume true; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {4128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {4128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,033 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 7)} assume true; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {4129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {4129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,040 INFO L273 TraceCheckUtils]: 35: Hoare triple {4129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {4130#(<= main_~i~0 8)} assume true; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {4130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {4130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {4130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:06,041 INFO L273 TraceCheckUtils]: 40: Hoare triple {4131#(<= main_~i~0 9)} assume true; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:06,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {4131#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4122#false} is VALID [2018-11-14 16:54:06,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {4122#false} assume !(~swapped~0 != 0); {4122#false} is VALID [2018-11-14 16:54:06,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {4122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4122#false} is VALID [2018-11-14 16:54:06,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L273 TraceCheckUtils]: 46: Hoare triple {4122#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L273 TraceCheckUtils]: 47: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {4122#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L256 TraceCheckUtils]: 49: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-14 16:54:06,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} assume ~cond == 0; {4122#false} is VALID [2018-11-14 16:54:06,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-14 16:54:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:06,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:06,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:06,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:06,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:06,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:06,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:06,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {4121#true} call ULTIMATE.init(); {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {4121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4121#true} {4121#true} #83#return; {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {4121#true} call #t~ret8 := main(); {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4121#true} is VALID [2018-11-14 16:54:06,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#true} assume true; {4121#true} is VALID [2018-11-14 16:54:06,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:06,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {4156#(<= main_~i~0 1)} assume true; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:06,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {4156#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4156#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:06,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {4156#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4156#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:06,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {4156#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#(<= main_~i~0 2)} assume true; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4124#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:06,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {4125#(<= main_~i~0 3)} assume true; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {4125#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {4125#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4125#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:06,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {4125#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {4126#(<= main_~i~0 4)} assume true; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {4126#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {4126#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4126#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:06,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {4126#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {4127#(<= main_~i~0 5)} assume true; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {4127#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {4127#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4127#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:06,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {4127#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {4128#(<= main_~i~0 6)} assume true; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {4128#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {4128#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4128#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:06,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {4128#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {4129#(<= main_~i~0 7)} assume true; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {4129#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {4129#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4129#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:06,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {4129#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {4130#(<= main_~i~0 8)} assume true; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {4130#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {4130#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4130#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:06,237 INFO L273 TraceCheckUtils]: 39: Hoare triple {4130#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:06,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {4131#(<= main_~i~0 9)} assume true; {4131#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:06,245 INFO L273 TraceCheckUtils]: 41: Hoare triple {4131#(<= main_~i~0 9)} assume !(~i~0 < 100000); {4122#false} is VALID [2018-11-14 16:54:06,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {4122#false} assume !(~swapped~0 != 0); {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {4122#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {4122#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {4122#false} assume true; {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {4122#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L256 TraceCheckUtils]: 49: Hoare triple {4122#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4122#false} is VALID [2018-11-14 16:54:06,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {4122#false} ~cond := #in~cond; {4122#false} is VALID [2018-11-14 16:54:06,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {4122#false} assume ~cond == 0; {4122#false} is VALID [2018-11-14 16:54:06,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {4122#false} assume !false; {4122#false} is VALID [2018-11-14 16:54:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:06,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:06,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:54:06,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 16:54:06,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:06,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:54:06,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:06,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:54:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:54:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:06,346 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 12 states. [2018-11-14 16:54:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,660 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2018-11-14 16:54:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:54:06,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-14 16:54:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 16:54:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:54:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-14 16:54:06,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2018-11-14 16:54:06,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:06,824 INFO L225 Difference]: With dead ends: 186 [2018-11-14 16:54:06,824 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 16:54:06,825 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:54:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 16:54:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-14 16:54:06,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:06,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 98 states. [2018-11-14 16:54:06,859 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 98 states. [2018-11-14 16:54:06,860 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 98 states. [2018-11-14 16:54:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,862 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2018-11-14 16:54:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2018-11-14 16:54:06,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:06,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:06,863 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 102 states. [2018-11-14 16:54:06,863 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 102 states. [2018-11-14 16:54:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:06,866 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2018-11-14 16:54:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2018-11-14 16:54:06,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:06,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:06,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:06,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:54:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-14 16:54:06,869 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 53 [2018-11-14 16:54:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:06,870 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-14 16:54:06,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:54:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 16:54:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:54:06,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:06,871 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:06,871 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:06,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 19511836, now seen corresponding path program 9 times [2018-11-14 16:54:06,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:06,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:07,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2018-11-14 16:54:07,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {4860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4860#true} is VALID [2018-11-14 16:54:07,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 16:54:07,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #83#return; {4860#true} is VALID [2018-11-14 16:54:07,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret8 := main(); {4860#true} is VALID [2018-11-14 16:54:07,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {4860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4860#true} is VALID [2018-11-14 16:54:07,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 16:54:07,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {4860#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4862#(= main_~i~0 1)} is VALID [2018-11-14 16:54:07,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {4862#(= main_~i~0 1)} assume true; {4862#(= main_~i~0 1)} is VALID [2018-11-14 16:54:07,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {4862#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4862#(= main_~i~0 1)} is VALID [2018-11-14 16:54:07,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {4862#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4862#(= main_~i~0 1)} is VALID [2018-11-14 16:54:07,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {4862#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {4863#(<= main_~i~0 2)} assume true; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {4863#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4863#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {4863#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4863#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:07,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {4863#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:07,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {4864#(<= main_~i~0 3)} assume true; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:07,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {4864#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4864#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:07,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {4864#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4864#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:07,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {4864#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:07,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {4865#(<= main_~i~0 4)} assume true; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:07,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {4865#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4865#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:07,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {4865#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4865#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:07,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {4865#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:07,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {4866#(<= main_~i~0 5)} assume true; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:07,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {4866#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4866#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:07,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4866#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:07,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:07,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 6)} assume true; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:07,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4867#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:07,138 INFO L273 TraceCheckUtils]: 30: Hoare triple {4867#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4867#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:07,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {4867#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:07,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {4868#(<= main_~i~0 7)} assume true; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:07,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {4868#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4868#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:07,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {4868#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4868#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:07,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {4868#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:07,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {4869#(<= main_~i~0 8)} assume true; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:07,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {4869#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4869#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:07,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {4869#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4869#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:07,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {4869#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:07,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {4870#(<= main_~i~0 9)} assume true; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:07,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {4870#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4870#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:07,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {4870#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4870#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:07,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {4870#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:07,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {4871#(<= main_~i~0 10)} assume true; {4871#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:07,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {4871#(<= main_~i~0 10)} assume !(~i~0 < 100000); {4861#false} is VALID [2018-11-14 16:54:07,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 16:54:07,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {4861#false} assume !(~swapped~0 != 0); {4861#false} is VALID [2018-11-14 16:54:07,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {4861#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {4861#false} is VALID [2018-11-14 16:54:07,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 16:54:07,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {4861#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {4861#false} is VALID [2018-11-14 16:54:07,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {4861#false} assume true; {4861#false} is VALID [2018-11-14 16:54:07,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {4861#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {4861#false} is VALID [2018-11-14 16:54:07,153 INFO L256 TraceCheckUtils]: 53: Hoare triple {4861#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {4861#false} is VALID [2018-11-14 16:54:07,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {4861#false} ~cond := #in~cond; {4861#false} is VALID [2018-11-14 16:54:07,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {4861#false} assume ~cond == 0; {4861#false} is VALID [2018-11-14 16:54:07,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2018-11-14 16:54:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 2 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:54:07,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:07,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:07,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:07,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:54:07,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:07,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:07,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-14 16:54:07,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-14 16:54:07,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:54:07,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:54:07,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:54:07,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-14 16:54:07,813 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:54:07,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {4860#true} call ULTIMATE.init(); {4860#true} is VALID [2018-11-14 16:54:07,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {4860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4860#true} is VALID [2018-11-14 16:54:07,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {4860#true} assume true; {4860#true} is VALID [2018-11-14 16:54:07,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4860#true} {4860#true} #83#return; {4860#true} is VALID [2018-11-14 16:54:07,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {4860#true} call #t~ret8 := main(); {4860#true} is VALID [2018-11-14 16:54:07,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {4860#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {4890#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {4890#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume true; {4890#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {4890#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {4897#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {4897#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {4897#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {4897#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4904#(and (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {4904#(and (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,945 INFO L273 TraceCheckUtils]: 19: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,957 INFO L273 TraceCheckUtils]: 33: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,958 INFO L273 TraceCheckUtils]: 34: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,963 INFO L273 TraceCheckUtils]: 39: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:07,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,029 INFO L273 TraceCheckUtils]: 45: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(~swapped~0 != 0); {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {4908#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5023#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,041 INFO L273 TraceCheckUtils]: 49: Hoare triple {5023#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume true; {5023#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,058 INFO L273 TraceCheckUtils]: 50: Hoare triple {5023#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {5030#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {5030#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume true; {5030#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:08,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {5030#(and (<= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5037#(<= |main_#t~mem6| |main_#t~mem7|)} is VALID [2018-11-14 16:54:08,080 INFO L256 TraceCheckUtils]: 53: Hoare triple {5037#(<= |main_#t~mem6| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5041#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:54:08,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {5041#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5045#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:54:08,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {5045#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {4861#false} is VALID [2018-11-14 16:54:08,082 INFO L273 TraceCheckUtils]: 56: Hoare triple {4861#false} assume !false; {4861#false} is VALID [2018-11-14 16:54:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-14 16:54:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-14 16:54:08,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-14 16:54:08,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:08,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:54:08,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:08,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:54:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:54:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-11-14 16:54:08,212 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 21 states. [2018-11-14 16:54:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:11,504 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2018-11-14 16:54:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 16:54:11,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-14 16:54:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:54:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-14 16:54:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:54:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 187 transitions. [2018-11-14 16:54:11,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 187 transitions. [2018-11-14 16:54:12,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:12,031 INFO L225 Difference]: With dead ends: 222 [2018-11-14 16:54:12,032 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 16:54:12,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=409, Invalid=1571, Unknown=0, NotChecked=0, Total=1980 [2018-11-14 16:54:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 16:54:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2018-11-14 16:54:12,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:12,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 115 states. [2018-11-14 16:54:12,107 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 115 states. [2018-11-14 16:54:12,108 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 115 states. [2018-11-14 16:54:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:12,113 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-14 16:54:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2018-11-14 16:54:12,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:12,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:12,114 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 130 states. [2018-11-14 16:54:12,114 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 130 states. [2018-11-14 16:54:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:12,119 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-14 16:54:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2018-11-14 16:54:12,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:12,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:12,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:12,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 16:54:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2018-11-14 16:54:12,123 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 57 [2018-11-14 16:54:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:12,124 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2018-11-14 16:54:12,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:54:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2018-11-14 16:54:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 16:54:12,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:12,125 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:12,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:12,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2024712611, now seen corresponding path program 1 times [2018-11-14 16:54:12,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:12,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:12,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:12,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:12,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2018-11-14 16:54:12,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {5794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #83#return; {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {5794#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#true} assume true; {5794#true} is VALID [2018-11-14 16:54:12,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {5796#(= main_~i~0 1)} is VALID [2018-11-14 16:54:12,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {5796#(= main_~i~0 1)} assume true; {5796#(= main_~i~0 1)} is VALID [2018-11-14 16:54:12,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {5796#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5796#(= main_~i~0 1)} is VALID [2018-11-14 16:54:12,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {5796#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5796#(= main_~i~0 1)} is VALID [2018-11-14 16:54:12,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {5796#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {5797#(<= main_~i~0 2)} assume true; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {5797#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {5797#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {5797#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {5798#(<= main_~i~0 3)} assume true; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {5798#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {5798#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {5798#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {5799#(<= main_~i~0 4)} assume true; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {5799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {5799#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {5799#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {5800#(<= main_~i~0 5)} assume true; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {5800#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {5800#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {5800#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {5801#(<= main_~i~0 6)} assume true; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {5801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {5801#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {5801#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {5802#(<= main_~i~0 7)} assume true; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {5802#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {5802#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {5802#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:12,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {5803#(<= main_~i~0 8)} assume true; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:12,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {5803#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:12,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {5803#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:12,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {5803#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:12,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {5804#(<= main_~i~0 9)} assume true; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:12,771 INFO L273 TraceCheckUtils]: 41: Hoare triple {5804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:12,772 INFO L273 TraceCheckUtils]: 42: Hoare triple {5804#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:12,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {5804#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:12,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {5805#(<= main_~i~0 10)} assume true; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:12,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {5805#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:12,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {5805#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:12,775 INFO L273 TraceCheckUtils]: 47: Hoare triple {5805#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5806#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:12,775 INFO L273 TraceCheckUtils]: 48: Hoare triple {5806#(<= main_~i~0 11)} assume true; {5806#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:12,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {5806#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5795#false} is VALID [2018-11-14 16:54:12,776 INFO L273 TraceCheckUtils]: 50: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:12,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {5795#false} assume !(~swapped~0 != 0); {5795#false} is VALID [2018-11-14 16:54:12,776 INFO L273 TraceCheckUtils]: 52: Hoare triple {5795#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5795#false} is VALID [2018-11-14 16:54:12,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:12,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {5795#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {5795#false} is VALID [2018-11-14 16:54:12,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:12,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {5795#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5795#false} is VALID [2018-11-14 16:54:12,777 INFO L256 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5794#true} is VALID [2018-11-14 16:54:12,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2018-11-14 16:54:12,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {5794#true} assume !(~cond == 0); {5794#true} is VALID [2018-11-14 16:54:12,778 INFO L273 TraceCheckUtils]: 60: Hoare triple {5794#true} assume true; {5794#true} is VALID [2018-11-14 16:54:12,778 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5794#true} {5795#false} #87#return; {5795#false} is VALID [2018-11-14 16:54:12,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {5795#false} havoc #t~mem7;havoc #t~mem6; {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 63: Hoare triple {5795#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 65: Hoare triple {5795#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L256 TraceCheckUtils]: 66: Hoare triple {5795#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 67: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 68: Hoare triple {5795#false} assume ~cond == 0; {5795#false} is VALID [2018-11-14 16:54:12,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2018-11-14 16:54:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 4 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:54:12,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:12,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:12,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:12,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:12,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2018-11-14 16:54:12,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {5794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5794#true} is VALID [2018-11-14 16:54:12,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2018-11-14 16:54:12,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #83#return; {5794#true} is VALID [2018-11-14 16:54:12,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2018-11-14 16:54:12,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {5794#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {5794#true} is VALID [2018-11-14 16:54:12,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#true} assume true; {5794#true} is VALID [2018-11-14 16:54:12,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {5831#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {5831#(<= main_~i~0 1)} assume true; {5831#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {5831#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5831#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {5831#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5831#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:12,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {5831#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {5797#(<= main_~i~0 2)} assume true; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {5797#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {5797#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5797#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:12,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {5797#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {5798#(<= main_~i~0 3)} assume true; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {5798#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,991 INFO L273 TraceCheckUtils]: 18: Hoare triple {5798#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5798#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:12,992 INFO L273 TraceCheckUtils]: 19: Hoare triple {5798#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {5799#(<= main_~i~0 4)} assume true; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {5799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {5799#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5799#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:12,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {5799#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,994 INFO L273 TraceCheckUtils]: 24: Hoare triple {5800#(<= main_~i~0 5)} assume true; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {5800#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,995 INFO L273 TraceCheckUtils]: 26: Hoare triple {5800#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5800#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:12,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {5800#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {5801#(<= main_~i~0 6)} assume true; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,997 INFO L273 TraceCheckUtils]: 29: Hoare triple {5801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {5801#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5801#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:12,998 INFO L273 TraceCheckUtils]: 31: Hoare triple {5801#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {5802#(<= main_~i~0 7)} assume true; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:12,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {5802#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:13,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {5802#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5802#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:13,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {5802#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:13,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {5803#(<= main_~i~0 8)} assume true; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:13,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {5803#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:13,002 INFO L273 TraceCheckUtils]: 38: Hoare triple {5803#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5803#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:13,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {5803#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:13,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {5804#(<= main_~i~0 9)} assume true; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:13,004 INFO L273 TraceCheckUtils]: 41: Hoare triple {5804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:13,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {5804#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5804#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:13,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {5804#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:13,005 INFO L273 TraceCheckUtils]: 44: Hoare triple {5805#(<= main_~i~0 10)} assume true; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:13,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {5805#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:13,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {5805#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {5805#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:13,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {5805#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {5806#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:13,008 INFO L273 TraceCheckUtils]: 48: Hoare triple {5806#(<= main_~i~0 11)} assume true; {5806#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:13,008 INFO L273 TraceCheckUtils]: 49: Hoare triple {5806#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5795#false} is VALID [2018-11-14 16:54:13,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:13,009 INFO L273 TraceCheckUtils]: 51: Hoare triple {5795#false} assume !(~swapped~0 != 0); {5795#false} is VALID [2018-11-14 16:54:13,009 INFO L273 TraceCheckUtils]: 52: Hoare triple {5795#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {5795#false} is VALID [2018-11-14 16:54:13,009 INFO L273 TraceCheckUtils]: 53: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:13,009 INFO L273 TraceCheckUtils]: 54: Hoare triple {5795#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {5795#false} is VALID [2018-11-14 16:54:13,009 INFO L273 TraceCheckUtils]: 55: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:13,010 INFO L273 TraceCheckUtils]: 56: Hoare triple {5795#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5795#false} is VALID [2018-11-14 16:54:13,010 INFO L256 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5795#false} is VALID [2018-11-14 16:54:13,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2018-11-14 16:54:13,010 INFO L273 TraceCheckUtils]: 59: Hoare triple {5795#false} assume !(~cond == 0); {5795#false} is VALID [2018-11-14 16:54:13,010 INFO L273 TraceCheckUtils]: 60: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:13,011 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5795#false} {5795#false} #87#return; {5795#false} is VALID [2018-11-14 16:54:13,011 INFO L273 TraceCheckUtils]: 62: Hoare triple {5795#false} havoc #t~mem7;havoc #t~mem6; {5795#false} is VALID [2018-11-14 16:54:13,011 INFO L273 TraceCheckUtils]: 63: Hoare triple {5795#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {5795#false} is VALID [2018-11-14 16:54:13,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {5795#false} assume true; {5795#false} is VALID [2018-11-14 16:54:13,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {5795#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {5795#false} is VALID [2018-11-14 16:54:13,012 INFO L256 TraceCheckUtils]: 66: Hoare triple {5795#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {5795#false} is VALID [2018-11-14 16:54:13,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2018-11-14 16:54:13,012 INFO L273 TraceCheckUtils]: 68: Hoare triple {5795#false} assume ~cond == 0; {5795#false} is VALID [2018-11-14 16:54:13,012 INFO L273 TraceCheckUtils]: 69: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2018-11-14 16:54:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:54:13,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:13,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:54:13,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-14 16:54:13,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:13,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:54:13,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:13,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:54:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:54:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:54:13,101 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand 14 states. [2018-11-14 16:54:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:13,678 INFO L93 Difference]: Finished difference Result 236 states and 288 transitions. [2018-11-14 16:54:13,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:54:13,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-14 16:54:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:54:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-14 16:54:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:54:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2018-11-14 16:54:13,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2018-11-14 16:54:14,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:54:14,334 INFO L225 Difference]: With dead ends: 236 [2018-11-14 16:54:14,334 INFO L226 Difference]: Without dead ends: 127 [2018-11-14 16:54:14,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 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-14 16:54:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-14 16:54:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-11-14 16:54:14,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:14,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 123 states. [2018-11-14 16:54:14,434 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 123 states. [2018-11-14 16:54:14,434 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 123 states. [2018-11-14 16:54:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:14,439 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-11-14 16:54:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2018-11-14 16:54:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:14,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:14,440 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 127 states. [2018-11-14 16:54:14,440 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 127 states. [2018-11-14 16:54:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:14,444 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-11-14 16:54:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2018-11-14 16:54:14,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:14,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:14,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:14,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 16:54:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2018-11-14 16:54:14,448 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 70 [2018-11-14 16:54:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:14,448 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2018-11-14 16:54:14,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:54:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2018-11-14 16:54:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 16:54:14,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:14,449 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:14,450 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:14,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:14,450 INFO L82 PathProgramCache]: Analyzing trace with hash -851580667, now seen corresponding path program 2 times [2018-11-14 16:54:14,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:14,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:54:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:15,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {6735#true} call ULTIMATE.init(); {6735#true} is VALID [2018-11-14 16:54:15,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {6735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6735#true} is VALID [2018-11-14 16:54:15,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {6735#true} assume true; {6735#true} is VALID [2018-11-14 16:54:15,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6735#true} {6735#true} #83#return; {6735#true} is VALID [2018-11-14 16:54:15,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {6735#true} call #t~ret8 := main(); {6735#true} is VALID [2018-11-14 16:54:15,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {6735#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6735#true} is VALID [2018-11-14 16:54:15,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {6735#true} assume true; {6735#true} is VALID [2018-11-14 16:54:15,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {6735#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {6737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:15,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {6737#(= main_~i~0 1)} assume true; {6737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:15,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {6737#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:15,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {6737#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:15,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {6737#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {6738#(<= main_~i~0 2)} assume true; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {6738#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {6738#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {6738#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {6739#(<= main_~i~0 3)} assume true; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {6739#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {6739#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {6739#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {6740#(<= main_~i~0 4)} assume true; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {6740#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {6740#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {6740#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {6741#(<= main_~i~0 5)} assume true; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {6741#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {6741#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {6741#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,055 INFO L273 TraceCheckUtils]: 28: Hoare triple {6742#(<= main_~i~0 6)} assume true; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,056 INFO L273 TraceCheckUtils]: 29: Hoare triple {6742#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,056 INFO L273 TraceCheckUtils]: 30: Hoare triple {6742#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,057 INFO L273 TraceCheckUtils]: 31: Hoare triple {6742#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,058 INFO L273 TraceCheckUtils]: 32: Hoare triple {6743#(<= main_~i~0 7)} assume true; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,058 INFO L273 TraceCheckUtils]: 33: Hoare triple {6743#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,059 INFO L273 TraceCheckUtils]: 34: Hoare triple {6743#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,059 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {6744#(<= main_~i~0 8)} assume true; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {6744#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {6744#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,062 INFO L273 TraceCheckUtils]: 40: Hoare triple {6745#(<= main_~i~0 9)} assume true; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,063 INFO L273 TraceCheckUtils]: 42: Hoare triple {6745#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,064 INFO L273 TraceCheckUtils]: 43: Hoare triple {6745#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,064 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 10)} assume true; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {6746#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,065 INFO L273 TraceCheckUtils]: 46: Hoare triple {6746#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {6746#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,067 INFO L273 TraceCheckUtils]: 48: Hoare triple {6747#(<= main_~i~0 11)} assume true; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,067 INFO L273 TraceCheckUtils]: 49: Hoare triple {6747#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,068 INFO L273 TraceCheckUtils]: 50: Hoare triple {6747#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {6747#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:15,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {6748#(<= main_~i~0 12)} assume true; {6748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:15,070 INFO L273 TraceCheckUtils]: 53: Hoare triple {6748#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6736#false} is VALID [2018-11-14 16:54:15,070 INFO L273 TraceCheckUtils]: 54: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,070 INFO L273 TraceCheckUtils]: 55: Hoare triple {6736#false} assume !(~swapped~0 != 0); {6736#false} is VALID [2018-11-14 16:54:15,070 INFO L273 TraceCheckUtils]: 56: Hoare triple {6736#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6736#false} is VALID [2018-11-14 16:54:15,071 INFO L273 TraceCheckUtils]: 57: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,071 INFO L273 TraceCheckUtils]: 58: Hoare triple {6736#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {6736#false} is VALID [2018-11-14 16:54:15,071 INFO L273 TraceCheckUtils]: 59: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,071 INFO L273 TraceCheckUtils]: 60: Hoare triple {6736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6736#false} is VALID [2018-11-14 16:54:15,071 INFO L256 TraceCheckUtils]: 61: Hoare triple {6736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6735#true} is VALID [2018-11-14 16:54:15,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {6735#true} ~cond := #in~cond; {6735#true} is VALID [2018-11-14 16:54:15,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {6735#true} assume !(~cond == 0); {6735#true} is VALID [2018-11-14 16:54:15,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {6735#true} assume true; {6735#true} is VALID [2018-11-14 16:54:15,072 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6735#true} {6736#false} #87#return; {6736#false} is VALID [2018-11-14 16:54:15,072 INFO L273 TraceCheckUtils]: 66: Hoare triple {6736#false} havoc #t~mem7;havoc #t~mem6; {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {6736#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {6736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L256 TraceCheckUtils]: 70: Hoare triple {6736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 71: Hoare triple {6736#false} ~cond := #in~cond; {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {6736#false} assume ~cond == 0; {6736#false} is VALID [2018-11-14 16:54:15,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {6736#false} assume !false; {6736#false} is VALID [2018-11-14 16:54:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 242 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:54:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:15,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:15,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:54:15,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:54:15,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:15,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:15,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {6735#true} call ULTIMATE.init(); {6735#true} is VALID [2018-11-14 16:54:15,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {6735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6735#true} is VALID [2018-11-14 16:54:15,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {6735#true} assume true; {6735#true} is VALID [2018-11-14 16:54:15,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6735#true} {6735#true} #83#return; {6735#true} is VALID [2018-11-14 16:54:15,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {6735#true} call #t~ret8 := main(); {6735#true} is VALID [2018-11-14 16:54:15,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {6735#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {6735#true} is VALID [2018-11-14 16:54:15,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {6735#true} assume true; {6735#true} is VALID [2018-11-14 16:54:15,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {6735#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {6773#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:15,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {6773#(<= main_~i~0 1)} assume true; {6773#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:15,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {6773#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6773#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:15,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {6773#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6773#(<= main_~i~0 1)} is VALID [2018-11-14 16:54:15,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {6773#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {6738#(<= main_~i~0 2)} assume true; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {6738#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {6738#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:15,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {6738#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {6739#(<= main_~i~0 3)} assume true; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {6739#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {6739#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:15,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {6739#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {6740#(<= main_~i~0 4)} assume true; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {6740#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {6740#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:15,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {6740#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {6741#(<= main_~i~0 5)} assume true; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {6741#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {6741#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:15,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {6741#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {6742#(<= main_~i~0 6)} assume true; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {6742#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {6742#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:15,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {6742#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {6743#(<= main_~i~0 7)} assume true; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {6743#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {6743#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:15,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {6743#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,310 INFO L273 TraceCheckUtils]: 36: Hoare triple {6744#(<= main_~i~0 8)} assume true; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {6744#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {6744#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:15,312 INFO L273 TraceCheckUtils]: 39: Hoare triple {6744#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,313 INFO L273 TraceCheckUtils]: 40: Hoare triple {6745#(<= main_~i~0 9)} assume true; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,313 INFO L273 TraceCheckUtils]: 41: Hoare triple {6745#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {6745#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:15,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {6745#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {6746#(<= main_~i~0 10)} assume true; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {6746#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {6746#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:15,317 INFO L273 TraceCheckUtils]: 47: Hoare triple {6746#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {6747#(<= main_~i~0 11)} assume true; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,318 INFO L273 TraceCheckUtils]: 49: Hoare triple {6747#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {6747#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {6747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:15,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {6747#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {6748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:15,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {6748#(<= main_~i~0 12)} assume true; {6748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:15,320 INFO L273 TraceCheckUtils]: 53: Hoare triple {6748#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6736#false} is VALID [2018-11-14 16:54:15,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {6736#false} assume !(~swapped~0 != 0); {6736#false} is VALID [2018-11-14 16:54:15,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {6736#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {6736#false} is VALID [2018-11-14 16:54:15,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {6736#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {6736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L256 TraceCheckUtils]: 61: Hoare triple {6736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {6736#false} ~cond := #in~cond; {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {6736#false} assume !(~cond == 0); {6736#false} is VALID [2018-11-14 16:54:15,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6736#false} {6736#false} #87#return; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {6736#false} havoc #t~mem7;havoc #t~mem6; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {6736#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {6736#false} assume true; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 69: Hoare triple {6736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L256 TraceCheckUtils]: 70: Hoare triple {6736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 71: Hoare triple {6736#false} ~cond := #in~cond; {6736#false} is VALID [2018-11-14 16:54:15,323 INFO L273 TraceCheckUtils]: 72: Hoare triple {6736#false} assume ~cond == 0; {6736#false} is VALID [2018-11-14 16:54:15,324 INFO L273 TraceCheckUtils]: 73: Hoare triple {6736#false} assume !false; {6736#false} is VALID [2018-11-14 16:54:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 242 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:54:15,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:15,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:54:15,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-11-14 16:54:15,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:15,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:54:15,416 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-14 16:54:15,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:54:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:54:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:54:15,417 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 15 states. [2018-11-14 16:54:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:16,431 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2018-11-14 16:54:16,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:54:16,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-11-14 16:54:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:54:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:54:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2018-11-14 16:54:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:54:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2018-11-14 16:54:16,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2018-11-14 16:54:16,561 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-14 16:54:16,565 INFO L225 Difference]: With dead ends: 252 [2018-11-14 16:54:16,565 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 16:54:16,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 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-14 16:54:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 16:54:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2018-11-14 16:54:16,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:54:16,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 131 states. [2018-11-14 16:54:16,669 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 131 states. [2018-11-14 16:54:16,669 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 131 states. [2018-11-14 16:54:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:16,672 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-11-14 16:54:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2018-11-14 16:54:16,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:16,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:16,673 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 135 states. [2018-11-14 16:54:16,673 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 135 states. [2018-11-14 16:54:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:54:16,676 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2018-11-14 16:54:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2018-11-14 16:54:16,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:54:16,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:54:16,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:54:16,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:54:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-14 16:54:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 158 transitions. [2018-11-14 16:54:16,679 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 158 transitions. Word has length 74 [2018-11-14 16:54:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:54:16,680 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 158 transitions. [2018-11-14 16:54:16,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:54:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 158 transitions. [2018-11-14 16:54:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 16:54:16,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:54:16,681 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:54:16,681 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:54:16,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:54:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1339090861, now seen corresponding path program 3 times [2018-11-14 16:54:16,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:54:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:54:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:16,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:54:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:54:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:17,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {7735#true} call ULTIMATE.init(); {7735#true} is VALID [2018-11-14 16:54:17,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {7735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7735#true} is VALID [2018-11-14 16:54:17,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {7735#true} assume true; {7735#true} is VALID [2018-11-14 16:54:17,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7735#true} {7735#true} #83#return; {7735#true} is VALID [2018-11-14 16:54:17,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {7735#true} call #t~ret8 := main(); {7735#true} is VALID [2018-11-14 16:54:17,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {7735#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7735#true} is VALID [2018-11-14 16:54:17,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {7735#true} assume true; {7735#true} is VALID [2018-11-14 16:54:17,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {7735#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {7737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:17,472 INFO L273 TraceCheckUtils]: 8: Hoare triple {7737#(= main_~i~0 1)} assume true; {7737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:17,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {7737#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:17,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {7737#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7737#(= main_~i~0 1)} is VALID [2018-11-14 16:54:17,474 INFO L273 TraceCheckUtils]: 11: Hoare triple {7737#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {7738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:17,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {7738#(<= main_~i~0 2)} assume true; {7738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:17,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {7738#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:17,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {7738#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7738#(<= main_~i~0 2)} is VALID [2018-11-14 16:54:17,475 INFO L273 TraceCheckUtils]: 15: Hoare triple {7738#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {7739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:17,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {7739#(<= main_~i~0 3)} assume true; {7739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:17,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {7739#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:17,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {7739#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7739#(<= main_~i~0 3)} is VALID [2018-11-14 16:54:17,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {7739#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {7740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:17,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {7740#(<= main_~i~0 4)} assume true; {7740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:17,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {7740#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:17,479 INFO L273 TraceCheckUtils]: 22: Hoare triple {7740#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7740#(<= main_~i~0 4)} is VALID [2018-11-14 16:54:17,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {7740#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {7741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:17,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {7741#(<= main_~i~0 5)} assume true; {7741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:17,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {7741#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:17,481 INFO L273 TraceCheckUtils]: 26: Hoare triple {7741#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7741#(<= main_~i~0 5)} is VALID [2018-11-14 16:54:17,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {7741#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {7742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:17,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {7742#(<= main_~i~0 6)} assume true; {7742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:17,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {7742#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:17,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {7742#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7742#(<= main_~i~0 6)} is VALID [2018-11-14 16:54:17,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {7742#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {7743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:17,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {7743#(<= main_~i~0 7)} assume true; {7743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:17,485 INFO L273 TraceCheckUtils]: 33: Hoare triple {7743#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:17,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {7743#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7743#(<= main_~i~0 7)} is VALID [2018-11-14 16:54:17,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {7743#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {7744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:17,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {7744#(<= main_~i~0 8)} assume true; {7744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:17,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {7744#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:17,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {7744#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7744#(<= main_~i~0 8)} is VALID [2018-11-14 16:54:17,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {7744#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {7745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:17,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {7745#(<= main_~i~0 9)} assume true; {7745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:17,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {7745#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:17,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {7745#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7745#(<= main_~i~0 9)} is VALID [2018-11-14 16:54:17,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {7745#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {7746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:17,491 INFO L273 TraceCheckUtils]: 44: Hoare triple {7746#(<= main_~i~0 10)} assume true; {7746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:17,491 INFO L273 TraceCheckUtils]: 45: Hoare triple {7746#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:17,492 INFO L273 TraceCheckUtils]: 46: Hoare triple {7746#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7746#(<= main_~i~0 10)} is VALID [2018-11-14 16:54:17,493 INFO L273 TraceCheckUtils]: 47: Hoare triple {7746#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {7747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:17,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {7747#(<= main_~i~0 11)} assume true; {7747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:17,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {7747#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:17,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {7747#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7747#(<= main_~i~0 11)} is VALID [2018-11-14 16:54:17,495 INFO L273 TraceCheckUtils]: 51: Hoare triple {7747#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {7748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:17,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {7748#(<= main_~i~0 12)} assume true; {7748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:17,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {7748#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:17,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {7748#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7748#(<= main_~i~0 12)} is VALID [2018-11-14 16:54:17,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {7748#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {7749#(<= main_~i~0 13)} is VALID [2018-11-14 16:54:17,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {7749#(<= main_~i~0 13)} assume true; {7749#(<= main_~i~0 13)} is VALID [2018-11-14 16:54:17,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {7749#(<= main_~i~0 13)} assume !(~i~0 < 100000); {7736#false} is VALID [2018-11-14 16:54:17,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {7736#false} assume true; {7736#false} is VALID [2018-11-14 16:54:17,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {7736#false} assume !(~swapped~0 != 0); {7736#false} is VALID [2018-11-14 16:54:17,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {7736#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7736#false} is VALID [2018-11-14 16:54:17,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {7736#false} assume true; {7736#false} is VALID [2018-11-14 16:54:17,499 INFO L273 TraceCheckUtils]: 62: Hoare triple {7736#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {7736#false} is VALID [2018-11-14 16:54:17,499 INFO L273 TraceCheckUtils]: 63: Hoare triple {7736#false} assume true; {7736#false} is VALID [2018-11-14 16:54:17,500 INFO L273 TraceCheckUtils]: 64: Hoare triple {7736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7736#false} is VALID [2018-11-14 16:54:17,500 INFO L256 TraceCheckUtils]: 65: Hoare triple {7736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7735#true} is VALID [2018-11-14 16:54:17,500 INFO L273 TraceCheckUtils]: 66: Hoare triple {7735#true} ~cond := #in~cond; {7735#true} is VALID [2018-11-14 16:54:17,500 INFO L273 TraceCheckUtils]: 67: Hoare triple {7735#true} assume !(~cond == 0); {7735#true} is VALID [2018-11-14 16:54:17,500 INFO L273 TraceCheckUtils]: 68: Hoare triple {7735#true} assume true; {7735#true} is VALID [2018-11-14 16:54:17,500 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7735#true} {7736#false} #87#return; {7736#false} is VALID [2018-11-14 16:54:17,501 INFO L273 TraceCheckUtils]: 70: Hoare triple {7736#false} havoc #t~mem7;havoc #t~mem6; {7736#false} is VALID [2018-11-14 16:54:17,501 INFO L273 TraceCheckUtils]: 71: Hoare triple {7736#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {7736#false} is VALID [2018-11-14 16:54:17,501 INFO L273 TraceCheckUtils]: 72: Hoare triple {7736#false} assume true; {7736#false} is VALID [2018-11-14 16:54:17,501 INFO L273 TraceCheckUtils]: 73: Hoare triple {7736#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7736#false} is VALID [2018-11-14 16:54:17,501 INFO L256 TraceCheckUtils]: 74: Hoare triple {7736#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7736#false} is VALID [2018-11-14 16:54:17,502 INFO L273 TraceCheckUtils]: 75: Hoare triple {7736#false} ~cond := #in~cond; {7736#false} is VALID [2018-11-14 16:54:17,502 INFO L273 TraceCheckUtils]: 76: Hoare triple {7736#false} assume ~cond == 0; {7736#false} is VALID [2018-11-14 16:54:17,502 INFO L273 TraceCheckUtils]: 77: Hoare triple {7736#false} assume !false; {7736#false} is VALID [2018-11-14 16:54:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 288 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:54:17,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:54:17,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:54:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:54:17,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 16:54:17,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:54:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:54:17,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:54:18,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-14 16:54:18,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-14 16:54:18,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:54:18,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:54:18,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:54:18,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2018-11-14 16:54:18,371 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:54:18,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {7735#true} call ULTIMATE.init(); {7735#true} is VALID [2018-11-14 16:54:18,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {7735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7735#true} is VALID [2018-11-14 16:54:18,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {7735#true} assume true; {7735#true} is VALID [2018-11-14 16:54:18,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7735#true} {7735#true} #83#return; {7735#true} is VALID [2018-11-14 16:54:18,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {7735#true} call #t~ret8 := main(); {7735#true} is VALID [2018-11-14 16:54:18,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {7735#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {7768#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {7768#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume true; {7768#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {7768#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {7775#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7788#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,452 INFO L273 TraceCheckUtils]: 12: Hoare triple {7788#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume true; {7788#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {7788#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7795#(and (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {7795#(and (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) |main_#t~mem0|) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,484 INFO L273 TraceCheckUtils]: 30: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,485 INFO L273 TraceCheckUtils]: 31: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,489 INFO L273 TraceCheckUtils]: 36: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,490 INFO L273 TraceCheckUtils]: 37: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,491 INFO L273 TraceCheckUtils]: 38: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,497 INFO L273 TraceCheckUtils]: 45: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,498 INFO L273 TraceCheckUtils]: 46: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,499 INFO L273 TraceCheckUtils]: 47: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,500 INFO L273 TraceCheckUtils]: 48: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,501 INFO L273 TraceCheckUtils]: 49: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,502 INFO L273 TraceCheckUtils]: 50: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,507 INFO L273 TraceCheckUtils]: 56: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume true; {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~swapped~0 != 0); {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {7799#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc ~x~0;havoc ~y~0;~x~0 := 0; {7938#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,512 INFO L273 TraceCheckUtils]: 61: Hoare triple {7938#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume true; {7938#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {7938#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {7945#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,514 INFO L273 TraceCheckUtils]: 63: Hoare triple {7945#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume true; {7945#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {7945#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7952#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,518 INFO L256 TraceCheckUtils]: 65: Hoare triple {7952#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8)))} is VALID [2018-11-14 16:54:18,521 INFO L273 TraceCheckUtils]: 66: Hoare triple {7956#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8)))} ~cond := #in~cond; {7960#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:54:18,522 INFO L273 TraceCheckUtils]: 67: Hoare triple {7960#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(~cond == 0); {7964#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))))} is VALID [2018-11-14 16:54:18,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {7964#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))))} assume true; {7964#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))))} is VALID [2018-11-14 16:54:18,525 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7964#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 8))))} {7952#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #87#return; {7971#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {7971#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {7971#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {7971#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_~#a~0.offset| 0))} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {7978#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {7978#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume true; {7978#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:54:18,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {7978#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {7985#(<= |main_#t~mem6| |main_#t~mem7|)} is VALID [2018-11-14 16:54:18,532 INFO L256 TraceCheckUtils]: 74: Hoare triple {7985#(<= |main_#t~mem6| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {7989#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:54:18,532 INFO L273 TraceCheckUtils]: 75: Hoare triple {7989#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {7993#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:54:18,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {7993#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {7736#false} is VALID [2018-11-14 16:54:18,533 INFO L273 TraceCheckUtils]: 77: Hoare triple {7736#false} assume !false; {7736#false} is VALID [2018-11-14 16:54:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 16:54:18,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:54:18,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2018-11-14 16:54:18,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 16:54:18,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:54:18,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 16:54:18,911 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-14 16:54:18,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 16:54:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 16:54:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-11-14 16:54:18,913 INFO L87 Difference]: Start difference. First operand 131 states and 158 transitions. Second operand 31 states. [2018-11-14 16:54:31,782 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-14 16:55:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:05,195 INFO L93 Difference]: Finished difference Result 343 states and 423 transitions. [2018-11-14 16:55:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-11-14 16:55:05,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-11-14 16:55:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:55:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 293 transitions. [2018-11-14 16:55:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:55:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 293 transitions. [2018-11-14 16:55:05,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 293 transitions. [2018-11-14 16:55:05,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:05,617 INFO L225 Difference]: With dead ends: 343 [2018-11-14 16:55:05,617 INFO L226 Difference]: Without dead ends: 218 [2018-11-14 16:55:05,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1118, Invalid=5202, Unknown=0, NotChecked=0, Total=6320 [2018-11-14 16:55:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-14 16:55:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-11-14 16:55:05,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:05,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 148 states. [2018-11-14 16:55:05,760 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 148 states. [2018-11-14 16:55:05,760 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 148 states. [2018-11-14 16:55:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:05,767 INFO L93 Difference]: Finished difference Result 218 states and 266 transitions. [2018-11-14 16:55:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2018-11-14 16:55:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:05,769 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 218 states. [2018-11-14 16:55:05,769 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 218 states. [2018-11-14 16:55:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:05,775 INFO L93 Difference]: Finished difference Result 218 states and 266 transitions. [2018-11-14 16:55:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2018-11-14 16:55:05,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:05,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:05,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:05,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-14 16:55:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2018-11-14 16:55:05,780 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 78 [2018-11-14 16:55:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2018-11-14 16:55:05,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 16:55:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2018-11-14 16:55:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 16:55:05,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:05,782 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:05,782 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:05,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash -803485796, now seen corresponding path program 4 times [2018-11-14 16:55:05,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:05,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:05,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:05,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:05,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:06,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {9165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #83#return; {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret8 := main(); {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {9165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9165#true} is VALID [2018-11-14 16:55:06,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {9165#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {9167#(= main_~i~0 1)} is VALID [2018-11-14 16:55:06,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {9167#(= main_~i~0 1)} assume true; {9167#(= main_~i~0 1)} is VALID [2018-11-14 16:55:06,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {9167#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9167#(= main_~i~0 1)} is VALID [2018-11-14 16:55:06,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {9167#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9167#(= main_~i~0 1)} is VALID [2018-11-14 16:55:06,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {9167#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {9168#(<= main_~i~0 2)} assume true; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {9168#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {9168#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {9168#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {9169#(<= main_~i~0 3)} assume true; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {9169#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {9169#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {9169#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {9170#(<= main_~i~0 4)} assume true; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {9170#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,393 INFO L273 TraceCheckUtils]: 22: Hoare triple {9170#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {9170#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {9171#(<= main_~i~0 5)} assume true; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,395 INFO L273 TraceCheckUtils]: 25: Hoare triple {9171#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {9171#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {9171#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {9172#(<= main_~i~0 6)} assume true; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {9172#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {9172#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {9172#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {9173#(<= main_~i~0 7)} assume true; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {9173#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {9173#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {9173#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {9174#(<= main_~i~0 8)} assume true; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {9174#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {9174#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {9174#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {9175#(<= main_~i~0 9)} assume true; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {9175#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {9175#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {9175#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {9176#(<= main_~i~0 10)} assume true; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {9176#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {9176#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {9176#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {9177#(<= main_~i~0 11)} assume true; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {9177#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {9177#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {9177#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {9178#(<= main_~i~0 12)} assume true; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {9178#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {9178#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {9178#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {9179#(<= main_~i~0 13)} assume true; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {9179#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,415 INFO L273 TraceCheckUtils]: 58: Hoare triple {9179#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,416 INFO L273 TraceCheckUtils]: 59: Hoare triple {9179#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9180#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:06,416 INFO L273 TraceCheckUtils]: 60: Hoare triple {9180#(<= main_~i~0 14)} assume true; {9180#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:06,417 INFO L273 TraceCheckUtils]: 61: Hoare triple {9180#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9166#false} is VALID [2018-11-14 16:55:06,417 INFO L273 TraceCheckUtils]: 62: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {9166#false} assume !(~swapped~0 != 0); {9166#false} is VALID [2018-11-14 16:55:06,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {9166#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9166#false} is VALID [2018-11-14 16:55:06,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {9166#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {9166#false} is VALID [2018-11-14 16:55:06,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,419 INFO L256 TraceCheckUtils]: 69: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9165#true} is VALID [2018-11-14 16:55:06,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {9165#true} ~cond := #in~cond; {9165#true} is VALID [2018-11-14 16:55:06,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {9165#true} assume !(~cond == 0); {9165#true} is VALID [2018-11-14 16:55:06,420 INFO L273 TraceCheckUtils]: 72: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,420 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {9165#true} {9166#false} #87#return; {9166#false} is VALID [2018-11-14 16:55:06,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {9166#false} havoc #t~mem7;havoc #t~mem6; {9166#false} is VALID [2018-11-14 16:55:06,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {9166#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {9166#false} is VALID [2018-11-14 16:55:06,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,421 INFO L273 TraceCheckUtils]: 77: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,421 INFO L256 TraceCheckUtils]: 78: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9165#true} is VALID [2018-11-14 16:55:06,421 INFO L273 TraceCheckUtils]: 79: Hoare triple {9165#true} ~cond := #in~cond; {9165#true} is VALID [2018-11-14 16:55:06,421 INFO L273 TraceCheckUtils]: 80: Hoare triple {9165#true} assume !(~cond == 0); {9165#true} is VALID [2018-11-14 16:55:06,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,421 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9165#true} {9166#false} #87#return; {9166#false} is VALID [2018-11-14 16:55:06,421 INFO L273 TraceCheckUtils]: 83: Hoare triple {9166#false} havoc #t~mem7;havoc #t~mem6; {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 84: Hoare triple {9166#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 85: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 86: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L256 TraceCheckUtils]: 87: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 88: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {9166#false} assume ~cond == 0; {9166#false} is VALID [2018-11-14 16:55:06,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2018-11-14 16:55:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 6 proven. 338 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:55:06,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:06,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:06,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:06,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:06,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:06,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:06,688 INFO L256 TraceCheckUtils]: 0: Hoare triple {9165#true} call ULTIMATE.init(); {9165#true} is VALID [2018-11-14 16:55:06,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {9165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9165#true} is VALID [2018-11-14 16:55:06,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9165#true} {9165#true} #83#return; {9165#true} is VALID [2018-11-14 16:55:06,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {9165#true} call #t~ret8 := main(); {9165#true} is VALID [2018-11-14 16:55:06,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {9165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {9165#true} is VALID [2018-11-14 16:55:06,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {9165#true} assume true; {9165#true} is VALID [2018-11-14 16:55:06,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {9165#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {9205#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:06,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {9205#(<= main_~i~0 1)} assume true; {9205#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:06,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {9205#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9205#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:06,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {9205#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9205#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:06,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {9205#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {9168#(<= main_~i~0 2)} assume true; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {9168#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {9168#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9168#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:06,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {9168#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {9169#(<= main_~i~0 3)} assume true; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {9169#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {9169#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9169#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:06,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {9169#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {9170#(<= main_~i~0 4)} assume true; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {9170#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {9170#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9170#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:06,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {9170#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {9171#(<= main_~i~0 5)} assume true; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {9171#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {9171#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9171#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:06,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {9171#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {9172#(<= main_~i~0 6)} assume true; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {9172#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {9172#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9172#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:06,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {9172#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {9173#(<= main_~i~0 7)} assume true; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {9173#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {9173#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9173#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:06,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {9173#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,723 INFO L273 TraceCheckUtils]: 36: Hoare triple {9174#(<= main_~i~0 8)} assume true; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,723 INFO L273 TraceCheckUtils]: 37: Hoare triple {9174#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,724 INFO L273 TraceCheckUtils]: 38: Hoare triple {9174#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9174#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:06,724 INFO L273 TraceCheckUtils]: 39: Hoare triple {9174#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,725 INFO L273 TraceCheckUtils]: 40: Hoare triple {9175#(<= main_~i~0 9)} assume true; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,725 INFO L273 TraceCheckUtils]: 41: Hoare triple {9175#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {9175#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9175#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:06,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {9175#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {9176#(<= main_~i~0 10)} assume true; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {9176#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {9176#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9176#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:06,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {9176#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {9177#(<= main_~i~0 11)} assume true; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {9177#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {9177#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9177#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:06,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {9177#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {9178#(<= main_~i~0 12)} assume true; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,733 INFO L273 TraceCheckUtils]: 53: Hoare triple {9178#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,733 INFO L273 TraceCheckUtils]: 54: Hoare triple {9178#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9178#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:06,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {9178#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {9179#(<= main_~i~0 13)} assume true; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,735 INFO L273 TraceCheckUtils]: 57: Hoare triple {9179#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,735 INFO L273 TraceCheckUtils]: 58: Hoare triple {9179#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {9179#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:06,736 INFO L273 TraceCheckUtils]: 59: Hoare triple {9179#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {9180#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:06,737 INFO L273 TraceCheckUtils]: 60: Hoare triple {9180#(<= main_~i~0 14)} assume true; {9180#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:06,737 INFO L273 TraceCheckUtils]: 61: Hoare triple {9180#(<= main_~i~0 14)} assume !(~i~0 < 100000); {9166#false} is VALID [2018-11-14 16:55:06,738 INFO L273 TraceCheckUtils]: 62: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,738 INFO L273 TraceCheckUtils]: 63: Hoare triple {9166#false} assume !(~swapped~0 != 0); {9166#false} is VALID [2018-11-14 16:55:06,738 INFO L273 TraceCheckUtils]: 64: Hoare triple {9166#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {9166#false} is VALID [2018-11-14 16:55:06,738 INFO L273 TraceCheckUtils]: 65: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,739 INFO L273 TraceCheckUtils]: 66: Hoare triple {9166#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {9166#false} is VALID [2018-11-14 16:55:06,739 INFO L273 TraceCheckUtils]: 67: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,739 INFO L273 TraceCheckUtils]: 68: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,739 INFO L256 TraceCheckUtils]: 69: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9166#false} is VALID [2018-11-14 16:55:06,739 INFO L273 TraceCheckUtils]: 70: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2018-11-14 16:55:06,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {9166#false} assume !(~cond == 0); {9166#false} is VALID [2018-11-14 16:55:06,740 INFO L273 TraceCheckUtils]: 72: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,740 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {9166#false} {9166#false} #87#return; {9166#false} is VALID [2018-11-14 16:55:06,740 INFO L273 TraceCheckUtils]: 74: Hoare triple {9166#false} havoc #t~mem7;havoc #t~mem6; {9166#false} is VALID [2018-11-14 16:55:06,740 INFO L273 TraceCheckUtils]: 75: Hoare triple {9166#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 76: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 77: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L256 TraceCheckUtils]: 78: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {9166#false} assume !(~cond == 0); {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 81: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {9166#false} {9166#false} #87#return; {9166#false} is VALID [2018-11-14 16:55:06,741 INFO L273 TraceCheckUtils]: 83: Hoare triple {9166#false} havoc #t~mem7;havoc #t~mem6; {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {9166#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 85: Hoare triple {9166#false} assume true; {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 86: Hoare triple {9166#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L256 TraceCheckUtils]: 87: Hoare triple {9166#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 88: Hoare triple {9166#false} ~cond := #in~cond; {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 89: Hoare triple {9166#false} assume ~cond == 0; {9166#false} is VALID [2018-11-14 16:55:06,742 INFO L273 TraceCheckUtils]: 90: Hoare triple {9166#false} assume !false; {9166#false} is VALID [2018-11-14 16:55:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 2 proven. 338 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-14 16:55:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 16:55:06,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2018-11-14 16:55:06,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:06,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:55:06,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:06,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:55:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:55:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:55:06,851 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 17 states. [2018-11-14 16:55:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:07,661 INFO L93 Difference]: Finished difference Result 302 states and 366 transitions. [2018-11-14 16:55:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:55:07,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2018-11-14 16:55:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:55:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-14 16:55:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:55:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-14 16:55:07,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2018-11-14 16:55:07,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:07,907 INFO L225 Difference]: With dead ends: 302 [2018-11-14 16:55:07,907 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 16:55:07,908 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:55:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 16:55:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-11-14 16:55:08,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:08,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 156 states. [2018-11-14 16:55:08,401 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 156 states. [2018-11-14 16:55:08,401 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 156 states. [2018-11-14 16:55:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:08,406 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2018-11-14 16:55:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2018-11-14 16:55:08,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:08,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:08,407 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 160 states. [2018-11-14 16:55:08,407 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 160 states. [2018-11-14 16:55:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:08,410 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2018-11-14 16:55:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2018-11-14 16:55:08,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:08,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:08,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:08,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-14 16:55:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2018-11-14 16:55:08,415 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 91 [2018-11-14 16:55:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:08,415 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2018-11-14 16:55:08,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:55:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2018-11-14 16:55:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-14 16:55:08,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:08,417 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:08,417 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:08,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1105260020, now seen corresponding path program 5 times [2018-11-14 16:55:08,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:08,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:08,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:08,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {10364#true} call ULTIMATE.init(); {10364#true} is VALID [2018-11-14 16:55:08,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {10364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10364#true} is VALID [2018-11-14 16:55:08,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:08,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10364#true} {10364#true} #83#return; {10364#true} is VALID [2018-11-14 16:55:08,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {10364#true} call #t~ret8 := main(); {10364#true} is VALID [2018-11-14 16:55:08,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {10364#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10364#true} is VALID [2018-11-14 16:55:08,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:08,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {10366#(= main_~i~0 1)} is VALID [2018-11-14 16:55:08,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {10366#(= main_~i~0 1)} assume true; {10366#(= main_~i~0 1)} is VALID [2018-11-14 16:55:08,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {10366#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10366#(= main_~i~0 1)} is VALID [2018-11-14 16:55:08,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {10366#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10366#(= main_~i~0 1)} is VALID [2018-11-14 16:55:08,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {10366#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:08,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {10367#(<= main_~i~0 2)} assume true; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:08,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {10367#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:08,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {10367#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:08,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {10367#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:08,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {10368#(<= main_~i~0 3)} assume true; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:08,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {10368#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:08,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {10368#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:08,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {10368#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:08,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {10369#(<= main_~i~0 4)} assume true; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:08,720 INFO L273 TraceCheckUtils]: 21: Hoare triple {10369#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:08,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {10369#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:08,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {10369#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:08,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {10370#(<= main_~i~0 5)} assume true; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:08,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {10370#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:08,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {10370#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:08,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {10370#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:08,724 INFO L273 TraceCheckUtils]: 28: Hoare triple {10371#(<= main_~i~0 6)} assume true; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:08,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {10371#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:08,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {10371#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:08,726 INFO L273 TraceCheckUtils]: 31: Hoare triple {10371#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:08,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {10372#(<= main_~i~0 7)} assume true; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:08,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {10372#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:08,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {10372#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:08,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {10372#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:08,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {10373#(<= main_~i~0 8)} assume true; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:08,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {10373#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:08,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {10373#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:08,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {10373#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:08,731 INFO L273 TraceCheckUtils]: 40: Hoare triple {10374#(<= main_~i~0 9)} assume true; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:08,732 INFO L273 TraceCheckUtils]: 41: Hoare triple {10374#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:08,732 INFO L273 TraceCheckUtils]: 42: Hoare triple {10374#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:08,733 INFO L273 TraceCheckUtils]: 43: Hoare triple {10374#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:08,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {10375#(<= main_~i~0 10)} assume true; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:08,734 INFO L273 TraceCheckUtils]: 45: Hoare triple {10375#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:08,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {10375#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:08,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {10375#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:08,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {10376#(<= main_~i~0 11)} assume true; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:08,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {10376#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:08,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {10376#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:08,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {10376#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:08,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {10377#(<= main_~i~0 12)} assume true; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:08,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {10377#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:08,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {10377#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:08,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {10377#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:08,740 INFO L273 TraceCheckUtils]: 56: Hoare triple {10378#(<= main_~i~0 13)} assume true; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:08,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {10378#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:08,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {10378#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:08,742 INFO L273 TraceCheckUtils]: 59: Hoare triple {10378#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:08,743 INFO L273 TraceCheckUtils]: 60: Hoare triple {10379#(<= main_~i~0 14)} assume true; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:08,743 INFO L273 TraceCheckUtils]: 61: Hoare triple {10379#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:08,744 INFO L273 TraceCheckUtils]: 62: Hoare triple {10379#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:08,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {10379#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10380#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:08,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {10380#(<= main_~i~0 15)} assume true; {10380#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:08,746 INFO L273 TraceCheckUtils]: 65: Hoare triple {10380#(<= main_~i~0 15)} assume !(~i~0 < 100000); {10365#false} is VALID [2018-11-14 16:55:08,746 INFO L273 TraceCheckUtils]: 66: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:08,746 INFO L273 TraceCheckUtils]: 67: Hoare triple {10365#false} assume !(~swapped~0 != 0); {10365#false} is VALID [2018-11-14 16:55:08,746 INFO L273 TraceCheckUtils]: 68: Hoare triple {10365#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10365#false} is VALID [2018-11-14 16:55:08,747 INFO L273 TraceCheckUtils]: 69: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:08,747 INFO L273 TraceCheckUtils]: 70: Hoare triple {10365#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {10365#false} is VALID [2018-11-14 16:55:08,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:08,747 INFO L273 TraceCheckUtils]: 72: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:08,747 INFO L256 TraceCheckUtils]: 73: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10364#true} is VALID [2018-11-14 16:55:08,748 INFO L273 TraceCheckUtils]: 74: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2018-11-14 16:55:08,748 INFO L273 TraceCheckUtils]: 75: Hoare triple {10364#true} assume !(~cond == 0); {10364#true} is VALID [2018-11-14 16:55:08,748 INFO L273 TraceCheckUtils]: 76: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:08,748 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10364#true} {10365#false} #87#return; {10365#false} is VALID [2018-11-14 16:55:08,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {10365#false} havoc #t~mem7;havoc #t~mem6; {10365#false} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 79: Hoare triple {10365#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {10365#false} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 80: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 81: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:08,749 INFO L256 TraceCheckUtils]: 82: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10364#true} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 83: Hoare triple {10364#true} ~cond := #in~cond; {10364#true} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 84: Hoare triple {10364#true} assume !(~cond == 0); {10364#true} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 85: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:08,749 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {10364#true} {10365#false} #87#return; {10365#false} is VALID [2018-11-14 16:55:08,749 INFO L273 TraceCheckUtils]: 87: Hoare triple {10365#false} havoc #t~mem7;havoc #t~mem6; {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 88: Hoare triple {10365#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 89: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L256 TraceCheckUtils]: 91: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {10365#false} ~cond := #in~cond; {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 93: Hoare triple {10365#false} assume ~cond == 0; {10365#false} is VALID [2018-11-14 16:55:08,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {10365#false} assume !false; {10365#false} is VALID [2018-11-14 16:55:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 6 proven. 392 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:55:08,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:08,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:08,765 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:08,806 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-14 16:55:08,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:08,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:09,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {10364#true} call ULTIMATE.init(); {10364#true} is VALID [2018-11-14 16:55:09,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {10364#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10364#true} is VALID [2018-11-14 16:55:09,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:09,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10364#true} {10364#true} #83#return; {10364#true} is VALID [2018-11-14 16:55:09,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {10364#true} call #t~ret8 := main(); {10364#true} is VALID [2018-11-14 16:55:09,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {10364#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {10364#true} is VALID [2018-11-14 16:55:09,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {10364#true} assume true; {10364#true} is VALID [2018-11-14 16:55:09,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {10405#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:09,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {10405#(<= main_~i~0 1)} assume true; {10405#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:09,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {10405#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10405#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:09,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {10405#(<= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10405#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:09,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {10405#(<= main_~i~0 1)} ~i~0 := ~i~0 + 1; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:09,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {10367#(<= main_~i~0 2)} assume true; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:09,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {10367#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:09,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {10367#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10367#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:09,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {10367#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:09,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {10368#(<= main_~i~0 3)} assume true; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:09,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {10368#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:09,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {10368#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10368#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:09,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {10368#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:09,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {10369#(<= main_~i~0 4)} assume true; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:09,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {10369#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:09,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {10369#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10369#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:09,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {10369#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:09,121 INFO L273 TraceCheckUtils]: 24: Hoare triple {10370#(<= main_~i~0 5)} assume true; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:09,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {10370#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:09,122 INFO L273 TraceCheckUtils]: 26: Hoare triple {10370#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10370#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:09,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {10370#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:09,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {10371#(<= main_~i~0 6)} assume true; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:09,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {10371#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:09,124 INFO L273 TraceCheckUtils]: 30: Hoare triple {10371#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10371#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:09,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {10371#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:09,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {10372#(<= main_~i~0 7)} assume true; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:09,126 INFO L273 TraceCheckUtils]: 33: Hoare triple {10372#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:09,126 INFO L273 TraceCheckUtils]: 34: Hoare triple {10372#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10372#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:09,127 INFO L273 TraceCheckUtils]: 35: Hoare triple {10372#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:09,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {10373#(<= main_~i~0 8)} assume true; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:09,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {10373#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:09,129 INFO L273 TraceCheckUtils]: 38: Hoare triple {10373#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10373#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:09,129 INFO L273 TraceCheckUtils]: 39: Hoare triple {10373#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:09,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {10374#(<= main_~i~0 9)} assume true; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:09,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {10374#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:09,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {10374#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10374#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:09,132 INFO L273 TraceCheckUtils]: 43: Hoare triple {10374#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:09,132 INFO L273 TraceCheckUtils]: 44: Hoare triple {10375#(<= main_~i~0 10)} assume true; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:09,133 INFO L273 TraceCheckUtils]: 45: Hoare triple {10375#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:09,133 INFO L273 TraceCheckUtils]: 46: Hoare triple {10375#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10375#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:09,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {10375#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:09,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {10376#(<= main_~i~0 11)} assume true; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:09,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {10376#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:09,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {10376#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10376#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:09,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {10376#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:09,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {10377#(<= main_~i~0 12)} assume true; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:09,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {10377#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:09,138 INFO L273 TraceCheckUtils]: 54: Hoare triple {10377#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10377#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:09,139 INFO L273 TraceCheckUtils]: 55: Hoare triple {10377#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:09,139 INFO L273 TraceCheckUtils]: 56: Hoare triple {10378#(<= main_~i~0 13)} assume true; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:09,140 INFO L273 TraceCheckUtils]: 57: Hoare triple {10378#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:09,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {10378#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10378#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:09,141 INFO L273 TraceCheckUtils]: 59: Hoare triple {10378#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:09,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {10379#(<= main_~i~0 14)} assume true; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:09,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {10379#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:09,143 INFO L273 TraceCheckUtils]: 62: Hoare triple {10379#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {10379#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:09,143 INFO L273 TraceCheckUtils]: 63: Hoare triple {10379#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {10380#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:09,144 INFO L273 TraceCheckUtils]: 64: Hoare triple {10380#(<= main_~i~0 15)} assume true; {10380#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:09,145 INFO L273 TraceCheckUtils]: 65: Hoare triple {10380#(<= main_~i~0 15)} assume !(~i~0 < 100000); {10365#false} is VALID [2018-11-14 16:55:09,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {10365#false} assume !(~swapped~0 != 0); {10365#false} is VALID [2018-11-14 16:55:09,145 INFO L273 TraceCheckUtils]: 68: Hoare triple {10365#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {10365#false} is VALID [2018-11-14 16:55:09,145 INFO L273 TraceCheckUtils]: 69: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,146 INFO L273 TraceCheckUtils]: 70: Hoare triple {10365#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {10365#false} is VALID [2018-11-14 16:55:09,146 INFO L273 TraceCheckUtils]: 71: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,146 INFO L273 TraceCheckUtils]: 72: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:09,146 INFO L256 TraceCheckUtils]: 73: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10365#false} is VALID [2018-11-14 16:55:09,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {10365#false} ~cond := #in~cond; {10365#false} is VALID [2018-11-14 16:55:09,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {10365#false} assume !(~cond == 0); {10365#false} is VALID [2018-11-14 16:55:09,147 INFO L273 TraceCheckUtils]: 76: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,147 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10365#false} {10365#false} #87#return; {10365#false} is VALID [2018-11-14 16:55:09,147 INFO L273 TraceCheckUtils]: 78: Hoare triple {10365#false} havoc #t~mem7;havoc #t~mem6; {10365#false} is VALID [2018-11-14 16:55:09,147 INFO L273 TraceCheckUtils]: 79: Hoare triple {10365#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {10365#false} is VALID [2018-11-14 16:55:09,148 INFO L273 TraceCheckUtils]: 80: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,148 INFO L273 TraceCheckUtils]: 81: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:09,148 INFO L256 TraceCheckUtils]: 82: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10365#false} is VALID [2018-11-14 16:55:09,148 INFO L273 TraceCheckUtils]: 83: Hoare triple {10365#false} ~cond := #in~cond; {10365#false} is VALID [2018-11-14 16:55:09,148 INFO L273 TraceCheckUtils]: 84: Hoare triple {10365#false} assume !(~cond == 0); {10365#false} is VALID [2018-11-14 16:55:09,149 INFO L273 TraceCheckUtils]: 85: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,149 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {10365#false} {10365#false} #87#return; {10365#false} is VALID [2018-11-14 16:55:09,149 INFO L273 TraceCheckUtils]: 87: Hoare triple {10365#false} havoc #t~mem7;havoc #t~mem6; {10365#false} is VALID [2018-11-14 16:55:09,149 INFO L273 TraceCheckUtils]: 88: Hoare triple {10365#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {10365#false} is VALID [2018-11-14 16:55:09,149 INFO L273 TraceCheckUtils]: 89: Hoare triple {10365#false} assume true; {10365#false} is VALID [2018-11-14 16:55:09,150 INFO L273 TraceCheckUtils]: 90: Hoare triple {10365#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {10365#false} is VALID [2018-11-14 16:55:09,150 INFO L256 TraceCheckUtils]: 91: Hoare triple {10365#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {10365#false} is VALID [2018-11-14 16:55:09,150 INFO L273 TraceCheckUtils]: 92: Hoare triple {10365#false} ~cond := #in~cond; {10365#false} is VALID [2018-11-14 16:55:09,150 INFO L273 TraceCheckUtils]: 93: Hoare triple {10365#false} assume ~cond == 0; {10365#false} is VALID [2018-11-14 16:55:09,150 INFO L273 TraceCheckUtils]: 94: Hoare triple {10365#false} assume !false; {10365#false} is VALID [2018-11-14 16:55:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 2 proven. 392 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-14 16:55:09,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:09,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 16:55:09,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-14 16:55:09,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:09,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:55:09,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:09,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:55:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:55:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:55:09,263 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand 18 states. [2018-11-14 16:55:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:10,388 INFO L93 Difference]: Finished difference Result 318 states and 386 transitions. [2018-11-14 16:55:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:55:10,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-11-14 16:55:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:55:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2018-11-14 16:55:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:55:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2018-11-14 16:55:10,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 132 transitions. [2018-11-14 16:55:10,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:10,583 INFO L225 Difference]: With dead ends: 318 [2018-11-14 16:55:10,584 INFO L226 Difference]: Without dead ends: 168 [2018-11-14 16:55:10,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:55:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-14 16:55:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-11-14 16:55:10,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:10,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand 164 states. [2018-11-14 16:55:10,859 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 164 states. [2018-11-14 16:55:10,860 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 164 states. [2018-11-14 16:55:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:10,863 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2018-11-14 16:55:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2018-11-14 16:55:10,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:10,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:10,864 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 168 states. [2018-11-14 16:55:10,864 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 168 states. [2018-11-14 16:55:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:10,868 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2018-11-14 16:55:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2018-11-14 16:55:10,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:10,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:10,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:10,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 16:55:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 197 transitions. [2018-11-14 16:55:10,872 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 197 transitions. Word has length 95 [2018-11-14 16:55:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:10,873 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 197 transitions. [2018-11-14 16:55:10,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:55:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 197 transitions. [2018-11-14 16:55:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-14 16:55:10,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:10,874 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:10,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:10,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:10,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1702570060, now seen corresponding path program 6 times [2018-11-14 16:55:10,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:10,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:10,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:11,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {11622#true} call ULTIMATE.init(); {11622#true} is VALID [2018-11-14 16:55:11,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {11622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11622#true} is VALID [2018-11-14 16:55:11,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {11622#true} assume true; {11622#true} is VALID [2018-11-14 16:55:11,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11622#true} {11622#true} #83#return; {11622#true} is VALID [2018-11-14 16:55:11,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {11622#true} call #t~ret8 := main(); {11622#true} is VALID [2018-11-14 16:55:11,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {11622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11622#true} is VALID [2018-11-14 16:55:11,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {11622#true} assume true; {11622#true} is VALID [2018-11-14 16:55:11,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {11622#true} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {11624#(= main_~i~0 1)} is VALID [2018-11-14 16:55:11,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {11624#(= main_~i~0 1)} assume true; {11624#(= main_~i~0 1)} is VALID [2018-11-14 16:55:11,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {11624#(= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11624#(= main_~i~0 1)} is VALID [2018-11-14 16:55:11,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {11624#(= main_~i~0 1)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11624#(= main_~i~0 1)} is VALID [2018-11-14 16:55:11,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {11624#(= main_~i~0 1)} ~i~0 := ~i~0 + 1; {11625#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:11,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {11625#(<= main_~i~0 2)} assume true; {11625#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:11,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {11625#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11625#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:11,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {11625#(<= main_~i~0 2)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11625#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:11,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {11625#(<= main_~i~0 2)} ~i~0 := ~i~0 + 1; {11626#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:11,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {11626#(<= main_~i~0 3)} assume true; {11626#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:11,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {11626#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11626#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:11,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {11626#(<= main_~i~0 3)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11626#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:11,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {11626#(<= main_~i~0 3)} ~i~0 := ~i~0 + 1; {11627#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:11,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {11627#(<= main_~i~0 4)} assume true; {11627#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:11,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {11627#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11627#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:11,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {11627#(<= main_~i~0 4)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11627#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:11,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {11627#(<= main_~i~0 4)} ~i~0 := ~i~0 + 1; {11628#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:11,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {11628#(<= main_~i~0 5)} assume true; {11628#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:11,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {11628#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11628#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:11,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {11628#(<= main_~i~0 5)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11628#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:11,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {11628#(<= main_~i~0 5)} ~i~0 := ~i~0 + 1; {11629#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:11,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {11629#(<= main_~i~0 6)} assume true; {11629#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:11,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {11629#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11629#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:11,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {11629#(<= main_~i~0 6)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11629#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:11,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {11629#(<= main_~i~0 6)} ~i~0 := ~i~0 + 1; {11630#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:11,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {11630#(<= main_~i~0 7)} assume true; {11630#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:11,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {11630#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11630#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:11,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {11630#(<= main_~i~0 7)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11630#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:11,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {11630#(<= main_~i~0 7)} ~i~0 := ~i~0 + 1; {11631#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:11,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {11631#(<= main_~i~0 8)} assume true; {11631#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:11,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {11631#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11631#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:11,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {11631#(<= main_~i~0 8)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11631#(<= main_~i~0 8)} is VALID [2018-11-14 16:55:11,275 INFO L273 TraceCheckUtils]: 39: Hoare triple {11631#(<= main_~i~0 8)} ~i~0 := ~i~0 + 1; {11632#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:11,276 INFO L273 TraceCheckUtils]: 40: Hoare triple {11632#(<= main_~i~0 9)} assume true; {11632#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:11,276 INFO L273 TraceCheckUtils]: 41: Hoare triple {11632#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11632#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:11,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {11632#(<= main_~i~0 9)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11632#(<= main_~i~0 9)} is VALID [2018-11-14 16:55:11,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {11632#(<= main_~i~0 9)} ~i~0 := ~i~0 + 1; {11633#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:11,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {11633#(<= main_~i~0 10)} assume true; {11633#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:11,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {11633#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11633#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:11,279 INFO L273 TraceCheckUtils]: 46: Hoare triple {11633#(<= main_~i~0 10)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11633#(<= main_~i~0 10)} is VALID [2018-11-14 16:55:11,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {11633#(<= main_~i~0 10)} ~i~0 := ~i~0 + 1; {11634#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:11,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {11634#(<= main_~i~0 11)} assume true; {11634#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:11,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {11634#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11634#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:11,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {11634#(<= main_~i~0 11)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11634#(<= main_~i~0 11)} is VALID [2018-11-14 16:55:11,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {11634#(<= main_~i~0 11)} ~i~0 := ~i~0 + 1; {11635#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:11,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {11635#(<= main_~i~0 12)} assume true; {11635#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:11,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {11635#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11635#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:11,284 INFO L273 TraceCheckUtils]: 54: Hoare triple {11635#(<= main_~i~0 12)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11635#(<= main_~i~0 12)} is VALID [2018-11-14 16:55:11,284 INFO L273 TraceCheckUtils]: 55: Hoare triple {11635#(<= main_~i~0 12)} ~i~0 := ~i~0 + 1; {11636#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:11,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {11636#(<= main_~i~0 13)} assume true; {11636#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:11,285 INFO L273 TraceCheckUtils]: 57: Hoare triple {11636#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11636#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:11,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {11636#(<= main_~i~0 13)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11636#(<= main_~i~0 13)} is VALID [2018-11-14 16:55:11,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {11636#(<= main_~i~0 13)} ~i~0 := ~i~0 + 1; {11637#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:11,287 INFO L273 TraceCheckUtils]: 60: Hoare triple {11637#(<= main_~i~0 14)} assume true; {11637#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:11,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {11637#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11637#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:11,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {11637#(<= main_~i~0 14)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11637#(<= main_~i~0 14)} is VALID [2018-11-14 16:55:11,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {11637#(<= main_~i~0 14)} ~i~0 := ~i~0 + 1; {11638#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:11,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {11638#(<= main_~i~0 15)} assume true; {11638#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:11,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {11638#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11638#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:11,290 INFO L273 TraceCheckUtils]: 66: Hoare triple {11638#(<= main_~i~0 15)} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11638#(<= main_~i~0 15)} is VALID [2018-11-14 16:55:11,303 INFO L273 TraceCheckUtils]: 67: Hoare triple {11638#(<= main_~i~0 15)} ~i~0 := ~i~0 + 1; {11639#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:11,303 INFO L273 TraceCheckUtils]: 68: Hoare triple {11639#(<= main_~i~0 16)} assume true; {11639#(<= main_~i~0 16)} is VALID [2018-11-14 16:55:11,304 INFO L273 TraceCheckUtils]: 69: Hoare triple {11639#(<= main_~i~0 16)} assume !(~i~0 < 100000); {11623#false} is VALID [2018-11-14 16:55:11,304 INFO L273 TraceCheckUtils]: 70: Hoare triple {11623#false} assume true; {11623#false} is VALID [2018-11-14 16:55:11,304 INFO L273 TraceCheckUtils]: 71: Hoare triple {11623#false} assume !(~swapped~0 != 0); {11623#false} is VALID [2018-11-14 16:55:11,304 INFO L273 TraceCheckUtils]: 72: Hoare triple {11623#false} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11623#false} is VALID [2018-11-14 16:55:11,304 INFO L273 TraceCheckUtils]: 73: Hoare triple {11623#false} assume true; {11623#false} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 74: Hoare triple {11623#false} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {11623#false} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 75: Hoare triple {11623#false} assume true; {11623#false} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 76: Hoare triple {11623#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11623#false} is VALID [2018-11-14 16:55:11,305 INFO L256 TraceCheckUtils]: 77: Hoare triple {11623#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11622#true} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 78: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {11622#true} assume !(~cond == 0); {11622#true} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {11622#true} assume true; {11622#true} is VALID [2018-11-14 16:55:11,305 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {11622#true} {11623#false} #87#return; {11623#false} is VALID [2018-11-14 16:55:11,305 INFO L273 TraceCheckUtils]: 82: Hoare triple {11623#false} havoc #t~mem7;havoc #t~mem6; {11623#false} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 83: Hoare triple {11623#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {11623#false} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 84: Hoare triple {11623#false} assume true; {11623#false} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 85: Hoare triple {11623#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11623#false} is VALID [2018-11-14 16:55:11,306 INFO L256 TraceCheckUtils]: 86: Hoare triple {11623#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11622#true} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 87: Hoare triple {11622#true} ~cond := #in~cond; {11622#true} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 88: Hoare triple {11622#true} assume !(~cond == 0); {11622#true} is VALID [2018-11-14 16:55:11,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {11622#true} assume true; {11622#true} is VALID [2018-11-14 16:55:11,306 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {11622#true} {11623#false} #87#return; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 91: Hoare triple {11623#false} havoc #t~mem7;havoc #t~mem6; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 92: Hoare triple {11623#false} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 93: Hoare triple {11623#false} assume true; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 94: Hoare triple {11623#false} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L256 TraceCheckUtils]: 95: Hoare triple {11623#false} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 96: Hoare triple {11623#false} ~cond := #in~cond; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 97: Hoare triple {11623#false} assume ~cond == 0; {11623#false} is VALID [2018-11-14 16:55:11,307 INFO L273 TraceCheckUtils]: 98: Hoare triple {11623#false} assume !false; {11623#false} is VALID [2018-11-14 16:55:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 6 proven. 450 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 16:55:11,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:11,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:11,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:11,374 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-14 16:55:11,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:11,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:12,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-11-14 16:55:12,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-11-14 16:55:12,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:55:12,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:55:12,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:55:12,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:3 [2018-11-14 16:55:12,495 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:55:12,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {11622#true} call ULTIMATE.init(); {11622#true} is VALID [2018-11-14 16:55:12,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {11622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11622#true} is VALID [2018-11-14 16:55:12,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {11622#true} assume true; {11622#true} is VALID [2018-11-14 16:55:12,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11622#true} {11622#true} #83#return; {11622#true} is VALID [2018-11-14 16:55:12,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {11622#true} call #t~ret8 := main(); {11622#true} is VALID [2018-11-14 16:55:12,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {11622#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~swapped~0 := 1; {11658#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {11658#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume true; {11658#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {11658#(and (= 1 main_~swapped~0) (= |main_~#a~0.offset| 0))} assume !!(~swapped~0 != 0);~swapped~0 := 0;~i~0 := 1; {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume true; {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {11665#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume true; {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {11678#(and (= main_~i~0 2) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11691#(and (= main_~i~0 3) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,654 INFO L273 TraceCheckUtils]: 16: Hoare triple {11691#(and (= main_~i~0 3) (= |main_~#a~0.offset| 0))} assume true; {11691#(and (= main_~i~0 3) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {11691#(and (= main_~i~0 3) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11698#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) |main_#t~mem0|) (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {11698#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) |main_#t~mem0|) (<= |main_#t~mem1| (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,658 INFO L273 TraceCheckUtils]: 20: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,677 INFO L273 TraceCheckUtils]: 33: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,699 INFO L273 TraceCheckUtils]: 51: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,701 INFO L273 TraceCheckUtils]: 55: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,703 INFO L273 TraceCheckUtils]: 56: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,705 INFO L273 TraceCheckUtils]: 59: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,706 INFO L273 TraceCheckUtils]: 60: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,706 INFO L273 TraceCheckUtils]: 61: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,707 INFO L273 TraceCheckUtils]: 62: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,708 INFO L273 TraceCheckUtils]: 63: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < 100000);call #t~mem0 := read~int(~#a~0.base, ~#a~0.offset + (~i~0 - 1) * 4, 4);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(#t~mem0 > #t~mem1);havoc #t~mem0;havoc #t~mem1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} ~i~0 := ~i~0 + 1; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < 100000); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,714 INFO L273 TraceCheckUtils]: 71: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(~swapped~0 != 0); {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {11702#(and (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} havoc ~x~0;havoc ~y~0;~x~0 := 0; {11865#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,715 INFO L273 TraceCheckUtils]: 73: Hoare triple {11865#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11865#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,716 INFO L273 TraceCheckUtils]: 74: Hoare triple {11865#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~x~0 < 100000);~y~0 := ~x~0 + 1; {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,717 INFO L273 TraceCheckUtils]: 75: Hoare triple {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,719 INFO L256 TraceCheckUtils]: 77: Hoare triple {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} is VALID [2018-11-14 16:55:12,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} ~cond := #in~cond; {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} is VALID [2018-11-14 16:55:12,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} assume !(~cond == 0); {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} is VALID [2018-11-14 16:55:12,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} assume true; {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} is VALID [2018-11-14 16:55:12,722 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} #87#return; {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,723 INFO L273 TraceCheckUtils]: 82: Hoare triple {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,724 INFO L273 TraceCheckUtils]: 83: Hoare triple {11872#(and (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {11901#(and (= (+ main_~x~0 2) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,725 INFO L273 TraceCheckUtils]: 84: Hoare triple {11901#(and (= (+ main_~x~0 2) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume true; {11901#(and (= (+ main_~x~0 2) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {11901#(and (= (+ main_~x~0 2) main_~y~0) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11908#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,728 INFO L256 TraceCheckUtils]: 86: Hoare triple {11908#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} is VALID [2018-11-14 16:55:12,729 INFO L273 TraceCheckUtils]: 87: Hoare triple {11882#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12)))} ~cond := #in~cond; {11915#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:55:12,730 INFO L273 TraceCheckUtils]: 88: Hoare triple {11915#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(~cond == 0); {11919#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))))} is VALID [2018-11-14 16:55:12,730 INFO L273 TraceCheckUtils]: 89: Hoare triple {11919#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))))} assume true; {11919#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))))} is VALID [2018-11-14 16:55:12,732 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {11919#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int)) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 12))))} {11908#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= |main_#t~mem7| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} #87#return; {11926#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,734 INFO L273 TraceCheckUtils]: 91: Hoare triple {11926#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} havoc #t~mem7;havoc #t~mem6; {11926#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,735 INFO L273 TraceCheckUtils]: 92: Hoare triple {11926#(and (= (+ main_~x~0 2) main_~y~0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} #t~post5 := ~y~0;~y~0 := #t~post5 + 1;havoc #t~post5; {11933#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (+ main_~x~0 3) main_~y~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,736 INFO L273 TraceCheckUtils]: 93: Hoare triple {11933#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (+ main_~x~0 3) main_~y~0) (= |main_~#a~0.offset| 0))} assume true; {11933#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (+ main_~x~0 3) main_~y~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-14 16:55:12,737 INFO L273 TraceCheckUtils]: 94: Hoare triple {11933#(and (= main_~x~0 0) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset| 8))) (<= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= (+ main_~x~0 3) main_~y~0) (= |main_~#a~0.offset| 0))} assume !!(~y~0 < 100000);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4);call #t~mem7 := read~int(~#a~0.base, ~#a~0.offset + ~y~0 * 4, 4); {11940#(<= |main_#t~mem6| |main_#t~mem7|)} is VALID [2018-11-14 16:55:12,738 INFO L256 TraceCheckUtils]: 95: Hoare triple {11940#(<= |main_#t~mem6| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem6 <= #t~mem7 then 1 else 0)); {11944#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 16:55:12,739 INFO L273 TraceCheckUtils]: 96: Hoare triple {11944#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {11948#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 16:55:12,739 INFO L273 TraceCheckUtils]: 97: Hoare triple {11948#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {11623#false} is VALID [2018-11-14 16:55:12,740 INFO L273 TraceCheckUtils]: 98: Hoare triple {11623#false} assume !false; {11623#false} is VALID [2018-11-14 16:55:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-14 16:55:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-11-14 16:55:12,791 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-11-14 16:55:12,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:12,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 16:55:12,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:12,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 16:55:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 16:55:12,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1004, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 16:55:12,983 INFO L87 Difference]: Start difference. First operand 164 states and 197 transitions. Second operand 36 states.