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/Mono5_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:11:08,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:11:08,335 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:11:08,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:11:08,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:11:08,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:11:08,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:11:08,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:11:08,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:11:08,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:11:08,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:11:08,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:11:08,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:11:08,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:11:08,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:11:08,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:11:08,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:11:08,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:11:08,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:11:08,366 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:11:08,367 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:11:08,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:11:08,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:11:08,371 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:11:08,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:11:08,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:11:08,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:11:08,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:11:08,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:11:08,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:11:08,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:11:08,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:11:08,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:11:08,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:11:08,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:11:08,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:11:08,379 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-19 00:11:08,395 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:11:08,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:11:08,397 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:11:08,397 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:11:08,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:11:08,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:11:08,399 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:11:08,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:11:08,400 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:11:08,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:11:08,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:11:08,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:11:08,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:11:08,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:11:08,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:11:08,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:11:08,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:11:08,403 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:11:08,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:11:08,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:11:08,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:11:08,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:11:08,404 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:11:08,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:11:08,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:11:08,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:11:08,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:11:08,405 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:11:08,406 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:11:08,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:11:08,406 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:11:08,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:11:08,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:11:08,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:11:08,489 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:11:08,490 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:11:08,490 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-19 00:11:08,550 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d27d0ddb/ba7277c15b624c18b7b97a9d8afd5f3f/FLAG0e0729fa3 [2018-11-19 00:11:09,002 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:11:09,003 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_false-unreach-call1.c [2018-11-19 00:11:09,011 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d27d0ddb/ba7277c15b624c18b7b97a9d8afd5f3f/FLAG0e0729fa3 [2018-11-19 00:11:09,380 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d27d0ddb/ba7277c15b624c18b7b97a9d8afd5f3f [2018-11-19 00:11:09,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:11:09,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:11:09,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:11:09,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:11:09,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:11:09,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595e579a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09, skipping insertion in model container [2018-11-19 00:11:09,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:11:09,445 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:11:09,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:11:09,662 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:11:09,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:11:09,706 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:11:09,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09 WrapperNode [2018-11-19 00:11:09,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:11:09,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:11:09,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:11:09,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:11:09,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (1/1) ... [2018-11-19 00:11:09,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:11:09,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:11:09,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:11:09,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:11:09,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (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-19 00:11:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:11:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:11:09,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-19 00:11:09,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:11:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:11:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:11:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:11:09,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:11:09,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:11:10,563 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:11:10,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:11:10 BoogieIcfgContainer [2018-11-19 00:11:10,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:11:10,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:11:10,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:11:10,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:11:10,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:11:09" (1/3) ... [2018-11-19 00:11:10,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbe64ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:11:10, skipping insertion in model container [2018-11-19 00:11:10,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:11:09" (2/3) ... [2018-11-19 00:11:10,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbe64ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:11:10, skipping insertion in model container [2018-11-19 00:11:10,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:11:10" (3/3) ... [2018-11-19 00:11:10,573 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono5_false-unreach-call1.c [2018-11-19 00:11:10,583 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:11:10,594 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:11:10,614 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:11:10,649 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:11:10,649 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:11:10,650 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:11:10,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:11:10,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:11:10,651 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:11:10,651 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:11:10,652 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:11:10,652 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:11:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-19 00:11:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-19 00:11:10,687 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:10,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:10,692 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:10,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-19 00:11:10,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:10,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:10,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-19 00:11:10,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-19 00:11:10,887 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-19 00:11:10,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-19 00:11:10,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {23#true} is VALID [2018-11-19 00:11:10,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-19 00:11:10,893 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2018-11-19 00:11:10,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-19 00:11:10,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-19 00:11:10,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-19 00:11:10,897 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-19 00:11:10,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:11:10,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 00:11:10,904 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:11:10,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:10,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 00:11:10,981 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-19 00:11:10,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 00:11:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 00:11:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:11:10,992 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-19 00:11:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:11,073 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-19 00:11:11,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 00:11:11,073 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:11:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:11:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-19 00:11:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:11:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-19 00:11:11,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-19 00:11:11,339 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-19 00:11:11,351 INFO L225 Difference]: With dead ends: 31 [2018-11-19 00:11:11,352 INFO L226 Difference]: Without dead ends: 14 [2018-11-19 00:11:11,355 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-19 00:11:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-19 00:11:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-19 00:11:11,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:11,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-19 00:11:11,398 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-19 00:11:11,398 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-19 00:11:11,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:11,402 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-19 00:11:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-19 00:11:11,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:11,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:11,403 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-19 00:11:11,403 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-19 00:11:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:11,407 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-19 00:11:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-19 00:11:11,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:11,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:11,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:11,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:11:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-19 00:11:11,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-19 00:11:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:11,413 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-19 00:11:11,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 00:11:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-19 00:11:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-19 00:11:11,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:11,414 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:11,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:11,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-19 00:11:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:11,674 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-19 00:11:11,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-19 00:11:11,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-19 00:11:11,746 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #39#return; {116#true} is VALID [2018-11-19 00:11:11,746 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret2 := main(); {116#true} is VALID [2018-11-19 00:11:11,748 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} is VALID [2018-11-19 00:11:11,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} assume true; {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} is VALID [2018-11-19 00:11:11,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} is VALID [2018-11-19 00:11:11,770 INFO L256 TraceCheckUtils]: 7: Hoare triple {118#(and (<= (div main_~z~0 4294967296) 0) (<= 5000000 main_~z~0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {119#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:11:11,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {119#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {120#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-19 00:11:11,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {120#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {117#false} is VALID [2018-11-19 00:11:11,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-19 00:11:11,801 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-19 00:11:11,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:11:11,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:11:11,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-19 00:11:11,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:11,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:11:11,891 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-19 00:11:11,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:11:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:11:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:11:11,892 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-19 00:11:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:12,181 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-19 00:11:12,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 00:11:12,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-19 00:11:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:11:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-19 00:11:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:11:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-19 00:11:12,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-19 00:11:12,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:12,253 INFO L225 Difference]: With dead ends: 23 [2018-11-19 00:11:12,254 INFO L226 Difference]: Without dead ends: 18 [2018-11-19 00:11:12,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:11:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-19 00:11:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-19 00:11:12,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:12,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-19 00:11:12,273 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:11:12,273 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:11:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:12,275 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-19 00:11:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-19 00:11:12,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:12,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:12,276 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:11:12,277 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:11:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:12,279 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-19 00:11:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-19 00:11:12,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:12,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:12,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:12,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:11:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-19 00:11:12,282 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2018-11-19 00:11:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:12,283 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-19 00:11:12,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:11:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-19 00:11:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-19 00:11:12,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:12,284 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:12,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:12,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-19 00:11:12,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:12,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:12,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:12,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:12,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-19 00:11:12,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-19 00:11:12,713 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #39#return; {220#true} is VALID [2018-11-19 00:11:12,713 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret2 := main(); {220#true} is VALID [2018-11-19 00:11:12,726 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:12,739 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-19 00:11:12,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:12,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {221#false} is VALID [2018-11-19 00:11:12,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {221#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {221#false} is VALID [2018-11-19 00:11:12,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {221#false} assume true; {221#false} is VALID [2018-11-19 00:11:12,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {221#false} is VALID [2018-11-19 00:11:12,763 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {221#false} is VALID [2018-11-19 00:11:12,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-19 00:11:12,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2018-11-19 00:11:12,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-19 00:11:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:12,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:11:12,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 00:11:12,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-19 00:11:12,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:12,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 00:11:12,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:12,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 00:11:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 00:11:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:11:12,838 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2018-11-19 00:11:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:12,934 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-19 00:11:12,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 00:11:12,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-19 00:11:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:11:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-19 00:11:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:11:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-19 00:11:12,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-11-19 00:11:13,063 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-19 00:11:13,065 INFO L225 Difference]: With dead ends: 31 [2018-11-19 00:11:13,066 INFO L226 Difference]: Without dead ends: 22 [2018-11-19 00:11:13,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:11:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-19 00:11:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-19 00:11:13,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:13,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-19 00:11:13,096 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-19 00:11:13,097 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-19 00:11:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:13,099 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-19 00:11:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-19 00:11:13,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:13,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:13,100 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-19 00:11:13,100 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-19 00:11:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:13,102 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-19 00:11:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-19 00:11:13,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:13,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:13,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:13,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:11:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-19 00:11:13,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-19 00:11:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:13,106 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-19 00:11:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 00:11:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-19 00:11:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-19 00:11:13,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:13,108 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:13,108 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:13,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1263790289, now seen corresponding path program 1 times [2018-11-19 00:11:13,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:13,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:13,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {342#true} call ULTIMATE.init(); {342#true} is VALID [2018-11-19 00:11:13,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {342#true} assume true; {342#true} is VALID [2018-11-19 00:11:13,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {342#true} {342#true} #39#return; {342#true} is VALID [2018-11-19 00:11:13,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {342#true} call #t~ret2 := main(); {342#true} is VALID [2018-11-19 00:11:13,322 INFO L273 TraceCheckUtils]: 4: Hoare triple {342#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:13,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:13,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:13,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {345#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {343#false} is VALID [2018-11-19 00:11:13,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {343#false} is VALID [2018-11-19 00:11:13,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#false} assume true; {343#false} is VALID [2018-11-19 00:11:13,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {343#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {343#false} is VALID [2018-11-19 00:11:13,338 INFO L256 TraceCheckUtils]: 15: Hoare triple {343#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {343#false} is VALID [2018-11-19 00:11:13,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {343#false} ~cond := #in~cond; {343#false} is VALID [2018-11-19 00:11:13,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {343#false} assume 0 == ~cond; {343#false} is VALID [2018-11-19 00:11:13,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {343#false} assume !false; {343#false} is VALID [2018-11-19 00:11:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:13,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:13,341 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-19 00:11:13,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:13,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:13,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {342#true} call ULTIMATE.init(); {342#true} is VALID [2018-11-19 00:11:13,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {342#true} assume true; {342#true} is VALID [2018-11-19 00:11:13,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {342#true} {342#true} #39#return; {342#true} is VALID [2018-11-19 00:11:13,513 INFO L256 TraceCheckUtils]: 3: Hoare triple {342#true} call #t~ret2 := main(); {342#true} is VALID [2018-11-19 00:11:13,515 INFO L273 TraceCheckUtils]: 4: Hoare triple {342#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:13,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {344#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:13,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:13,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:13,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {373#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {343#false} is VALID [2018-11-19 00:11:13,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {343#false} is VALID [2018-11-19 00:11:13,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#false} assume true; {343#false} is VALID [2018-11-19 00:11:13,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {343#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {343#false} is VALID [2018-11-19 00:11:13,529 INFO L256 TraceCheckUtils]: 15: Hoare triple {343#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {343#false} is VALID [2018-11-19 00:11:13,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {343#false} ~cond := #in~cond; {343#false} is VALID [2018-11-19 00:11:13,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {343#false} assume 0 == ~cond; {343#false} is VALID [2018-11-19 00:11:13,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {343#false} assume !false; {343#false} is VALID [2018-11-19 00:11:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:13,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:13,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-19 00:11:13,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-19 00:11:13,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:13,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:11:13,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:13,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:11:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:11:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:11:13,612 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-11-19 00:11:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:13,892 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-19 00:11:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-19 00:11:13,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-19 00:11:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:11:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-19 00:11:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:11:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2018-11-19 00:11:13,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2018-11-19 00:11:13,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:13,975 INFO L225 Difference]: With dead ends: 35 [2018-11-19 00:11:13,975 INFO L226 Difference]: Without dead ends: 26 [2018-11-19 00:11:13,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:11:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-19 00:11:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-19 00:11:13,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:13,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-19 00:11:13,995 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-19 00:11:13,995 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-19 00:11:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:13,997 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-19 00:11:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-19 00:11:13,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:13,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:13,998 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-19 00:11:13,999 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-19 00:11:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:14,001 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-19 00:11:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-19 00:11:14,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:14,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:14,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:14,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:11:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-19 00:11:14,004 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 19 [2018-11-19 00:11:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:14,005 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-19 00:11:14,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:11:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-19 00:11:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-19 00:11:14,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:14,006 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:14,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:14,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -375813959, now seen corresponding path program 2 times [2018-11-19 00:11:14,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:14,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:14,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:14,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-19 00:11:14,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-19 00:11:14,294 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #39#return; {538#true} is VALID [2018-11-19 00:11:14,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {538#true} call #t~ret2 := main(); {538#true} is VALID [2018-11-19 00:11:14,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {538#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:14,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:14,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:14,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {542#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {539#false} is VALID [2018-11-19 00:11:14,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {539#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {539#false} is VALID [2018-11-19 00:11:14,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} assume true; {539#false} is VALID [2018-11-19 00:11:14,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {539#false} is VALID [2018-11-19 00:11:14,310 INFO L256 TraceCheckUtils]: 19: Hoare triple {539#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {539#false} is VALID [2018-11-19 00:11:14,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-19 00:11:14,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2018-11-19 00:11:14,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-19 00:11:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:14,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:14,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:11:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:11:14,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:11:14,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:14,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:14,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-19 00:11:14,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-19 00:11:14,608 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #39#return; {538#true} is VALID [2018-11-19 00:11:14,609 INFO L256 TraceCheckUtils]: 3: Hoare triple {538#true} call #t~ret2 := main(); {538#true} is VALID [2018-11-19 00:11:14,621 INFO L273 TraceCheckUtils]: 4: Hoare triple {538#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:14,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:14,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:14,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:14,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:14,638 INFO L273 TraceCheckUtils]: 15: Hoare triple {582#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {539#false} is VALID [2018-11-19 00:11:14,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {539#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {539#false} is VALID [2018-11-19 00:11:14,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} assume true; {539#false} is VALID [2018-11-19 00:11:14,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {539#false} is VALID [2018-11-19 00:11:14,640 INFO L256 TraceCheckUtils]: 19: Hoare triple {539#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {539#false} is VALID [2018-11-19 00:11:14,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-19 00:11:14,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2018-11-19 00:11:14,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-19 00:11:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:14,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-19 00:11:14,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-19 00:11:14,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:14,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:11:14,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:14,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:11:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:11:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:11:14,715 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2018-11-19 00:11:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:14,957 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-19 00:11:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 00:11:14,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-19 00:11:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:11:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-19 00:11:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:11:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-19 00:11:14,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-19 00:11:15,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:15,025 INFO L225 Difference]: With dead ends: 39 [2018-11-19 00:11:15,025 INFO L226 Difference]: Without dead ends: 30 [2018-11-19 00:11:15,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:11:15,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-19 00:11:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-19 00:11:15,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:15,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-19 00:11:15,063 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-19 00:11:15,063 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-19 00:11:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:15,066 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-19 00:11:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-19 00:11:15,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:15,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:15,067 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-19 00:11:15,067 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-19 00:11:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:15,069 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-19 00:11:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-19 00:11:15,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:15,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:15,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:15,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-19 00:11:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-19 00:11:15,073 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 23 [2018-11-19 00:11:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:15,073 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-19 00:11:15,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:11:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-19 00:11:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-19 00:11:15,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:15,075 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:15,075 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:15,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1430457183, now seen corresponding path program 3 times [2018-11-19 00:11:15,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:15,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:15,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:15,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:15,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:15,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-19 00:11:15,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-19 00:11:15,368 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {765#true} {765#true} #39#return; {765#true} is VALID [2018-11-19 00:11:15,369 INFO L256 TraceCheckUtils]: 3: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-19 00:11:15,383 INFO L273 TraceCheckUtils]: 4: Hoare triple {765#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:15,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:15,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:15,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:15,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {767#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:15,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:15,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:15,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:15,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {768#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:15,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:15,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:15,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:15,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {769#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:15,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:15,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:15,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {770#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {766#false} is VALID [2018-11-19 00:11:15,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {766#false} is VALID [2018-11-19 00:11:15,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#false} assume true; {766#false} is VALID [2018-11-19 00:11:15,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {766#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {766#false} is VALID [2018-11-19 00:11:15,411 INFO L256 TraceCheckUtils]: 23: Hoare triple {766#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {766#false} is VALID [2018-11-19 00:11:15,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-19 00:11:15,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-19 00:11:15,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-19 00:11:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:15,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:15,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:11:15,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:11:15,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-19 00:11:15,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:15,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:15,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-19 00:11:15,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-19 00:11:15,606 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {765#true} {765#true} #39#return; {765#true} is VALID [2018-11-19 00:11:15,606 INFO L256 TraceCheckUtils]: 3: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-19 00:11:15,607 INFO L273 TraceCheckUtils]: 4: Hoare triple {765#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {786#(= main_~z~0 5000000)} assume true; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {786#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {786#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {786#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {786#(= main_~z~0 5000000)} assume true; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {786#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {786#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {786#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {786#(= main_~z~0 5000000)} assume true; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {786#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {786#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {786#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {786#(= main_~z~0 5000000)} assume true; {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {786#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {786#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:15,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {786#(= main_~z~0 5000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {832#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:15,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {832#(= main_~z~0 4999999)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {832#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:15,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {832#(= main_~z~0 4999999)} assume true; {832#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:15,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {832#(= main_~z~0 4999999)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {832#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:15,621 INFO L256 TraceCheckUtils]: 23: Hoare triple {832#(= main_~z~0 4999999)} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {845#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:11:15,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {845#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {849#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:11:15,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {849#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {766#false} is VALID [2018-11-19 00:11:15,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-19 00:11:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-19 00:11:15,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:15,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-19 00:11:15,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-19 00:11:15,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:15,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-19 00:11:15,694 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-19 00:11:15,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-19 00:11:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-19 00:11:15,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:11:15,695 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2018-11-19 00:11:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:16,417 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-19 00:11:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 00:11:16,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-19 00:11:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:11:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-19 00:11:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-19 00:11:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-19 00:11:16,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2018-11-19 00:11:16,503 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-19 00:11:16,505 INFO L225 Difference]: With dead ends: 50 [2018-11-19 00:11:16,505 INFO L226 Difference]: Without dead ends: 38 [2018-11-19 00:11:16,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:11:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-19 00:11:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-19 00:11:16,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:16,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-19 00:11:16,531 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-19 00:11:16,532 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-19 00:11:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:16,535 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-19 00:11:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-19 00:11:16,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:16,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:16,536 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-19 00:11:16,536 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-19 00:11:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:16,539 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-19 00:11:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-19 00:11:16,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:16,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:16,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:16,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 00:11:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-19 00:11:16,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2018-11-19 00:11:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:16,544 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-19 00:11:16,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-19 00:11:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-19 00:11:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-19 00:11:16,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:16,545 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:16,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:16,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -366877261, now seen corresponding path program 4 times [2018-11-19 00:11:16,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:16,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:16,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:16,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-19 00:11:16,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-19 00:11:16,868 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #39#return; {1059#true} is VALID [2018-11-19 00:11:16,869 INFO L256 TraceCheckUtils]: 3: Hoare triple {1059#true} call #t~ret2 := main(); {1059#true} is VALID [2018-11-19 00:11:16,870 INFO L273 TraceCheckUtils]: 4: Hoare triple {1059#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:16,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:16,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:16,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:16,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:16,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:16,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:16,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:16,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:16,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:16,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:16,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:16,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:16,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:16,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:16,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:16,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:16,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:16,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:16,893 INFO L273 TraceCheckUtils]: 23: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:16,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:16,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume true; {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:16,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:16,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {1066#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1060#false} is VALID [2018-11-19 00:11:16,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {1060#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1060#false} is VALID [2018-11-19 00:11:16,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {1060#false} assume true; {1060#false} is VALID [2018-11-19 00:11:16,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {1060#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1060#false} is VALID [2018-11-19 00:11:16,902 INFO L256 TraceCheckUtils]: 31: Hoare triple {1060#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1060#false} is VALID [2018-11-19 00:11:16,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2018-11-19 00:11:16,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2018-11-19 00:11:16,903 INFO L273 TraceCheckUtils]: 34: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-19 00:11:16,907 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-19 00:11:16,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:16,907 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-19 00:11:16,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:11:16,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:11:16,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:16,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:17,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-19 00:11:17,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-19 00:11:17,089 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #39#return; {1059#true} is VALID [2018-11-19 00:11:17,089 INFO L256 TraceCheckUtils]: 3: Hoare triple {1059#true} call #t~ret2 := main(); {1059#true} is VALID [2018-11-19 00:11:17,090 INFO L273 TraceCheckUtils]: 4: Hoare triple {1059#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:17,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:17,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:17,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:17,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {1061#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:17,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:17,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:17,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:17,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {1062#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:17,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:17,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:17,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:17,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {1063#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:17,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:17,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:17,116 INFO L273 TraceCheckUtils]: 19: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:17,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {1064#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:17,117 INFO L273 TraceCheckUtils]: 21: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:17,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:17,119 INFO L273 TraceCheckUtils]: 23: Hoare triple {1065#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1060#false} is VALID [2018-11-19 00:11:17,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {1060#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1060#false} is VALID [2018-11-19 00:11:17,120 INFO L273 TraceCheckUtils]: 25: Hoare triple {1060#false} assume true; {1060#false} is VALID [2018-11-19 00:11:17,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {1060#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1060#false} is VALID [2018-11-19 00:11:17,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {1060#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1060#false} is VALID [2018-11-19 00:11:17,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {1060#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1060#false} is VALID [2018-11-19 00:11:17,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {1060#false} assume true; {1060#false} is VALID [2018-11-19 00:11:17,122 INFO L273 TraceCheckUtils]: 30: Hoare triple {1060#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1060#false} is VALID [2018-11-19 00:11:17,122 INFO L256 TraceCheckUtils]: 31: Hoare triple {1060#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1060#false} is VALID [2018-11-19 00:11:17,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2018-11-19 00:11:17,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2018-11-19 00:11:17,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-19 00:11:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-19 00:11:17,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:17,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-19 00:11:17,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-19 00:11:17,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:17,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-19 00:11:17,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:17,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-19 00:11:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-19 00:11:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:11:17,214 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 8 states. [2018-11-19 00:11:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:17,740 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-19 00:11:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-19 00:11:17,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-19 00:11:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:11:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-19 00:11:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:11:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-19 00:11:17,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2018-11-19 00:11:17,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:17,886 INFO L225 Difference]: With dead ends: 59 [2018-11-19 00:11:17,886 INFO L226 Difference]: Without dead ends: 46 [2018-11-19 00:11:17,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:11:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-19 00:11:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-19 00:11:17,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:17,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-19 00:11:17,990 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-19 00:11:17,991 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-19 00:11:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:17,994 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-19 00:11:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-19 00:11:17,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:17,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:17,995 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-19 00:11:17,996 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-19 00:11:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:17,998 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-19 00:11:17,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-19 00:11:17,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:17,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:17,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:17,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-19 00:11:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-19 00:11:18,002 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 35 [2018-11-19 00:11:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:18,002 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-19 00:11:18,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-19 00:11:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-19 00:11:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-19 00:11:18,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:18,004 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:18,004 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:18,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:18,005 INFO L82 PathProgramCache]: Analyzing trace with hash 773411203, now seen corresponding path program 5 times [2018-11-19 00:11:18,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:18,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:18,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:18,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:18,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:18,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-19 00:11:18,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-19 00:11:18,465 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #39#return; {1401#true} is VALID [2018-11-19 00:11:18,466 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret2 := main(); {1401#true} is VALID [2018-11-19 00:11:18,466 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:18,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:18,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:18,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:18,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:18,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:18,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:18,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:18,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:18,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:18,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:18,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:18,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:18,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:18,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:18,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:18,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:18,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:18,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:18,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:18,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:18,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:18,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:18,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:18,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:18,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:18,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:18,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:18,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:18,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:18,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:18,560 INFO L273 TraceCheckUtils]: 35: Hoare triple {1410#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1402#false} is VALID [2018-11-19 00:11:18,560 INFO L273 TraceCheckUtils]: 36: Hoare triple {1402#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1402#false} is VALID [2018-11-19 00:11:18,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {1402#false} assume true; {1402#false} is VALID [2018-11-19 00:11:18,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1402#false} is VALID [2018-11-19 00:11:18,561 INFO L256 TraceCheckUtils]: 39: Hoare triple {1402#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-19 00:11:18,562 INFO L273 TraceCheckUtils]: 40: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-19 00:11:18,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-19 00:11:18,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-19 00:11:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:18,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:18,567 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-19 00:11:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:11:44,369 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-19 00:11:44,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:44,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:44,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {1401#true} call ULTIMATE.init(); {1401#true} is VALID [2018-11-19 00:11:44,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2018-11-19 00:11:44,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #39#return; {1401#true} is VALID [2018-11-19 00:11:44,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {1401#true} call #t~ret2 := main(); {1401#true} is VALID [2018-11-19 00:11:44,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {1401#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:44,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:44,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:44,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:44,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {1403#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:44,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:44,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:44,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:44,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {1404#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:44,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:44,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:44,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:44,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:44,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:44,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:44,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:44,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {1406#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:44,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:44,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:44,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:44,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:44,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:44,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:44,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:44,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {1408#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:44,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:44,645 INFO L273 TraceCheckUtils]: 30: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:44,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:44,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {1409#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:44,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:44,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:44,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {1510#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1402#false} is VALID [2018-11-19 00:11:44,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {1402#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1402#false} is VALID [2018-11-19 00:11:44,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {1402#false} assume true; {1402#false} is VALID [2018-11-19 00:11:44,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {1402#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1402#false} is VALID [2018-11-19 00:11:44,652 INFO L256 TraceCheckUtils]: 39: Hoare triple {1402#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1402#false} is VALID [2018-11-19 00:11:44,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {1402#false} ~cond := #in~cond; {1402#false} is VALID [2018-11-19 00:11:44,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {1402#false} assume 0 == ~cond; {1402#false} is VALID [2018-11-19 00:11:44,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2018-11-19 00:11:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:44,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:44,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-19 00:11:44,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-19 00:11:44,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:44,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-19 00:11:44,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:44,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-19 00:11:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-19 00:11:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:11:44,737 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 11 states. [2018-11-19 00:11:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:45,810 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-19 00:11:45,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-19 00:11:45,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-19 00:11:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:11:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-19 00:11:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:11:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-19 00:11:45,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2018-11-19 00:11:45,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:45,901 INFO L225 Difference]: With dead ends: 67 [2018-11-19 00:11:45,901 INFO L226 Difference]: Without dead ends: 54 [2018-11-19 00:11:45,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:11:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-19 00:11:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-19 00:11:45,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:45,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-19 00:11:45,983 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-19 00:11:45,983 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-19 00:11:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:45,988 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-19 00:11:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-19 00:11:45,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:45,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:45,988 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-19 00:11:45,989 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-19 00:11:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:45,991 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-19 00:11:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-19 00:11:45,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:45,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:45,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:45,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-19 00:11:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-19 00:11:45,994 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 43 [2018-11-19 00:11:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:45,994 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-19 00:11:45,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-19 00:11:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-19 00:11:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-19 00:11:45,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:45,996 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:45,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1659900589, now seen corresponding path program 6 times [2018-11-19 00:11:45,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:45,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:47,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2018-11-19 00:11:47,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {1806#true} assume true; {1806#true} is VALID [2018-11-19 00:11:47,108 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1806#true} {1806#true} #39#return; {1806#true} is VALID [2018-11-19 00:11:47,108 INFO L256 TraceCheckUtils]: 3: Hoare triple {1806#true} call #t~ret2 := main(); {1806#true} is VALID [2018-11-19 00:11:47,109 INFO L273 TraceCheckUtils]: 4: Hoare triple {1806#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:47,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:47,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:47,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:47,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {1808#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:47,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:47,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:47,113 INFO L273 TraceCheckUtils]: 11: Hoare triple {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:47,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:47,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:47,115 INFO L273 TraceCheckUtils]: 14: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:47,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:47,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:47,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:47,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:47,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:47,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {1811#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:47,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:47,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:47,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:47,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {1812#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:47,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:47,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:47,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:47,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {1813#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:47,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:47,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:47,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:47,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {1814#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:47,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:47,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:47,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:47,136 INFO L273 TraceCheckUtils]: 36: Hoare triple {1815#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:47,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:47,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:47,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:47,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {1816#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:47,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:47,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:47,141 INFO L273 TraceCheckUtils]: 43: Hoare triple {1817#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1807#false} is VALID [2018-11-19 00:11:47,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {1807#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1807#false} is VALID [2018-11-19 00:11:47,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {1807#false} assume true; {1807#false} is VALID [2018-11-19 00:11:47,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {1807#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1807#false} is VALID [2018-11-19 00:11:47,142 INFO L256 TraceCheckUtils]: 47: Hoare triple {1807#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1807#false} is VALID [2018-11-19 00:11:47,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {1807#false} ~cond := #in~cond; {1807#false} is VALID [2018-11-19 00:11:47,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {1807#false} assume 0 == ~cond; {1807#false} is VALID [2018-11-19 00:11:47,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2018-11-19 00:11:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 29 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:47,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:47,148 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-19 00:11:47,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:11:47,187 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-19 00:11:47,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:47,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:47,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2018-11-19 00:11:47,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {1806#true} assume true; {1806#true} is VALID [2018-11-19 00:11:47,371 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1806#true} {1806#true} #39#return; {1806#true} is VALID [2018-11-19 00:11:47,372 INFO L256 TraceCheckUtils]: 3: Hoare triple {1806#true} call #t~ret2 := main(); {1806#true} is VALID [2018-11-19 00:11:47,375 INFO L273 TraceCheckUtils]: 4: Hoare triple {1806#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {1833#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {1833#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,402 INFO L273 TraceCheckUtils]: 37: Hoare triple {1833#(= main_~z~0 5000000)} assume true; {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {1833#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1833#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:47,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {1833#(= main_~z~0 5000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1939#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:47,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {1939#(= main_~z~0 4999999)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1939#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:47,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {1939#(= main_~z~0 4999999)} assume true; {1939#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:47,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {1939#(= main_~z~0 4999999)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1939#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:47,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {1939#(= main_~z~0 4999999)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {1952#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:47,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {1952#(= main_~z~0 4999998)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1952#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:47,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {1952#(= main_~z~0 4999998)} assume true; {1952#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:47,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {1952#(= main_~z~0 4999998)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1952#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:47,409 INFO L256 TraceCheckUtils]: 47: Hoare triple {1952#(= main_~z~0 4999998)} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1965#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:11:47,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {1965#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1969#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:11:47,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {1969#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1807#false} is VALID [2018-11-19 00:11:47,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2018-11-19 00:11:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-19 00:11:47,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:47,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-19 00:11:47,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-11-19 00:11:47,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:47,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-19 00:11:47,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:47,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-19 00:11:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-19 00:11:47,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:11:47,502 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 17 states. [2018-11-19 00:11:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:49,405 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-19 00:11:49,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:11:49,405 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-11-19 00:11:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:11:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-19 00:11:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:11:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-19 00:11:49,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-19 00:11:49,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:49,510 INFO L225 Difference]: With dead ends: 82 [2018-11-19 00:11:49,510 INFO L226 Difference]: Without dead ends: 66 [2018-11-19 00:11:49,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-19 00:11:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-19 00:11:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-19 00:11:49,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:49,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-19 00:11:49,559 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-19 00:11:49,559 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-19 00:11:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:49,562 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-19 00:11:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-19 00:11:49,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:49,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:49,563 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-19 00:11:49,563 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-19 00:11:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:49,565 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-19 00:11:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-19 00:11:49,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:49,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:49,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:49,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-19 00:11:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-19 00:11:49,569 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 51 [2018-11-19 00:11:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:49,569 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-19 00:11:49,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-19 00:11:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-19 00:11:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-19 00:11:49,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:49,570 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:49,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:49,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -86796979, now seen corresponding path program 7 times [2018-11-19 00:11:49,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:49,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:49,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:50,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2018-11-19 00:11:50,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {2322#true} assume true; {2322#true} is VALID [2018-11-19 00:11:50,066 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2322#true} {2322#true} #39#return; {2322#true} is VALID [2018-11-19 00:11:50,066 INFO L256 TraceCheckUtils]: 3: Hoare triple {2322#true} call #t~ret2 := main(); {2322#true} is VALID [2018-11-19 00:11:50,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {2322#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,092 INFO L273 TraceCheckUtils]: 31: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,093 INFO L273 TraceCheckUtils]: 33: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,094 INFO L273 TraceCheckUtils]: 35: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,095 INFO L273 TraceCheckUtils]: 36: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,098 INFO L273 TraceCheckUtils]: 40: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,104 INFO L273 TraceCheckUtils]: 47: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,105 INFO L273 TraceCheckUtils]: 48: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:50,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:50,106 INFO L273 TraceCheckUtils]: 50: Hoare triple {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:50,107 INFO L273 TraceCheckUtils]: 51: Hoare triple {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:50,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {2335#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:50,109 INFO L273 TraceCheckUtils]: 53: Hoare triple {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:50,110 INFO L273 TraceCheckUtils]: 54: Hoare triple {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:50,111 INFO L273 TraceCheckUtils]: 55: Hoare triple {2336#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2323#false} is VALID [2018-11-19 00:11:50,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {2323#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2323#false} is VALID [2018-11-19 00:11:50,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-19 00:11:50,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {2323#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2323#false} is VALID [2018-11-19 00:11:50,112 INFO L256 TraceCheckUtils]: 59: Hoare triple {2323#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2323#false} is VALID [2018-11-19 00:11:50,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {2323#false} ~cond := #in~cond; {2323#false} is VALID [2018-11-19 00:11:50,113 INFO L273 TraceCheckUtils]: 61: Hoare triple {2323#false} assume 0 == ~cond; {2323#false} is VALID [2018-11-19 00:11:50,113 INFO L273 TraceCheckUtils]: 62: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2018-11-19 00:11:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 38 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:50,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:50,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-19 00:11:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:50,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:50,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2018-11-19 00:11:50,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {2322#true} assume true; {2322#true} is VALID [2018-11-19 00:11:50,545 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2322#true} {2322#true} #39#return; {2322#true} is VALID [2018-11-19 00:11:50,545 INFO L256 TraceCheckUtils]: 3: Hoare triple {2322#true} call #t~ret2 := main(); {2322#true} is VALID [2018-11-19 00:11:50,546 INFO L273 TraceCheckUtils]: 4: Hoare triple {2322#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:50,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {2324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:50,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {2325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:50,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {2326#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:50,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {2327#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:50,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,573 INFO L273 TraceCheckUtils]: 25: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:50,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {2329#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:50,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {2330#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:50,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {2331#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,582 INFO L273 TraceCheckUtils]: 37: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:50,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {2332#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:50,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {2333#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,589 INFO L273 TraceCheckUtils]: 46: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:50,590 INFO L273 TraceCheckUtils]: 47: Hoare triple {2334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2323#false} is VALID [2018-11-19 00:11:50,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {2323#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2323#false} is VALID [2018-11-19 00:11:50,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-19 00:11:50,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {2323#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2323#false} is VALID [2018-11-19 00:11:50,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {2323#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2323#false} is VALID [2018-11-19 00:11:50,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {2323#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2323#false} is VALID [2018-11-19 00:11:50,591 INFO L273 TraceCheckUtils]: 53: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-19 00:11:50,591 INFO L273 TraceCheckUtils]: 54: Hoare triple {2323#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2323#false} is VALID [2018-11-19 00:11:50,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {2323#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2323#false} is VALID [2018-11-19 00:11:50,592 INFO L273 TraceCheckUtils]: 56: Hoare triple {2323#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2323#false} is VALID [2018-11-19 00:11:50,592 INFO L273 TraceCheckUtils]: 57: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-19 00:11:50,592 INFO L273 TraceCheckUtils]: 58: Hoare triple {2323#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2323#false} is VALID [2018-11-19 00:11:50,592 INFO L256 TraceCheckUtils]: 59: Hoare triple {2323#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2323#false} is VALID [2018-11-19 00:11:50,593 INFO L273 TraceCheckUtils]: 60: Hoare triple {2323#false} ~cond := #in~cond; {2323#false} is VALID [2018-11-19 00:11:50,593 INFO L273 TraceCheckUtils]: 61: Hoare triple {2323#false} assume 0 == ~cond; {2323#false} is VALID [2018-11-19 00:11:50,593 INFO L273 TraceCheckUtils]: 62: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2018-11-19 00:11:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 118 proven. 210 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-19 00:11:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:50,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-19 00:11:50,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-19 00:11:50,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:50,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-19 00:11:50,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:50,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-19 00:11:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-19 00:11:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:11:50,690 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 15 states. [2018-11-19 00:11:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:52,002 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-11-19 00:11:52,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-19 00:11:52,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-11-19 00:11:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:11:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2018-11-19 00:11:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:11:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2018-11-19 00:11:52,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 80 transitions. [2018-11-19 00:11:52,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:52,110 INFO L225 Difference]: With dead ends: 95 [2018-11-19 00:11:52,110 INFO L226 Difference]: Without dead ends: 78 [2018-11-19 00:11:52,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:11:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-19 00:11:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-19 00:11:52,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:52,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-19 00:11:52,169 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-19 00:11:52,169 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-19 00:11:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:52,175 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-19 00:11:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-19 00:11:52,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:52,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:52,176 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-19 00:11:52,176 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-19 00:11:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:52,178 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-19 00:11:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-19 00:11:52,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:52,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:52,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:52,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-19 00:11:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-19 00:11:52,181 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 63 [2018-11-19 00:11:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:52,181 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-19 00:11:52,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-19 00:11:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-19 00:11:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-19 00:11:52,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:52,183 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:52,183 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:52,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash 317400325, now seen corresponding path program 8 times [2018-11-19 00:11:52,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:52,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:11:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:52,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-19 00:11:52,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-19 00:11:52,682 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2904#true} {2904#true} #39#return; {2904#true} is VALID [2018-11-19 00:11:52,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-19 00:11:52,683 INFO L273 TraceCheckUtils]: 4: Hoare triple {2904#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:52,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:52,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:52,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:52,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:52,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:52,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:52,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:52,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:52,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:52,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:52,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:52,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:52,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:52,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:52,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:52,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:52,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:52,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:52,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:52,740 INFO L273 TraceCheckUtils]: 24: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:52,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:52,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:52,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:52,742 INFO L273 TraceCheckUtils]: 28: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:52,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:52,743 INFO L273 TraceCheckUtils]: 30: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:52,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:52,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:52,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:52,745 INFO L273 TraceCheckUtils]: 34: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:52,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:52,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:52,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:52,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:52,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:52,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:52,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:52,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:52,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:52,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:52,753 INFO L273 TraceCheckUtils]: 45: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:52,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:52,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:52,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:52,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:52,797 INFO L273 TraceCheckUtils]: 50: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:52,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:52,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:52,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:52,814 INFO L273 TraceCheckUtils]: 54: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:52,814 INFO L273 TraceCheckUtils]: 55: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:52,815 INFO L273 TraceCheckUtils]: 56: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:52,815 INFO L273 TraceCheckUtils]: 57: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:52,815 INFO L273 TraceCheckUtils]: 58: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:52,816 INFO L273 TraceCheckUtils]: 59: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:52,816 INFO L273 TraceCheckUtils]: 60: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:52,817 INFO L273 TraceCheckUtils]: 61: Hoare triple {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:52,817 INFO L273 TraceCheckUtils]: 62: Hoare triple {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:52,818 INFO L273 TraceCheckUtils]: 63: Hoare triple {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:52,819 INFO L273 TraceCheckUtils]: 64: Hoare triple {2920#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:52,820 INFO L273 TraceCheckUtils]: 65: Hoare triple {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume true; {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:52,820 INFO L273 TraceCheckUtils]: 66: Hoare triple {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:52,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {2921#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2905#false} is VALID [2018-11-19 00:11:52,822 INFO L273 TraceCheckUtils]: 68: Hoare triple {2905#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2905#false} is VALID [2018-11-19 00:11:52,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-19 00:11:52,822 INFO L273 TraceCheckUtils]: 70: Hoare triple {2905#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2905#false} is VALID [2018-11-19 00:11:52,822 INFO L256 TraceCheckUtils]: 71: Hoare triple {2905#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2905#false} is VALID [2018-11-19 00:11:52,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-19 00:11:52,823 INFO L273 TraceCheckUtils]: 73: Hoare triple {2905#false} assume 0 == ~cond; {2905#false} is VALID [2018-11-19 00:11:52,823 INFO L273 TraceCheckUtils]: 74: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-19 00:11:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 47 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:52,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:52,832 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-19 00:11:52,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:11:52,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:11:52,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:52,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:53,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-19 00:11:53,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-19 00:11:53,217 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2904#true} {2904#true} #39#return; {2904#true} is VALID [2018-11-19 00:11:53,217 INFO L256 TraceCheckUtils]: 3: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-19 00:11:53,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {2904#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:53,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:53,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:53,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:53,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {2906#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:53,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:53,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:53,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:53,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {2907#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:53,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:53,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:53,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:53,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {2908#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:53,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:53,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:53,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:53,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {2909#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:53,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:53,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:53,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:53,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {2910#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:53,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:53,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:53,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:53,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {2911#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:53,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:53,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:53,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:53,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {2912#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:53,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:53,259 INFO L273 TraceCheckUtils]: 34: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:53,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:53,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {2913#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:53,261 INFO L273 TraceCheckUtils]: 37: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:53,261 INFO L273 TraceCheckUtils]: 38: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:53,262 INFO L273 TraceCheckUtils]: 39: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:53,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {2914#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:53,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:53,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:53,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:53,266 INFO L273 TraceCheckUtils]: 44: Hoare triple {2915#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:53,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:53,267 INFO L273 TraceCheckUtils]: 46: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:53,268 INFO L273 TraceCheckUtils]: 47: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:53,268 INFO L273 TraceCheckUtils]: 48: Hoare triple {2916#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:53,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:53,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:53,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:53,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {2917#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:53,272 INFO L273 TraceCheckUtils]: 53: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:53,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:53,273 INFO L273 TraceCheckUtils]: 55: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:53,278 INFO L273 TraceCheckUtils]: 56: Hoare triple {2918#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:53,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:53,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:53,280 INFO L273 TraceCheckUtils]: 59: Hoare triple {2919#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2905#false} is VALID [2018-11-19 00:11:53,280 INFO L273 TraceCheckUtils]: 60: Hoare triple {2905#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2905#false} is VALID [2018-11-19 00:11:53,280 INFO L273 TraceCheckUtils]: 61: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 62: Hoare triple {2905#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 63: Hoare triple {2905#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 64: Hoare triple {2905#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 66: Hoare triple {2905#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 67: Hoare triple {2905#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 68: Hoare triple {2905#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2905#false} is VALID [2018-11-19 00:11:53,281 INFO L273 TraceCheckUtils]: 69: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-19 00:11:53,282 INFO L273 TraceCheckUtils]: 70: Hoare triple {2905#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2905#false} is VALID [2018-11-19 00:11:53,282 INFO L256 TraceCheckUtils]: 71: Hoare triple {2905#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2905#false} is VALID [2018-11-19 00:11:53,282 INFO L273 TraceCheckUtils]: 72: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-19 00:11:53,282 INFO L273 TraceCheckUtils]: 73: Hoare triple {2905#false} assume 0 == ~cond; {2905#false} is VALID [2018-11-19 00:11:53,282 INFO L273 TraceCheckUtils]: 74: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-19 00:11:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 151 proven. 351 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-19 00:11:53,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:53,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 18 [2018-11-19 00:11:53,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-19 00:11:53,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:53,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-19 00:11:53,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:53,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-19 00:11:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-19 00:11:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:11:53,409 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 18 states. [2018-11-19 00:11:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:55,277 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-11-19 00:11:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-19 00:11:55,278 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 75 [2018-11-19 00:11:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:11:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:11:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 92 transitions. [2018-11-19 00:11:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:11:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 92 transitions. [2018-11-19 00:11:55,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 92 transitions. [2018-11-19 00:11:55,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:55,402 INFO L225 Difference]: With dead ends: 107 [2018-11-19 00:11:55,402 INFO L226 Difference]: Without dead ends: 90 [2018-11-19 00:11:55,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:11:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-19 00:11:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-19 00:11:55,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:11:55,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-19 00:11:55,458 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-19 00:11:55,458 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-19 00:11:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:55,461 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-19 00:11:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-19 00:11:55,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:55,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:55,462 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-19 00:11:55,462 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-19 00:11:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:11:55,464 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-19 00:11:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-19 00:11:55,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:11:55,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:11:55,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:11:55,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:11:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-19 00:11:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-19 00:11:55,467 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 75 [2018-11-19 00:11:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:11:55,467 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-19 00:11:55,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-19 00:11:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-19 00:11:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-19 00:11:55,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:11:55,468 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:11:55,469 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:11:55,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:11:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1599135933, now seen corresponding path program 9 times [2018-11-19 00:11:55,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:11:55,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:11:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:55,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:11:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:11:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:56,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {3579#true} call ULTIMATE.init(); {3579#true} is VALID [2018-11-19 00:11:56,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {3579#true} assume true; {3579#true} is VALID [2018-11-19 00:11:56,199 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3579#true} {3579#true} #39#return; {3579#true} is VALID [2018-11-19 00:11:56,200 INFO L256 TraceCheckUtils]: 3: Hoare triple {3579#true} call #t~ret2 := main(); {3579#true} is VALID [2018-11-19 00:11:56,202 INFO L273 TraceCheckUtils]: 4: Hoare triple {3579#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:56,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:56,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:56,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:11:56,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {3581#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:56,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:56,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:56,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:11:56,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {3582#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:56,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:56,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:56,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:11:56,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {3583#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:56,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:56,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:56,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:11:56,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {3584#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:56,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:56,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:56,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:11:56,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {3585#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:56,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:56,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:56,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:11:56,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {3586#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:56,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:56,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:56,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:11:56,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {3587#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:56,225 INFO L273 TraceCheckUtils]: 33: Hoare triple {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:56,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:56,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:11:56,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {3588#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:56,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:56,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:56,229 INFO L273 TraceCheckUtils]: 39: Hoare triple {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:11:56,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {3589#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:56,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:56,232 INFO L273 TraceCheckUtils]: 42: Hoare triple {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:56,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:11:56,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {3590#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:56,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:56,237 INFO L273 TraceCheckUtils]: 46: Hoare triple {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:56,237 INFO L273 TraceCheckUtils]: 47: Hoare triple {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:11:56,238 INFO L273 TraceCheckUtils]: 48: Hoare triple {3591#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:56,238 INFO L273 TraceCheckUtils]: 49: Hoare triple {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:56,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:56,243 INFO L273 TraceCheckUtils]: 51: Hoare triple {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:11:56,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {3592#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:56,244 INFO L273 TraceCheckUtils]: 53: Hoare triple {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:56,244 INFO L273 TraceCheckUtils]: 54: Hoare triple {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:56,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:11:56,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {3593#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:56,246 INFO L273 TraceCheckUtils]: 57: Hoare triple {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:56,246 INFO L273 TraceCheckUtils]: 58: Hoare triple {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:56,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:11:56,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {3594#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:56,248 INFO L273 TraceCheckUtils]: 61: Hoare triple {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:56,249 INFO L273 TraceCheckUtils]: 62: Hoare triple {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:56,249 INFO L273 TraceCheckUtils]: 63: Hoare triple {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:11:56,250 INFO L273 TraceCheckUtils]: 64: Hoare triple {3595#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:56,251 INFO L273 TraceCheckUtils]: 65: Hoare triple {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:56,251 INFO L273 TraceCheckUtils]: 66: Hoare triple {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:56,252 INFO L273 TraceCheckUtils]: 67: Hoare triple {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:11:56,253 INFO L273 TraceCheckUtils]: 68: Hoare triple {3596#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:11:56,267 INFO L273 TraceCheckUtils]: 69: Hoare triple {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:11:56,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:11:56,292 INFO L273 TraceCheckUtils]: 71: Hoare triple {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:11:56,305 INFO L273 TraceCheckUtils]: 72: Hoare triple {3597#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:11:56,317 INFO L273 TraceCheckUtils]: 73: Hoare triple {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:11:56,327 INFO L273 TraceCheckUtils]: 74: Hoare triple {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:11:56,327 INFO L273 TraceCheckUtils]: 75: Hoare triple {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:11:56,329 INFO L273 TraceCheckUtils]: 76: Hoare triple {3598#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:56,340 INFO L273 TraceCheckUtils]: 77: Hoare triple {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:56,353 INFO L273 TraceCheckUtils]: 78: Hoare triple {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:11:56,364 INFO L273 TraceCheckUtils]: 79: Hoare triple {3599#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3580#false} is VALID [2018-11-19 00:11:56,364 INFO L273 TraceCheckUtils]: 80: Hoare triple {3580#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3580#false} is VALID [2018-11-19 00:11:56,364 INFO L273 TraceCheckUtils]: 81: Hoare triple {3580#false} assume true; {3580#false} is VALID [2018-11-19 00:11:56,364 INFO L273 TraceCheckUtils]: 82: Hoare triple {3580#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3580#false} is VALID [2018-11-19 00:11:56,364 INFO L256 TraceCheckUtils]: 83: Hoare triple {3580#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {3580#false} is VALID [2018-11-19 00:11:56,365 INFO L273 TraceCheckUtils]: 84: Hoare triple {3580#false} ~cond := #in~cond; {3580#false} is VALID [2018-11-19 00:11:56,365 INFO L273 TraceCheckUtils]: 85: Hoare triple {3580#false} assume 0 == ~cond; {3580#false} is VALID [2018-11-19 00:11:56,365 INFO L273 TraceCheckUtils]: 86: Hoare triple {3580#false} assume !false; {3580#false} is VALID [2018-11-19 00:11:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 56 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:11:56,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:11:56,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:11:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:11:56,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-19 00:11:56,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:11:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:11:56,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:11:56,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {3579#true} call ULTIMATE.init(); {3579#true} is VALID [2018-11-19 00:11:56,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {3579#true} assume true; {3579#true} is VALID [2018-11-19 00:11:56,669 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3579#true} {3579#true} #39#return; {3579#true} is VALID [2018-11-19 00:11:56,669 INFO L256 TraceCheckUtils]: 3: Hoare triple {3579#true} call #t~ret2 := main(); {3579#true} is VALID [2018-11-19 00:11:56,669 INFO L273 TraceCheckUtils]: 4: Hoare triple {3579#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,685 INFO L273 TraceCheckUtils]: 23: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,690 INFO L273 TraceCheckUtils]: 32: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,690 INFO L273 TraceCheckUtils]: 33: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,691 INFO L273 TraceCheckUtils]: 34: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,692 INFO L273 TraceCheckUtils]: 37: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,698 INFO L273 TraceCheckUtils]: 47: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,699 INFO L273 TraceCheckUtils]: 49: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,700 INFO L273 TraceCheckUtils]: 51: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,701 INFO L273 TraceCheckUtils]: 53: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,702 INFO L273 TraceCheckUtils]: 55: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,702 INFO L273 TraceCheckUtils]: 56: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,703 INFO L273 TraceCheckUtils]: 58: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,705 INFO L273 TraceCheckUtils]: 62: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,706 INFO L273 TraceCheckUtils]: 63: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,707 INFO L273 TraceCheckUtils]: 65: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,707 INFO L273 TraceCheckUtils]: 66: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {3615#(= main_~z~0 5000000)} assume !(~x~0 % 4294967296 >= 5000000); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {3615#(= main_~z~0 5000000)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,709 INFO L273 TraceCheckUtils]: 69: Hoare triple {3615#(= main_~z~0 5000000)} assume true; {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,709 INFO L273 TraceCheckUtils]: 70: Hoare triple {3615#(= main_~z~0 5000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3615#(= main_~z~0 5000000)} is VALID [2018-11-19 00:11:56,710 INFO L273 TraceCheckUtils]: 71: Hoare triple {3615#(= main_~z~0 5000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3817#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:56,711 INFO L273 TraceCheckUtils]: 72: Hoare triple {3817#(= main_~z~0 4999999)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3817#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:56,711 INFO L273 TraceCheckUtils]: 73: Hoare triple {3817#(= main_~z~0 4999999)} assume true; {3817#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:56,712 INFO L273 TraceCheckUtils]: 74: Hoare triple {3817#(= main_~z~0 4999999)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3817#(= main_~z~0 4999999)} is VALID [2018-11-19 00:11:56,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {3817#(= main_~z~0 4999999)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3830#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:56,713 INFO L273 TraceCheckUtils]: 76: Hoare triple {3830#(= main_~z~0 4999998)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3830#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:56,714 INFO L273 TraceCheckUtils]: 77: Hoare triple {3830#(= main_~z~0 4999998)} assume true; {3830#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:56,714 INFO L273 TraceCheckUtils]: 78: Hoare triple {3830#(= main_~z~0 4999998)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3830#(= main_~z~0 4999998)} is VALID [2018-11-19 00:11:56,715 INFO L273 TraceCheckUtils]: 79: Hoare triple {3830#(= main_~z~0 4999998)} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {3843#(= main_~z~0 4999997)} is VALID [2018-11-19 00:11:56,716 INFO L273 TraceCheckUtils]: 80: Hoare triple {3843#(= main_~z~0 4999997)} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3843#(= main_~z~0 4999997)} is VALID [2018-11-19 00:11:56,716 INFO L273 TraceCheckUtils]: 81: Hoare triple {3843#(= main_~z~0 4999997)} assume true; {3843#(= main_~z~0 4999997)} is VALID [2018-11-19 00:11:56,717 INFO L273 TraceCheckUtils]: 82: Hoare triple {3843#(= main_~z~0 4999997)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3843#(= main_~z~0 4999997)} is VALID [2018-11-19 00:11:56,717 INFO L256 TraceCheckUtils]: 83: Hoare triple {3843#(= main_~z~0 4999997)} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {3856#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:11:56,718 INFO L273 TraceCheckUtils]: 84: Hoare triple {3856#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3860#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:11:56,719 INFO L273 TraceCheckUtils]: 85: Hoare triple {3860#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3580#false} is VALID [2018-11-19 00:11:56,719 INFO L273 TraceCheckUtils]: 86: Hoare triple {3580#false} assume !false; {3580#false} is VALID [2018-11-19 00:11:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-19 00:11:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:11:56,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8] total 27 [2018-11-19 00:11:56,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-11-19 00:11:56,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:11:56,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-19 00:11:56,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:11:56,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-19 00:11:56,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-19 00:11:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-11-19 00:11:56,867 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 27 states. [2018-11-19 00:12:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:02,401 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-11-19 00:12:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-19 00:12:02,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-11-19 00:12:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:12:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-19 00:12:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 128 transitions. [2018-11-19 00:12:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-19 00:12:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 128 transitions. [2018-11-19 00:12:02,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 128 transitions. [2018-11-19 00:12:02,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:12:02,559 INFO L225 Difference]: With dead ends: 126 [2018-11-19 00:12:02,559 INFO L226 Difference]: Without dead ends: 106 [2018-11-19 00:12:02,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=1977, Unknown=0, NotChecked=0, Total=2162 [2018-11-19 00:12:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-19 00:12:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-19 00:12:02,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:12:02,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-19 00:12:02,639 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-19 00:12:02,639 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-19 00:12:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:02,642 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-19 00:12:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-19 00:12:02,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:12:02,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:12:02,643 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-19 00:12:02,643 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-19 00:12:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:02,645 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2018-11-19 00:12:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-11-19 00:12:02,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:12:02,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:12:02,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:12:02,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:12:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-19 00:12:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-11-19 00:12:02,649 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 87 [2018-11-19 00:12:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:12:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-11-19 00:12:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-19 00:12:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-19 00:12:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-19 00:12:02,650 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:12:02,650 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 19, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:12:02,651 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:12:02,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:12:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 663006111, now seen corresponding path program 10 times [2018-11-19 00:12:02,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:12:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:12:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:12:02,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:12:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:12:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:12:04,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {4416#true} call ULTIMATE.init(); {4416#true} is VALID [2018-11-19 00:12:04,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {4416#true} assume true; {4416#true} is VALID [2018-11-19 00:12:04,759 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4416#true} {4416#true} #39#return; {4416#true} is VALID [2018-11-19 00:12:04,759 INFO L256 TraceCheckUtils]: 3: Hoare triple {4416#true} call #t~ret2 := main(); {4416#true} is VALID [2018-11-19 00:12:04,760 INFO L273 TraceCheckUtils]: 4: Hoare triple {4416#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:04,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:04,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:04,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:04,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:04,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:04,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:04,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:04,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:04,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:04,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:04,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:04,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:04,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:04,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:04,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:04,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:04,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:04,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:04,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:04,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:04,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:04,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:04,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:04,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:04,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:04,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:04,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:04,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:04,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:04,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:04,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:04,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:04,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:04,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:04,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:04,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:04,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:04,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:04,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:04,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:04,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:04,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:04,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:04,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:04,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:04,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:04,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:04,794 INFO L273 TraceCheckUtils]: 52: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:04,794 INFO L273 TraceCheckUtils]: 53: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:04,795 INFO L273 TraceCheckUtils]: 54: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:04,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:04,797 INFO L273 TraceCheckUtils]: 56: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:04,797 INFO L273 TraceCheckUtils]: 57: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:04,798 INFO L273 TraceCheckUtils]: 58: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:04,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:04,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:04,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:04,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:04,801 INFO L273 TraceCheckUtils]: 63: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:04,802 INFO L273 TraceCheckUtils]: 64: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:04,803 INFO L273 TraceCheckUtils]: 65: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:04,803 INFO L273 TraceCheckUtils]: 66: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:04,804 INFO L273 TraceCheckUtils]: 67: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:04,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:04,806 INFO L273 TraceCheckUtils]: 69: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:04,806 INFO L273 TraceCheckUtils]: 70: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:04,807 INFO L273 TraceCheckUtils]: 71: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:04,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:04,808 INFO L273 TraceCheckUtils]: 73: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:04,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:04,810 INFO L273 TraceCheckUtils]: 75: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:04,811 INFO L273 TraceCheckUtils]: 76: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:04,811 INFO L273 TraceCheckUtils]: 77: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:04,812 INFO L273 TraceCheckUtils]: 78: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:04,813 INFO L273 TraceCheckUtils]: 79: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:04,813 INFO L273 TraceCheckUtils]: 80: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:04,814 INFO L273 TraceCheckUtils]: 81: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:04,815 INFO L273 TraceCheckUtils]: 82: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:04,816 INFO L273 TraceCheckUtils]: 83: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:04,816 INFO L273 TraceCheckUtils]: 84: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:04,817 INFO L273 TraceCheckUtils]: 85: Hoare triple {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:04,818 INFO L273 TraceCheckUtils]: 86: Hoare triple {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:04,818 INFO L273 TraceCheckUtils]: 87: Hoare triple {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:04,819 INFO L273 TraceCheckUtils]: 88: Hoare triple {4438#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:04,820 INFO L273 TraceCheckUtils]: 89: Hoare triple {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume true; {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:04,821 INFO L273 TraceCheckUtils]: 90: Hoare triple {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:04,821 INFO L273 TraceCheckUtils]: 91: Hoare triple {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:04,822 INFO L273 TraceCheckUtils]: 92: Hoare triple {4439#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:04,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:04,824 INFO L273 TraceCheckUtils]: 94: Hoare triple {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:04,825 INFO L273 TraceCheckUtils]: 95: Hoare triple {4440#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4417#false} is VALID [2018-11-19 00:12:04,825 INFO L273 TraceCheckUtils]: 96: Hoare triple {4417#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4417#false} is VALID [2018-11-19 00:12:04,825 INFO L273 TraceCheckUtils]: 97: Hoare triple {4417#false} assume true; {4417#false} is VALID [2018-11-19 00:12:04,825 INFO L273 TraceCheckUtils]: 98: Hoare triple {4417#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4417#false} is VALID [2018-11-19 00:12:04,825 INFO L256 TraceCheckUtils]: 99: Hoare triple {4417#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {4417#false} is VALID [2018-11-19 00:12:04,826 INFO L273 TraceCheckUtils]: 100: Hoare triple {4417#false} ~cond := #in~cond; {4417#false} is VALID [2018-11-19 00:12:04,826 INFO L273 TraceCheckUtils]: 101: Hoare triple {4417#false} assume 0 == ~cond; {4417#false} is VALID [2018-11-19 00:12:04,826 INFO L273 TraceCheckUtils]: 102: Hoare triple {4417#false} assume !false; {4417#false} is VALID [2018-11-19 00:12:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 68 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:12:04,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:12:04,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:12:04,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:12:04,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:12:04,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:12:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:12:04,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:12:05,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {4416#true} call ULTIMATE.init(); {4416#true} is VALID [2018-11-19 00:12:05,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {4416#true} assume true; {4416#true} is VALID [2018-11-19 00:12:05,183 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4416#true} {4416#true} #39#return; {4416#true} is VALID [2018-11-19 00:12:05,183 INFO L256 TraceCheckUtils]: 3: Hoare triple {4416#true} call #t~ret2 := main(); {4416#true} is VALID [2018-11-19 00:12:05,184 INFO L273 TraceCheckUtils]: 4: Hoare triple {4416#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:05,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:05,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:05,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:05,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {4418#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:05,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:05,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:05,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:05,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {4419#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:05,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:05,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:05,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:05,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {4420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:05,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:05,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:05,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:05,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {4421#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:05,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:05,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:05,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:05,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {4422#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:05,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:05,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:05,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:05,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {4423#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:05,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:05,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:05,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:05,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {4424#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:05,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:05,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:05,204 INFO L273 TraceCheckUtils]: 35: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:05,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {4425#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:05,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:05,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:05,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:05,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {4426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:05,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:05,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:05,210 INFO L273 TraceCheckUtils]: 43: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:05,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {4427#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:05,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:05,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:05,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:05,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {4428#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:05,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:05,215 INFO L273 TraceCheckUtils]: 50: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:05,216 INFO L273 TraceCheckUtils]: 51: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:05,217 INFO L273 TraceCheckUtils]: 52: Hoare triple {4429#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:05,217 INFO L273 TraceCheckUtils]: 53: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:05,218 INFO L273 TraceCheckUtils]: 54: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:05,219 INFO L273 TraceCheckUtils]: 55: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:05,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {4430#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:05,220 INFO L273 TraceCheckUtils]: 57: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:05,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:05,221 INFO L273 TraceCheckUtils]: 59: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:05,222 INFO L273 TraceCheckUtils]: 60: Hoare triple {4431#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:05,223 INFO L273 TraceCheckUtils]: 61: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:05,223 INFO L273 TraceCheckUtils]: 62: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:05,224 INFO L273 TraceCheckUtils]: 63: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:05,225 INFO L273 TraceCheckUtils]: 64: Hoare triple {4432#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:05,226 INFO L273 TraceCheckUtils]: 65: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:05,226 INFO L273 TraceCheckUtils]: 66: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:05,227 INFO L273 TraceCheckUtils]: 67: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:05,228 INFO L273 TraceCheckUtils]: 68: Hoare triple {4433#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:05,228 INFO L273 TraceCheckUtils]: 69: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:05,229 INFO L273 TraceCheckUtils]: 70: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:05,230 INFO L273 TraceCheckUtils]: 71: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:05,231 INFO L273 TraceCheckUtils]: 72: Hoare triple {4434#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:05,231 INFO L273 TraceCheckUtils]: 73: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:05,232 INFO L273 TraceCheckUtils]: 74: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:05,233 INFO L273 TraceCheckUtils]: 75: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:05,233 INFO L273 TraceCheckUtils]: 76: Hoare triple {4435#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:05,234 INFO L273 TraceCheckUtils]: 77: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:05,235 INFO L273 TraceCheckUtils]: 78: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:05,235 INFO L273 TraceCheckUtils]: 79: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:05,236 INFO L273 TraceCheckUtils]: 80: Hoare triple {4436#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:05,237 INFO L273 TraceCheckUtils]: 81: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:05,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:05,239 INFO L273 TraceCheckUtils]: 83: Hoare triple {4437#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4417#false} is VALID [2018-11-19 00:12:05,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {4417#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4417#false} is VALID [2018-11-19 00:12:05,239 INFO L273 TraceCheckUtils]: 85: Hoare triple {4417#false} assume true; {4417#false} is VALID [2018-11-19 00:12:05,239 INFO L273 TraceCheckUtils]: 86: Hoare triple {4417#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4417#false} is VALID [2018-11-19 00:12:05,239 INFO L273 TraceCheckUtils]: 87: Hoare triple {4417#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4417#false} is VALID [2018-11-19 00:12:05,240 INFO L273 TraceCheckUtils]: 88: Hoare triple {4417#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4417#false} is VALID [2018-11-19 00:12:05,240 INFO L273 TraceCheckUtils]: 89: Hoare triple {4417#false} assume true; {4417#false} is VALID [2018-11-19 00:12:05,240 INFO L273 TraceCheckUtils]: 90: Hoare triple {4417#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4417#false} is VALID [2018-11-19 00:12:05,240 INFO L273 TraceCheckUtils]: 91: Hoare triple {4417#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4417#false} is VALID [2018-11-19 00:12:05,240 INFO L273 TraceCheckUtils]: 92: Hoare triple {4417#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 93: Hoare triple {4417#false} assume true; {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 94: Hoare triple {4417#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 95: Hoare triple {4417#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 96: Hoare triple {4417#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 97: Hoare triple {4417#false} assume true; {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L273 TraceCheckUtils]: 98: Hoare triple {4417#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4417#false} is VALID [2018-11-19 00:12:05,241 INFO L256 TraceCheckUtils]: 99: Hoare triple {4417#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {4417#false} is VALID [2018-11-19 00:12:05,242 INFO L273 TraceCheckUtils]: 100: Hoare triple {4417#false} ~cond := #in~cond; {4417#false} is VALID [2018-11-19 00:12:05,242 INFO L273 TraceCheckUtils]: 101: Hoare triple {4417#false} assume 0 == ~cond; {4417#false} is VALID [2018-11-19 00:12:05,242 INFO L273 TraceCheckUtils]: 102: Hoare triple {4417#false} assume !false; {4417#false} is VALID [2018-11-19 00:12:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 296 proven. 741 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-19 00:12:05,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:12:05,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 25 [2018-11-19 00:12:05,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 103 [2018-11-19 00:12:05,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:12:05,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-19 00:12:05,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:12:05,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-19 00:12:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-19 00:12:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:12:05,387 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 25 states. [2018-11-19 00:12:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:09,951 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-11-19 00:12:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-19 00:12:09,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 103 [2018-11-19 00:12:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:12:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:12:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 121 transitions. [2018-11-19 00:12:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:12:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 121 transitions. [2018-11-19 00:12:09,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 121 transitions. [2018-11-19 00:12:10,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:12:10,177 INFO L225 Difference]: With dead ends: 143 [2018-11-19 00:12:10,177 INFO L226 Difference]: Without dead ends: 122 [2018-11-19 00:12:10,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:12:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-19 00:12:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-11-19 00:12:10,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:12:10,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 121 states. [2018-11-19 00:12:10,253 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 121 states. [2018-11-19 00:12:10,253 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 121 states. [2018-11-19 00:12:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:10,256 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-19 00:12:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-19 00:12:10,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:12:10,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:12:10,257 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 122 states. [2018-11-19 00:12:10,257 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 122 states. [2018-11-19 00:12:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:12:10,260 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-19 00:12:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-19 00:12:10,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:12:10,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:12:10,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:12:10,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:12:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-19 00:12:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-11-19 00:12:10,263 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 103 [2018-11-19 00:12:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:12:10,264 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-11-19 00:12:10,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-19 00:12:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-11-19 00:12:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-19 00:12:10,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:12:10,265 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 23, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:12:10,265 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:12:10,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:12:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1364779839, now seen corresponding path program 11 times [2018-11-19 00:12:10,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:12:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:12:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:12:10,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:12:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:12:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:12:11,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {5331#true} call ULTIMATE.init(); {5331#true} is VALID [2018-11-19 00:12:11,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {5331#true} assume true; {5331#true} is VALID [2018-11-19 00:12:11,779 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5331#true} {5331#true} #39#return; {5331#true} is VALID [2018-11-19 00:12:11,779 INFO L256 TraceCheckUtils]: 3: Hoare triple {5331#true} call #t~ret2 := main(); {5331#true} is VALID [2018-11-19 00:12:11,780 INFO L273 TraceCheckUtils]: 4: Hoare triple {5331#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:11,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:11,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:11,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:12:11,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {5333#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:11,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:11,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:11,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:12:11,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {5334#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:11,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:11,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:11,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:12:11,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {5335#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:11,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:11,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:11,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:12:11,805 INFO L273 TraceCheckUtils]: 20: Hoare triple {5336#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:11,806 INFO L273 TraceCheckUtils]: 21: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:11,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:11,806 INFO L273 TraceCheckUtils]: 23: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:12:11,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:11,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:11,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:11,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:12:11,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {5338#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:11,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:11,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:11,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:12:11,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {5339#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:11,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:11,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:11,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:12:11,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {5340#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:11,816 INFO L273 TraceCheckUtils]: 37: Hoare triple {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:11,817 INFO L273 TraceCheckUtils]: 38: Hoare triple {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:11,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:12:11,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {5341#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:11,819 INFO L273 TraceCheckUtils]: 41: Hoare triple {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:11,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:11,820 INFO L273 TraceCheckUtils]: 43: Hoare triple {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:12:11,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {5342#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:11,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:11,822 INFO L273 TraceCheckUtils]: 46: Hoare triple {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:11,823 INFO L273 TraceCheckUtils]: 47: Hoare triple {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:12:11,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {5343#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:11,824 INFO L273 TraceCheckUtils]: 49: Hoare triple {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:11,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:11,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:12:11,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {5344#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:11,827 INFO L273 TraceCheckUtils]: 53: Hoare triple {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:11,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:11,828 INFO L273 TraceCheckUtils]: 55: Hoare triple {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:12:11,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {5345#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:11,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:11,831 INFO L273 TraceCheckUtils]: 58: Hoare triple {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:11,831 INFO L273 TraceCheckUtils]: 59: Hoare triple {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:12:11,832 INFO L273 TraceCheckUtils]: 60: Hoare triple {5346#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:11,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:11,833 INFO L273 TraceCheckUtils]: 62: Hoare triple {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:11,834 INFO L273 TraceCheckUtils]: 63: Hoare triple {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:12:11,835 INFO L273 TraceCheckUtils]: 64: Hoare triple {5347#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:11,835 INFO L273 TraceCheckUtils]: 65: Hoare triple {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:11,836 INFO L273 TraceCheckUtils]: 66: Hoare triple {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:11,837 INFO L273 TraceCheckUtils]: 67: Hoare triple {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:12:11,838 INFO L273 TraceCheckUtils]: 68: Hoare triple {5348#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:11,838 INFO L273 TraceCheckUtils]: 69: Hoare triple {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:11,839 INFO L273 TraceCheckUtils]: 70: Hoare triple {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:11,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:12:11,840 INFO L273 TraceCheckUtils]: 72: Hoare triple {5349#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:11,841 INFO L273 TraceCheckUtils]: 73: Hoare triple {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:11,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:11,842 INFO L273 TraceCheckUtils]: 75: Hoare triple {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:12:11,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {5350#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:11,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:11,845 INFO L273 TraceCheckUtils]: 78: Hoare triple {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:11,845 INFO L273 TraceCheckUtils]: 79: Hoare triple {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:12:11,846 INFO L273 TraceCheckUtils]: 80: Hoare triple {5351#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:11,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:11,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:11,848 INFO L273 TraceCheckUtils]: 83: Hoare triple {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:12:11,849 INFO L273 TraceCheckUtils]: 84: Hoare triple {5352#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:11,850 INFO L273 TraceCheckUtils]: 85: Hoare triple {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:11,850 INFO L273 TraceCheckUtils]: 86: Hoare triple {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:11,851 INFO L273 TraceCheckUtils]: 87: Hoare triple {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 5000000); {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:12:11,852 INFO L273 TraceCheckUtils]: 88: Hoare triple {5353#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:11,852 INFO L273 TraceCheckUtils]: 89: Hoare triple {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume true; {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:11,853 INFO L273 TraceCheckUtils]: 90: Hoare triple {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:11,854 INFO L273 TraceCheckUtils]: 91: Hoare triple {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:12:11,855 INFO L273 TraceCheckUtils]: 92: Hoare triple {5354#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:12:11,855 INFO L273 TraceCheckUtils]: 93: Hoare triple {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:12:11,856 INFO L273 TraceCheckUtils]: 94: Hoare triple {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:12:11,857 INFO L273 TraceCheckUtils]: 95: Hoare triple {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:12:11,857 INFO L273 TraceCheckUtils]: 96: Hoare triple {5355#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-19 00:12:11,858 INFO L273 TraceCheckUtils]: 97: Hoare triple {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume true; {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-19 00:12:11,859 INFO L273 TraceCheckUtils]: 98: Hoare triple {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-19 00:12:11,859 INFO L273 TraceCheckUtils]: 99: Hoare triple {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-19 00:12:11,860 INFO L273 TraceCheckUtils]: 100: Hoare triple {5356#(and (<= main_~x~0 23) (<= 23 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:12:11,861 INFO L273 TraceCheckUtils]: 101: Hoare triple {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:12:11,862 INFO L273 TraceCheckUtils]: 102: Hoare triple {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:12:11,862 INFO L273 TraceCheckUtils]: 103: Hoare triple {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:12:11,863 INFO L273 TraceCheckUtils]: 104: Hoare triple {5357#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-19 00:12:11,864 INFO L273 TraceCheckUtils]: 105: Hoare triple {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} assume true; {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-19 00:12:11,865 INFO L273 TraceCheckUtils]: 106: Hoare triple {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-19 00:12:11,865 INFO L273 TraceCheckUtils]: 107: Hoare triple {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-19 00:12:11,866 INFO L273 TraceCheckUtils]: 108: Hoare triple {5358#(and (<= 25 main_~x~0) (<= main_~x~0 25))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:11,867 INFO L273 TraceCheckUtils]: 109: Hoare triple {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:11,868 INFO L273 TraceCheckUtils]: 110: Hoare triple {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:12:11,869 INFO L273 TraceCheckUtils]: 111: Hoare triple {5359#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := #t~post0 - 1;havoc #t~post0; {5332#false} is VALID [2018-11-19 00:12:11,869 INFO L273 TraceCheckUtils]: 112: Hoare triple {5332#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5332#false} is VALID [2018-11-19 00:12:11,869 INFO L273 TraceCheckUtils]: 113: Hoare triple {5332#false} assume true; {5332#false} is VALID [2018-11-19 00:12:11,869 INFO L273 TraceCheckUtils]: 114: Hoare triple {5332#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {5332#false} is VALID [2018-11-19 00:12:11,870 INFO L256 TraceCheckUtils]: 115: Hoare triple {5332#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {5332#false} is VALID [2018-11-19 00:12:11,870 INFO L273 TraceCheckUtils]: 116: Hoare triple {5332#false} ~cond := #in~cond; {5332#false} is VALID [2018-11-19 00:12:11,870 INFO L273 TraceCheckUtils]: 117: Hoare triple {5332#false} assume 0 == ~cond; {5332#false} is VALID [2018-11-19 00:12:11,870 INFO L273 TraceCheckUtils]: 118: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2018-11-19 00:12:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 80 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:12:11,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:12:11,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:12:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1