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/loops-crafted-1/Mono3_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:37:26,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:37:26,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:37:26,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:37:26,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:37:26,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:37:26,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:37:26,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:37:26,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:37:26,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:37:26,484 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:37:26,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:37:26,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:37:26,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:37:26,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:37:26,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:37:26,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:37:26,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:37:26,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:37:26,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:37:26,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:37:26,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:37:26,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:37:26,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:37:26,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:37:26,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:37:26,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:37:26,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:37:26,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:37:26,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:37:26,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:37:26,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:37:26,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:37:26,525 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:37:26,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:37:26,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:37:26,528 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 17:37:26,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:37:26,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:37:26,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:37:26,556 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:37:26,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:37:26,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:37:26,561 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:37:26,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:37:26,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:37:26,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:37:26,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:37:26,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:37:26,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:37:26,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:37:26,564 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:37:26,564 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:37:26,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:37:26,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:37:26,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:37:26,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:37:26,565 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:37:26,565 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:37:26,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:37:26,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:37:26,566 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:37:26,566 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:37:26,566 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:37:26,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:37:26,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:37:26,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:37:26,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:37:26,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:37:26,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:37:26,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:37:26,661 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:37:26,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-14 17:37:26,734 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedaccbd4/fe516ca9b4f7419d86ca16a27970e48f/FLAG75e6e55a7 [2018-11-14 17:37:27,263 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:37:27,264 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-14 17:37:27,271 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedaccbd4/fe516ca9b4f7419d86ca16a27970e48f/FLAG75e6e55a7 [2018-11-14 17:37:27,286 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bedaccbd4/fe516ca9b4f7419d86ca16a27970e48f [2018-11-14 17:37:27,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:37:27,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:37:27,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:37:27,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:37:27,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:37:27,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f31989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27, skipping insertion in model container [2018-11-14 17:37:27,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:37:27,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:37:27,551 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:37:27,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:37:27,575 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:37:27,592 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:37:27,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27 WrapperNode [2018-11-14 17:37:27,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:37:27,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:37:27,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:37:27,594 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:37:27,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (1/1) ... [2018-11-14 17:37:27,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:37:27,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:37:27,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:37:27,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:37:27,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (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 17:37:27,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:37:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:37:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:37:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:37:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:37:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:37:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:37:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:37:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:37:28,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:37:28,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:37:28 BoogieIcfgContainer [2018-11-14 17:37:28,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:37:28,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:37:28,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:37:28,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:37:28,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:37:27" (1/3) ... [2018-11-14 17:37:28,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aafde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:37:28, skipping insertion in model container [2018-11-14 17:37:28,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:37:27" (2/3) ... [2018-11-14 17:37:28,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aafde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:37:28, skipping insertion in model container [2018-11-14 17:37:28,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:37:28" (3/3) ... [2018-11-14 17:37:28,187 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono3_false-unreach-call1.c [2018-11-14 17:37:28,198 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:37:28,210 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:37:28,229 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:37:28,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:37:28,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:37:28,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:37:28,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:37:28,270 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:37:28,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:37:28,271 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:37:28,271 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:37:28,271 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:37:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 17:37:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:37:28,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:28,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:28,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:28,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:28,309 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-14 17:37:28,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:28,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 17:37:28,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 17:37:28,452 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-14 17:37:28,452 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 17:37:28,452 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {23#true} is VALID [2018-11-14 17:37:28,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 17:37:28,455 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {24#false} is VALID [2018-11-14 17:37:28,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 17:37:28,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume ~cond == 0; {24#false} is VALID [2018-11-14 17:37:28,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 17:37:28,459 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 17:37:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:37:28,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:37:28,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:28,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:37:28,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:28,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:37:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:37:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:37:28,536 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 17:37:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:28,603 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:37:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:37:28,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:37:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:37:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:37:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:37:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 17:37:28,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-14 17:37:28,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:28,930 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:37:28,931 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:37:28,936 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 17:37:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:37:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:37:28,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:28,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:37:28,985 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:37:28,985 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:37:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:28,989 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:37:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:37:28,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:28,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:28,990 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:37:28,990 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:37:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:28,994 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:37:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:37:28,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:28,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:28,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:28,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:37:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 17:37:28,999 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-14 17:37:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:29,000 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 17:37:29,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:37:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:37:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:37:29,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:29,001 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:29,001 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:29,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-14 17:37:29,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:29,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 17:37:29,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 17:37:29,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #39#return; {116#true} is VALID [2018-11-14 17:37:29,223 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-14 17:37:29,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} ~x~0 := 0;~y~0 := 0; {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 1000000); {117#false} is VALID [2018-11-14 17:37:29,227 INFO L256 TraceCheckUtils]: 7: Hoare triple {117#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {117#false} is VALID [2018-11-14 17:37:29,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {117#false} ~cond := #in~cond; {117#false} is VALID [2018-11-14 17:37:29,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#false} assume ~cond == 0; {117#false} is VALID [2018-11-14 17:37:29,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 17:37:29,229 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 17:37:29,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:37:29,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:37:29,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:37:29,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:29,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:37:29,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:29,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:37:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:37:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:37:29,297 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-14 17:37:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:29,537 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 17:37:29,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:37:29,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:37:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 17:37:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:37:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 17:37:29,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2018-11-14 17:37:29,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:29,633 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:37:29,634 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:37:29,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:37:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:37:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 17:37:29,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:29,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 17:37:29,653 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 17:37:29,654 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 17:37:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:29,656 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 17:37:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 17:37:29,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:29,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:29,657 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 17:37:29,657 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 17:37:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:29,659 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 17:37:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 17:37:29,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:29,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:29,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:29,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:37:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 17:37:29,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-14 17:37:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:29,662 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 17:37:29,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:37:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 17:37:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:37:29,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:29,664 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:29,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:29,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-14 17:37:29,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:29,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:29,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:29,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 17:37:29,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 17:37:29,861 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #39#return; {220#true} is VALID [2018-11-14 17:37:29,862 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret3 := main(); {220#true} is VALID [2018-11-14 17:37:29,866 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} ~x~0 := 0;~y~0 := 0; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:29,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:29,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:29,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {221#false} is VALID [2018-11-14 17:37:29,875 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {221#false} is VALID [2018-11-14 17:37:29,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 17:37:29,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 17:37:29,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 17:37:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:29,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:29,877 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 17:37:29,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:29,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:30,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 17:37:30,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 17:37:30,353 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #39#return; {220#true} is VALID [2018-11-14 17:37:30,353 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret3 := main(); {220#true} is VALID [2018-11-14 17:37:30,354 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} ~x~0 := 0;~y~0 := 0; {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:30,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume true; {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:30,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~x~0 % 4294967296 < 1000000); {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:30,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {249#(and (= main_~y~0 1) (= main_~x~0 0))} is VALID [2018-11-14 17:37:30,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(and (= main_~y~0 1) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {253#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 17:37:30,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (= main_~x~0 1) (= main_~y~0 1))} assume true; {253#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 17:37:30,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#(and (= main_~x~0 1) (= main_~y~0 1))} assume !(~x~0 % 4294967296 < 1000000); {221#false} is VALID [2018-11-14 17:37:30,360 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {221#false} is VALID [2018-11-14 17:37:30,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 17:37:30,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 17:37:30,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 17:37:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:30,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:30,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-14 17:37:30,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-14 17:37:30,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:30,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:37:30,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:30,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:37:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:37:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:37:30,439 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-11-14 17:37:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:30,888 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:37:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:37:30,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-14 17:37:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:37:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 17:37:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:37:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 17:37:30,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-14 17:37:31,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:31,019 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:37:31,019 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:37:31,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:37:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:37:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-14 17:37:31,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:31,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-14 17:37:31,037 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-14 17:37:31,037 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-14 17:37:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:31,041 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 17:37:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 17:37:31,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:31,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:31,042 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-14 17:37:31,042 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-14 17:37:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:31,044 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 17:37:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 17:37:31,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:31,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:31,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:31,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:37:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-14 17:37:31,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-14 17:37:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:31,048 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-14 17:37:31,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:37:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 17:37:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:37:31,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:31,050 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:31,050 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:31,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:31,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1005624851, now seen corresponding path program 2 times [2018-11-14 17:37:31,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:31,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:31,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:31,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:31,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {388#true} is VALID [2018-11-14 17:37:31,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2018-11-14 17:37:31,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #39#return; {388#true} is VALID [2018-11-14 17:37:31,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {388#true} call #t~ret3 := main(); {388#true} is VALID [2018-11-14 17:37:31,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {388#true} ~x~0 := 0;~y~0 := 0; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:31,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:31,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:31,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:31,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:31,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:31,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:31,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {389#false} is VALID [2018-11-14 17:37:31,268 INFO L256 TraceCheckUtils]: 15: Hoare triple {389#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {389#false} is VALID [2018-11-14 17:37:31,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {389#false} ~cond := #in~cond; {389#false} is VALID [2018-11-14 17:37:31,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {389#false} assume ~cond == 0; {389#false} is VALID [2018-11-14 17:37:31,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {389#false} assume !false; {389#false} is VALID [2018-11-14 17:37:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:31,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:31,271 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 17:37:31,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:37:31,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:37:31,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:31,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:31,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {388#true} is VALID [2018-11-14 17:37:31,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2018-11-14 17:37:31,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #39#return; {388#true} is VALID [2018-11-14 17:37:31,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {388#true} call #t~ret3 := main(); {388#true} is VALID [2018-11-14 17:37:31,560 INFO L273 TraceCheckUtils]: 4: Hoare triple {388#true} ~x~0 := 0;~y~0 := 0; {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:31,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume true; {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:31,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~x~0 % 4294967296 < 1000000); {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 17:37:31,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {418#(and (= main_~y~0 1) (= main_~x~0 0))} is VALID [2018-11-14 17:37:31,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(and (= main_~y~0 1) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 17:37:31,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume true; {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 17:37:31,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 17:37:31,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {432#(and (= main_~x~0 1) (= main_~y~0 2))} is VALID [2018-11-14 17:37:31,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {432#(and (= main_~x~0 1) (= main_~y~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {436#(and (= main_~x~0 2) (= main_~y~0 2))} is VALID [2018-11-14 17:37:31,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {436#(and (= main_~x~0 2) (= main_~y~0 2))} assume true; {436#(and (= main_~x~0 2) (= main_~y~0 2))} is VALID [2018-11-14 17:37:31,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {436#(and (= main_~x~0 2) (= main_~y~0 2))} assume !(~x~0 % 4294967296 < 1000000); {389#false} is VALID [2018-11-14 17:37:31,569 INFO L256 TraceCheckUtils]: 15: Hoare triple {389#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {389#false} is VALID [2018-11-14 17:37:31,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {389#false} ~cond := #in~cond; {389#false} is VALID [2018-11-14 17:37:31,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {389#false} assume ~cond == 0; {389#false} is VALID [2018-11-14 17:37:31,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {389#false} assume !false; {389#false} is VALID [2018-11-14 17:37:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:31,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:31,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-11-14 17:37:31,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 17:37:31,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:31,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:37:31,633 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 17:37:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:37:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:37:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:37:31,635 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-14 17:37:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,055 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-14 17:37:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:37:32,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 17:37:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:37:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 17:37:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:37:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 17:37:32,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2018-11-14 17:37:32,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:32,127 INFO L225 Difference]: With dead ends: 35 [2018-11-14 17:37:32,128 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:37:32,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:37:32,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:37:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-14 17:37:32,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:32,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-14 17:37:32,153 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-14 17:37:32,153 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-14 17:37:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,156 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 17:37:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 17:37:32,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,157 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-14 17:37:32,157 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-14 17:37:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:32,159 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 17:37:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 17:37:32,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:32,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:32,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:32,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:37:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-14 17:37:32,162 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-14 17:37:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:32,162 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-14 17:37:32,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:37:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-14 17:37:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:37:32,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:32,164 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:32,164 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:32,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 387088957, now seen corresponding path program 3 times [2018-11-14 17:37:32,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:32,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:32,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:32,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:32,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2018-11-14 17:37:32,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 17:37:32,784 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #39#return; {589#true} is VALID [2018-11-14 17:37:32,785 INFO L256 TraceCheckUtils]: 3: Hoare triple {589#true} call #t~ret3 := main(); {589#true} is VALID [2018-11-14 17:37:32,786 INFO L273 TraceCheckUtils]: 4: Hoare triple {589#true} ~x~0 := 0;~y~0 := 0; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:32,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:32,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:32,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:32,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:32,789 INFO L273 TraceCheckUtils]: 9: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:32,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:32,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:32,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:32,794 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:32,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:32,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:32,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:32,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:32,804 INFO L273 TraceCheckUtils]: 18: Hoare triple {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {590#false} is VALID [2018-11-14 17:37:32,804 INFO L256 TraceCheckUtils]: 19: Hoare triple {590#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {590#false} is VALID [2018-11-14 17:37:32,804 INFO L273 TraceCheckUtils]: 20: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2018-11-14 17:37:32,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {590#false} assume ~cond == 0; {590#false} is VALID [2018-11-14 17:37:32,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {590#false} assume !false; {590#false} is VALID [2018-11-14 17:37:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:32,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:32,807 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 17:37:32,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:32,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:37:32,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:32,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:32,959 INFO L256 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2018-11-14 17:37:32,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 17:37:32,960 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #39#return; {589#true} is VALID [2018-11-14 17:37:32,960 INFO L256 TraceCheckUtils]: 3: Hoare triple {589#true} call #t~ret3 := main(); {589#true} is VALID [2018-11-14 17:37:32,960 INFO L273 TraceCheckUtils]: 4: Hoare triple {589#true} ~x~0 := 0;~y~0 := 0; {589#true} is VALID [2018-11-14 17:37:32,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 17:37:32,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 17:37:32,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {589#true} is VALID [2018-11-14 17:37:32,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {589#true} is VALID [2018-11-14 17:37:32,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 17:37:32,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 17:37:32,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {589#true} is VALID [2018-11-14 17:37:32,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {589#true} is VALID [2018-11-14 17:37:32,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 17:37:32,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 17:37:32,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {643#(< (mod main_~x~0 4294967296) 500000)} is VALID [2018-11-14 17:37:32,983 INFO L273 TraceCheckUtils]: 16: Hoare triple {643#(< (mod main_~x~0 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:32,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume true; {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:32,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 1000000); {590#false} is VALID [2018-11-14 17:37:32,985 INFO L256 TraceCheckUtils]: 19: Hoare triple {590#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {590#false} is VALID [2018-11-14 17:37:32,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2018-11-14 17:37:32,986 INFO L273 TraceCheckUtils]: 21: Hoare triple {590#false} assume ~cond == 0; {590#false} is VALID [2018-11-14 17:37:32,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {590#false} assume !false; {590#false} is VALID [2018-11-14 17:37:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:37:33,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:37:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-14 17:37:33,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 17:37:33,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:33,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:37:33,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:33,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:37:33,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:37:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:37:33,054 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-11-14 17:37:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,707 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 17:37:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:37:33,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 17:37:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:37:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-14 17:37:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:37:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-14 17:37:33,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2018-11-14 17:37:33,794 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 17:37:33,797 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:37:33,797 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:37:33,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:37:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:37:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-14 17:37:33,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:33,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-14 17:37:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-14 17:37:33,820 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-14 17:37:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,823 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:37:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:37:33,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:33,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:33,825 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-14 17:37:33,825 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-14 17:37:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:33,828 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:37:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:37:33,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:33,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:33,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:33,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:37:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-14 17:37:33,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2018-11-14 17:37:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:33,832 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-14 17:37:33,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:37:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 17:37:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:37:33,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:33,834 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:33,834 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:33,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1305979513, now seen corresponding path program 1 times [2018-11-14 17:37:33,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:33,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:33,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:33,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:34,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2018-11-14 17:37:34,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2018-11-14 17:37:34,119 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #39#return; {860#true} is VALID [2018-11-14 17:37:34,119 INFO L256 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret3 := main(); {860#true} is VALID [2018-11-14 17:37:34,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {860#true} ~x~0 := 0;~y~0 := 0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:34,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:34,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {861#false} is VALID [2018-11-14 17:37:34,147 INFO L256 TraceCheckUtils]: 31: Hoare triple {861#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {861#false} is VALID [2018-11-14 17:37:34,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {861#false} ~cond := #in~cond; {861#false} is VALID [2018-11-14 17:37:34,148 INFO L273 TraceCheckUtils]: 33: Hoare triple {861#false} assume ~cond == 0; {861#false} is VALID [2018-11-14 17:37:34,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {861#false} assume !false; {861#false} is VALID [2018-11-14 17:37:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:34,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:34,154 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 17:37:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:34,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:34,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2018-11-14 17:37:34,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2018-11-14 17:37:34,498 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #39#return; {860#true} is VALID [2018-11-14 17:37:34,499 INFO L256 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret3 := main(); {860#true} is VALID [2018-11-14 17:37:34,514 INFO L273 TraceCheckUtils]: 4: Hoare triple {860#true} ~x~0 := 0;~y~0 := 0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:34,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:34,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:34,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:34,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:34,586 INFO L273 TraceCheckUtils]: 24: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:34,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {861#false} is VALID [2018-11-14 17:37:34,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {861#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {861#false} is VALID [2018-11-14 17:37:34,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {861#false} assume true; {861#false} is VALID [2018-11-14 17:37:34,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {861#false} assume !(~x~0 % 4294967296 < 1000000); {861#false} is VALID [2018-11-14 17:37:34,589 INFO L256 TraceCheckUtils]: 31: Hoare triple {861#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {861#false} is VALID [2018-11-14 17:37:34,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {861#false} ~cond := #in~cond; {861#false} is VALID [2018-11-14 17:37:34,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {861#false} assume ~cond == 0; {861#false} is VALID [2018-11-14 17:37:34,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {861#false} assume !false; {861#false} is VALID [2018-11-14 17:37:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:34,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:34,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-14 17:37:34,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 17:37:34,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:34,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:37:34,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:34,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:37:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:37:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:37:34,714 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2018-11-14 17:37:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:35,178 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 17:37:35,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:37:35,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 17:37:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:37:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2018-11-14 17:37:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:37:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2018-11-14 17:37:35,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2018-11-14 17:37:35,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:35,307 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:37:35,311 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:37:35,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:37:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:37:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-14 17:37:35,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:35,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-14 17:37:35,354 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-14 17:37:35,354 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-14 17:37:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:35,358 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-14 17:37:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-14 17:37:35,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:35,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:35,359 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-14 17:37:35,359 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-14 17:37:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:35,363 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-14 17:37:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-14 17:37:35,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:35,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:35,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:35,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:37:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-14 17:37:35,367 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-11-14 17:37:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:35,367 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-14 17:37:35,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:37:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 17:37:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 17:37:35,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:35,370 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:35,370 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:35,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1729092147, now seen corresponding path program 2 times [2018-11-14 17:37:35,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:35,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:37:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:35,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-14 17:37:35,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 17:37:35,869 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #39#return; {1198#true} is VALID [2018-11-14 17:37:35,869 INFO L256 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret3 := main(); {1198#true} is VALID [2018-11-14 17:37:35,871 INFO L273 TraceCheckUtils]: 4: Hoare triple {1198#true} ~x~0 := 0;~y~0 := 0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:35,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:35,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:35,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:35,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:35,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:35,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:35,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:35,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:35,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:35,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:35,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:35,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:35,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:35,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:35,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:35,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:35,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:35,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:35,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:35,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:35,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:35,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:35,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:35,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:35,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:35,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:35,903 INFO L273 TraceCheckUtils]: 31: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:35,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:35,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:35,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:35,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:35,908 INFO L273 TraceCheckUtils]: 36: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:35,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:35,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {1199#false} is VALID [2018-11-14 17:37:35,910 INFO L256 TraceCheckUtils]: 39: Hoare triple {1199#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1199#false} is VALID [2018-11-14 17:37:35,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2018-11-14 17:37:35,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {1199#false} assume ~cond == 0; {1199#false} is VALID [2018-11-14 17:37:35,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-14 17:37:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:35,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:35,918 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 17:37:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:37:35,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:37:35,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:35,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:36,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-14 17:37:36,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 17:37:36,282 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #39#return; {1198#true} is VALID [2018-11-14 17:37:36,282 INFO L256 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret3 := main(); {1198#true} is VALID [2018-11-14 17:37:36,283 INFO L273 TraceCheckUtils]: 4: Hoare triple {1198#true} ~x~0 := 0;~y~0 := 0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:36,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:36,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:36,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:36,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:36,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:36,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:36,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:36,295 INFO L273 TraceCheckUtils]: 12: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:36,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:36,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:36,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:36,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:36,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:36,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:36,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:36,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:36,302 INFO L273 TraceCheckUtils]: 21: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:36,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:36,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:36,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:36,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:36,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:36,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:36,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:36,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:36,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:36,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:36,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:36,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:36,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:36,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:36,316 INFO L273 TraceCheckUtils]: 36: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:36,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:36,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 1000000); {1199#false} is VALID [2018-11-14 17:37:36,318 INFO L256 TraceCheckUtils]: 39: Hoare triple {1199#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1199#false} is VALID [2018-11-14 17:37:36,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2018-11-14 17:37:36,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {1199#false} assume ~cond == 0; {1199#false} is VALID [2018-11-14 17:37:36,320 INFO L273 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-14 17:37:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:36,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:36,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:37:36,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-14 17:37:36,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:36,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:37:36,405 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 17:37:36,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:37:36,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:37:36,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:37:36,406 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 12 states. [2018-11-14 17:37:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,146 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-14 17:37:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:37:38,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-14 17:37:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:37:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 17:37:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:37:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 17:37:38,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2018-11-14 17:37:38,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:38,261 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:37:38,261 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:37:38,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:37:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:37:38,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-14 17:37:38,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:38,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-14 17:37:38,448 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-14 17:37:38,448 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-14 17:37:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,451 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 17:37:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 17:37:38,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:38,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:38,452 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-14 17:37:38,452 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-14 17:37:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:38,456 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 17:37:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 17:37:38,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:38,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:38,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:38,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:37:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-14 17:37:38,463 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 43 [2018-11-14 17:37:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:38,465 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-14 17:37:38,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:37:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 17:37:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 17:37:38,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:38,468 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:38,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:38,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash -741208799, now seen corresponding path program 3 times [2018-11-14 17:37:38,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:38,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:38,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:38,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:39,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {1599#true} call ULTIMATE.init(); {1599#true} is VALID [2018-11-14 17:37:39,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:39,979 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1599#true} {1599#true} #39#return; {1599#true} is VALID [2018-11-14 17:37:39,980 INFO L256 TraceCheckUtils]: 3: Hoare triple {1599#true} call #t~ret3 := main(); {1599#true} is VALID [2018-11-14 17:37:39,980 INFO L273 TraceCheckUtils]: 4: Hoare triple {1599#true} ~x~0 := 0;~y~0 := 0; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:39,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:39,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:39,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:39,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:39,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:39,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:39,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:39,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:39,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:39,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:39,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:39,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:39,993 INFO L273 TraceCheckUtils]: 17: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:39,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:39,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:39,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:39,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:39,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:39,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:39,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:39,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:39,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:39,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:40,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:40,000 INFO L273 TraceCheckUtils]: 29: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:40,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:40,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:40,003 INFO L273 TraceCheckUtils]: 32: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:40,003 INFO L273 TraceCheckUtils]: 33: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:40,004 INFO L273 TraceCheckUtils]: 34: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:40,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:40,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:40,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:40,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:40,008 INFO L273 TraceCheckUtils]: 39: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:40,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:40,009 INFO L273 TraceCheckUtils]: 41: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:40,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:40,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:40,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:40,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:40,014 INFO L273 TraceCheckUtils]: 46: Hoare triple {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {1600#false} is VALID [2018-11-14 17:37:40,014 INFO L256 TraceCheckUtils]: 47: Hoare triple {1600#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1600#false} is VALID [2018-11-14 17:37:40,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {1600#false} ~cond := #in~cond; {1600#false} is VALID [2018-11-14 17:37:40,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {1600#false} assume ~cond == 0; {1600#false} is VALID [2018-11-14 17:37:40,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {1600#false} assume !false; {1600#false} is VALID [2018-11-14 17:37:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:40,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:40,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:37:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:37:40,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 17:37:40,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:40,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:40,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {1599#true} call ULTIMATE.init(); {1599#true} is VALID [2018-11-14 17:37:40,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,243 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1599#true} {1599#true} #39#return; {1599#true} is VALID [2018-11-14 17:37:40,243 INFO L256 TraceCheckUtils]: 3: Hoare triple {1599#true} call #t~ret3 := main(); {1599#true} is VALID [2018-11-14 17:37:40,244 INFO L273 TraceCheckUtils]: 4: Hoare triple {1599#true} ~x~0 := 0;~y~0 := 0; {1599#true} is VALID [2018-11-14 17:37:40,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 17:37:40,252 INFO L273 TraceCheckUtils]: 38: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 17:37:40,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1732#(< (mod main_~x~0 4294967296) 500000)} is VALID [2018-11-14 17:37:40,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {1732#(< (mod main_~x~0 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume true; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,258 INFO L273 TraceCheckUtils]: 42: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !!(~x~0 % 4294967296 < 1000000); {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume true; {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2018-11-14 17:37:40,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 1000000); {1600#false} is VALID [2018-11-14 17:37:40,261 INFO L256 TraceCheckUtils]: 47: Hoare triple {1600#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1600#false} is VALID [2018-11-14 17:37:40,262 INFO L273 TraceCheckUtils]: 48: Hoare triple {1600#false} ~cond := #in~cond; {1600#false} is VALID [2018-11-14 17:37:40,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {1600#false} assume ~cond == 0; {1600#false} is VALID [2018-11-14 17:37:40,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {1600#false} assume !false; {1600#false} is VALID [2018-11-14 17:37:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-14 17:37:40,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:40,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-14 17:37:40,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-14 17:37:40,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:40,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:37:40,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:40,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:37:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:37:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:37:40,350 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 16 states. [2018-11-14 17:37:43,386 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-14 17:37:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:43,850 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2018-11-14 17:37:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:37:43,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-14 17:37:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:37:43,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2018-11-14 17:37:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:37:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2018-11-14 17:37:43,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2018-11-14 17:37:44,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:44,045 INFO L225 Difference]: With dead ends: 87 [2018-11-14 17:37:44,045 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:37:44,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:37:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:37:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-11-14 17:37:44,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:44,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 68 states. [2018-11-14 17:37:44,087 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 68 states. [2018-11-14 17:37:44,087 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 68 states. [2018-11-14 17:37:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:44,091 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-14 17:37:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-14 17:37:44,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:44,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:44,092 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 75 states. [2018-11-14 17:37:44,092 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 75 states. [2018-11-14 17:37:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:44,094 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-14 17:37:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-14 17:37:44,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:44,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:44,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:44,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:37:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-14 17:37:44,098 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 51 [2018-11-14 17:37:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:44,098 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-14 17:37:44,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:37:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-14 17:37:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:37:44,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:44,099 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:44,099 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:44,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash 732260999, now seen corresponding path program 4 times [2018-11-14 17:37:44,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:44,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:44,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:44,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2018-11-14 17:37:44,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2018-11-14 17:37:44,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #39#return; {2128#true} is VALID [2018-11-14 17:37:44,614 INFO L256 TraceCheckUtils]: 3: Hoare triple {2128#true} call #t~ret3 := main(); {2128#true} is VALID [2018-11-14 17:37:44,615 INFO L273 TraceCheckUtils]: 4: Hoare triple {2128#true} ~x~0 := 0;~y~0 := 0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:44,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:44,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:44,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:44,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:44,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:44,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:44,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:44,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:44,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:44,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:44,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:44,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:44,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:44,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:44,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:44,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:44,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:44,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:44,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:44,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:44,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:44,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:44,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:44,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:44,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:44,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:44,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:44,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:44,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:44,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:44,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:44,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:44,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:44,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:44,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:44,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:44,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:44,655 INFO L273 TraceCheckUtils]: 42: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:44,656 INFO L273 TraceCheckUtils]: 43: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:44,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:44,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:44,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:44,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:44,665 INFO L273 TraceCheckUtils]: 48: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:44,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:44,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:44,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:44,669 INFO L273 TraceCheckUtils]: 52: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:44,670 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:44,671 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:44,672 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:44,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:44,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:44,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:44,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:44,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:44,677 INFO L273 TraceCheckUtils]: 61: Hoare triple {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:44,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 17:37:44,679 INFO L256 TraceCheckUtils]: 63: Hoare triple {2129#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2129#false} is VALID [2018-11-14 17:37:44,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2018-11-14 17:37:44,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {2129#false} assume ~cond == 0; {2129#false} is VALID [2018-11-14 17:37:44,680 INFO L273 TraceCheckUtils]: 66: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2018-11-14 17:37:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:44,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:44,694 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 17:37:44,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:37:44,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:37:44,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:37:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:44,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:37:45,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2018-11-14 17:37:45,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2018-11-14 17:37:45,053 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #39#return; {2128#true} is VALID [2018-11-14 17:37:45,053 INFO L256 TraceCheckUtils]: 3: Hoare triple {2128#true} call #t~ret3 := main(); {2128#true} is VALID [2018-11-14 17:37:45,054 INFO L273 TraceCheckUtils]: 4: Hoare triple {2128#true} ~x~0 := 0;~y~0 := 0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:45,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:45,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:45,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:45,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:45,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:45,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:45,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:45,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:45,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:45,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:45,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:45,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:45,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:45,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:45,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:45,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:45,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:45,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:45,091 INFO L273 TraceCheckUtils]: 23: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:45,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:45,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:45,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:45,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:45,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:45,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:45,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:45,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:45,096 INFO L273 TraceCheckUtils]: 32: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:45,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:45,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:45,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:45,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:45,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:45,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:45,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:45,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:45,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:45,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:45,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:45,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:45,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:45,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:45,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:45,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:45,109 INFO L273 TraceCheckUtils]: 49: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:45,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:45,110 INFO L273 TraceCheckUtils]: 51: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:45,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:45,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:45,128 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2129#false} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {2129#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2129#false} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 57: Hoare triple {2129#false} assume true; {2129#false} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {2129#false} assume !!(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {2129#false} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2129#false} is VALID [2018-11-14 17:37:45,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {2129#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {2129#false} assume true; {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {2129#false} assume !(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L256 TraceCheckUtils]: 63: Hoare triple {2129#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {2129#false} assume ~cond == 0; {2129#false} is VALID [2018-11-14 17:37:45,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2018-11-14 17:37:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 89 proven. 300 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:37:45,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:37:45,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2018-11-14 17:37:45,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 17:37:45,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:37:45,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:37:45,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:37:45,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:37:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:37:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:37:45,232 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-11-14 17:37:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:46,859 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-14 17:37:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:37:46,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 17:37:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:37:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:37:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2018-11-14 17:37:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:37:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2018-11-14 17:37:46,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 88 transitions. [2018-11-14 17:37:46,978 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 17:37:46,981 INFO L225 Difference]: With dead ends: 97 [2018-11-14 17:37:46,981 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 17:37:46,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:37:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 17:37:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-14 17:37:47,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:37:47,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-14 17:37:47,061 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-14 17:37:47,062 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-14 17:37:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:47,065 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-14 17:37:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-14 17:37:47,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:47,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:47,066 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-14 17:37:47,066 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-14 17:37:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:37:47,069 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-14 17:37:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-14 17:37:47,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:37:47,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:37:47,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:37:47,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:37:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:37:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-14 17:37:47,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 67 [2018-11-14 17:37:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:37:47,073 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-14 17:37:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:37:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-14 17:37:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 17:37:47,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:37:47,075 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:37:47,075 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:37:47,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:37:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 256570373, now seen corresponding path program 5 times [2018-11-14 17:37:47,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:37:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:37:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:47,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:37:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:37:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:37:47,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {2737#true} call ULTIMATE.init(); {2737#true} is VALID [2018-11-14 17:37:47,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {2737#true} assume true; {2737#true} is VALID [2018-11-14 17:37:47,818 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2737#true} {2737#true} #39#return; {2737#true} is VALID [2018-11-14 17:37:47,819 INFO L256 TraceCheckUtils]: 3: Hoare triple {2737#true} call #t~ret3 := main(); {2737#true} is VALID [2018-11-14 17:37:47,819 INFO L273 TraceCheckUtils]: 4: Hoare triple {2737#true} ~x~0 := 0;~y~0 := 0; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:47,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:47,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:47,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:37:47,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:47,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:47,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:47,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:37:47,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:47,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:47,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:47,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:37:47,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:47,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:47,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:47,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:37:47,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:47,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:47,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:47,834 INFO L273 TraceCheckUtils]: 23: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:37:47,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:47,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:47,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:47,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:37:47,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:47,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:47,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:47,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:37:47,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:47,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:47,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:47,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:37:47,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:47,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:47,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:47,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:37:47,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:47,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:47,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:47,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:37:47,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:47,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:47,854 INFO L273 TraceCheckUtils]: 46: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:47,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:37:47,855 INFO L273 TraceCheckUtils]: 48: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:47,856 INFO L273 TraceCheckUtils]: 49: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:47,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:47,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 17:37:47,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:47,860 INFO L273 TraceCheckUtils]: 53: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:47,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:47,861 INFO L273 TraceCheckUtils]: 55: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:37:47,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:47,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:47,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:47,865 INFO L273 TraceCheckUtils]: 59: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 17:37:47,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:37:47,866 INFO L273 TraceCheckUtils]: 61: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:37:47,867 INFO L273 TraceCheckUtils]: 62: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:37:47,868 INFO L273 TraceCheckUtils]: 63: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:37:47,869 INFO L273 TraceCheckUtils]: 64: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 17:37:47,870 INFO L273 TraceCheckUtils]: 65: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 17:37:47,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 1000000); {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 17:37:47,871 INFO L273 TraceCheckUtils]: 67: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 17:37:47,872 INFO L273 TraceCheckUtils]: 68: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:37:47,873 INFO L273 TraceCheckUtils]: 69: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:37:47,874 INFO L273 TraceCheckUtils]: 70: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:37:47,875 INFO L273 TraceCheckUtils]: 71: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:37:47,876 INFO L273 TraceCheckUtils]: 72: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:47,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:37:47,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {2738#false} is VALID [2018-11-14 17:37:47,878 INFO L256 TraceCheckUtils]: 75: Hoare triple {2738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2738#false} is VALID [2018-11-14 17:37:47,878 INFO L273 TraceCheckUtils]: 76: Hoare triple {2738#false} ~cond := #in~cond; {2738#false} is VALID [2018-11-14 17:37:47,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {2738#false} assume ~cond == 0; {2738#false} is VALID [2018-11-14 17:37:47,879 INFO L273 TraceCheckUtils]: 78: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2018-11-14 17:37:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:37:47,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:37:47,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:37:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1