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/loop-acceleration/diamond_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:59:11,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:59:11,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:59:11,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:59:11,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:59:11,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:59:11,622 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:59:11,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:59:11,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:59:11,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:59:11,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:59:11,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:59:11,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:59:11,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:59:11,639 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:59:11,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:59:11,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:59:11,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:59:11,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:59:11,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:59:11,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:59:11,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:59:11,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:59:11,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:59:11,663 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:59:11,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:59:11,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:59:11,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:59:11,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:59:11,668 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:59:11,668 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:59:11,669 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:59:11,669 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:59:11,669 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:59:11,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:59:11,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:59:11,671 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-18 23:59:11,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:59:11,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:59:11,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:59:11,686 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:59:11,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:59:11,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:59:11,687 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:59:11,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:59:11,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:59:11,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:59:11,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:59:11,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:59:11,688 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:59:11,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:59:11,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:59:11,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:59:11,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:59:11,689 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:59:11,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:59:11,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:59:11,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:59:11,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:59:11,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:59:11,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:59:11,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:59:11,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:59:11,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:59:11,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:59:11,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:59:11,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:59:11,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:59:11,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:59:11,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:59:11,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:59:11,763 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:59:11,763 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:59:11,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-18 23:59:11,822 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d15e144/5c81f23b79a24cd2ab2911bffb4097c7/FLAG029abd42b [2018-11-18 23:59:12,235 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:59:12,236 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-18 23:59:12,242 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d15e144/5c81f23b79a24cd2ab2911bffb4097c7/FLAG029abd42b [2018-11-18 23:59:12,671 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d15e144/5c81f23b79a24cd2ab2911bffb4097c7 [2018-11-18 23:59:12,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:59:12,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:59:12,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:59:12,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:59:12,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:59:12,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:12" (1/1) ... [2018-11-18 23:59:12,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4246c29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:12, skipping insertion in model container [2018-11-18 23:59:12,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:12" (1/1) ... [2018-11-18 23:59:12,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:59:12,727 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:59:12,965 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:59:12,971 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:59:12,998 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:59:13,014 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:59:13,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13 WrapperNode [2018-11-18 23:59:13,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:59:13,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:59:13,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:59:13,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:59:13,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (1/1) ... [2018-11-18 23:59:13,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:59:13,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:59:13,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:59:13,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:59:13,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (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-18 23:59:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:59:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:59:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:59:13,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:59:13,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:59:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:59:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:59:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:59:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:59:13,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:59:13,601 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:59:13,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:13 BoogieIcfgContainer [2018-11-18 23:59:13,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:59:13,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:59:13,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:59:13,606 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:59:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:59:12" (1/3) ... [2018-11-18 23:59:13,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1cfe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:13, skipping insertion in model container [2018-11-18 23:59:13,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:13" (2/3) ... [2018-11-18 23:59:13,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1cfe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:13, skipping insertion in model container [2018-11-18 23:59:13,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:13" (3/3) ... [2018-11-18 23:59:13,609 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i [2018-11-18 23:59:13,617 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:59:13,624 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:59:13,638 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:59:13,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:59:13,667 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:59:13,667 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:59:13,667 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:59:13,667 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:59:13,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:59:13,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:59:13,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:59:13,668 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:59:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 23:59:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 23:59:13,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:13,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:13,694 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:13,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1713253442, now seen corresponding path program 1 times [2018-11-18 23:59:13,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:13,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:13,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:13,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 23:59:13,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 23:59:13,847 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-18 23:59:13,847 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-18 23:59:13,847 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {22#true} is VALID [2018-11-18 23:59:13,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-18 23:59:13,852 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2018-11-18 23:59:13,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-18 23:59:13,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-18 23:59:13,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 23:59:13,855 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-18 23:59:13,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:59:13,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:59:13,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 23:59:13,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:13,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:59:13,940 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-18 23:59:13,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:59:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:59:13,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:59:13,951 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 23:59:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:14,079 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 23:59:14,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:59:14,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 23:59:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:59:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-18 23:59:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:59:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-18 23:59:14,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-18 23:59:14,328 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-18 23:59:14,340 INFO L225 Difference]: With dead ends: 30 [2018-11-18 23:59:14,341 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 23:59:14,345 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-18 23:59:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 23:59:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 23:59:14,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:14,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-18 23:59:14,422 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 23:59:14,422 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 23:59:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:14,427 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-18 23:59:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-18 23:59:14,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:14,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:14,431 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 23:59:14,431 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 23:59:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:14,436 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-18 23:59:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-18 23:59:14,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:14,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:14,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:14,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:59:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-18 23:59:14,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-18 23:59:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:14,445 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-18 23:59:14,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:59:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-18 23:59:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 23:59:14,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:14,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:14,447 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:14,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1144102878, now seen corresponding path program 1 times [2018-11-18 23:59:14,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:14,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:14,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-18 23:59:14,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-18 23:59:14,739 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #38#return; {111#true} is VALID [2018-11-18 23:59:14,739 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret2 := main(); {111#true} is VALID [2018-11-18 23:59:14,740 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:14,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:14,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {113#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {112#false} is VALID [2018-11-18 23:59:14,750 INFO L256 TraceCheckUtils]: 7: Hoare triple {112#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {112#false} is VALID [2018-11-18 23:59:14,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#false} ~cond := #in~cond; {112#false} is VALID [2018-11-18 23:59:14,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume 0 == ~cond; {112#false} is VALID [2018-11-18 23:59:14,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-18 23:59:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:14,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:59:14,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:59:14,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 23:59:14,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:14,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:59:14,790 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-18 23:59:14,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:59:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:59:14,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:59:14,791 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-18 23:59:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:14,971 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-18 23:59:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:59:14,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 23:59:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:59:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-18 23:59:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:59:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-18 23:59:14,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2018-11-18 23:59:15,061 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-18 23:59:15,065 INFO L225 Difference]: With dead ends: 21 [2018-11-18 23:59:15,065 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 23:59:15,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:59:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 23:59:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-18 23:59:15,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:15,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-18 23:59:15,133 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-18 23:59:15,133 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-18 23:59:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:15,135 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-18 23:59:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-18 23:59:15,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:15,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:15,136 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-18 23:59:15,136 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-18 23:59:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:15,139 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-18 23:59:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-18 23:59:15,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:15,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:15,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:15,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:59:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-18 23:59:15,142 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-18 23:59:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:15,142 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-18 23:59:15,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:59:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-18 23:59:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:59:15,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:15,143 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:15,144 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:15,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2056921797, now seen corresponding path program 1 times [2018-11-18 23:59:15,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:15,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:15,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:15,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2018-11-18 23:59:15,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {202#true} assume true; {202#true} is VALID [2018-11-18 23:59:15,408 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} #38#return; {202#true} is VALID [2018-11-18 23:59:15,409 INFO L256 TraceCheckUtils]: 3: Hoare triple {202#true} call #t~ret2 := main(); {202#true} is VALID [2018-11-18 23:59:15,410 INFO L273 TraceCheckUtils]: 4: Hoare triple {202#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {205#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:15,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {205#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {205#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:15,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {205#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {203#false} is VALID [2018-11-18 23:59:15,417 INFO L256 TraceCheckUtils]: 10: Hoare triple {203#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {203#false} is VALID [2018-11-18 23:59:15,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2018-11-18 23:59:15,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2018-11-18 23:59:15,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2018-11-18 23:59:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:15,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:15,420 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-18 23:59:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:15,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:15,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2018-11-18 23:59:15,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {202#true} assume true; {202#true} is VALID [2018-11-18 23:59:15,929 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {202#true} {202#true} #38#return; {202#true} is VALID [2018-11-18 23:59:15,929 INFO L256 TraceCheckUtils]: 3: Hoare triple {202#true} call #t~ret2 := main(); {202#true} is VALID [2018-11-18 23:59:15,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {202#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:15,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {204#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {230#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:15,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {230#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {230#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:16,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {230#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {203#false} is VALID [2018-11-18 23:59:16,001 INFO L256 TraceCheckUtils]: 10: Hoare triple {203#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {203#false} is VALID [2018-11-18 23:59:16,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID [2018-11-18 23:59:16,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID [2018-11-18 23:59:16,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2018-11-18 23:59:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:16,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:16,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 23:59:16,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 23:59:16,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:16,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:59:16,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:16,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:59:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:59:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:59:16,122 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-11-18 23:59:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:16,417 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-18 23:59:16,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:59:16,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 23:59:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:59:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-18 23:59:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:59:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-18 23:59:16,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-18 23:59:16,467 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-18 23:59:16,468 INFO L225 Difference]: With dead ends: 24 [2018-11-18 23:59:16,469 INFO L226 Difference]: Without dead ends: 19 [2018-11-18 23:59:16,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:59:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-18 23:59:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-18 23:59:16,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:16,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 18 states. [2018-11-18 23:59:16,501 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 18 states. [2018-11-18 23:59:16,501 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 18 states. [2018-11-18 23:59:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:16,503 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-18 23:59:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-18 23:59:16,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:16,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:16,504 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states. [2018-11-18 23:59:16,504 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states. [2018-11-18 23:59:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:16,506 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-18 23:59:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-18 23:59:16,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:16,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:16,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:16,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:59:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-18 23:59:16,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-18 23:59:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-18 23:59:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:59:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-18 23:59:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:59:16,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:16,511 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:16,511 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:16,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -281914435, now seen corresponding path program 1 times [2018-11-18 23:59:16,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:16,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:16,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:16,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-18 23:59:16,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-18 23:59:16,699 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2018-11-18 23:59:16,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret2 := main(); {348#true} is VALID [2018-11-18 23:59:16,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {351#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:16,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {351#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:16,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {351#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {349#false} is VALID [2018-11-18 23:59:16,708 INFO L256 TraceCheckUtils]: 10: Hoare triple {349#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {349#false} is VALID [2018-11-18 23:59:16,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2018-11-18 23:59:16,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2018-11-18 23:59:16,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-18 23:59:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:16,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:16,711 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-18 23:59:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:16,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:16,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2018-11-18 23:59:16,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2018-11-18 23:59:16,822 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #38#return; {348#true} is VALID [2018-11-18 23:59:16,822 INFO L256 TraceCheckUtils]: 3: Hoare triple {348#true} call #t~ret2 := main(); {348#true} is VALID [2018-11-18 23:59:16,833 INFO L273 TraceCheckUtils]: 4: Hoare triple {348#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:16,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:16,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:16,896 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {349#false} is VALID [2018-11-18 23:59:16,896 INFO L256 TraceCheckUtils]: 10: Hoare triple {349#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {349#false} is VALID [2018-11-18 23:59:16,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2018-11-18 23:59:16,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2018-11-18 23:59:16,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2018-11-18 23:59:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:16,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:16,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 23:59:16,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 23:59:16,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:16,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:59:16,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:16,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:59:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:59:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:59:16,948 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2018-11-18 23:59:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:17,243 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-18 23:59:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:59:17,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 23:59:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:59:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 23:59:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:59:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 23:59:17,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-18 23:59:17,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:17,327 INFO L225 Difference]: With dead ends: 27 [2018-11-18 23:59:17,328 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 23:59:17,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:59:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 23:59:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-18 23:59:17,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:17,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 18 states. [2018-11-18 23:59:17,343 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 18 states. [2018-11-18 23:59:17,343 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 18 states. [2018-11-18 23:59:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:17,345 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 23:59:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-18 23:59:17,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:17,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:17,346 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states. [2018-11-18 23:59:17,346 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states. [2018-11-18 23:59:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:17,348 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 23:59:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-18 23:59:17,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:17,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:17,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:17,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:59:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-18 23:59:17,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-18 23:59:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:17,352 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-18 23:59:17,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:59:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-18 23:59:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:59:17,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:17,353 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:17,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:17,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1670825662, now seen corresponding path program 2 times [2018-11-18 23:59:17,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:17,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:17,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:17,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2018-11-18 23:59:17,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-18 23:59:17,514 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {504#true} {504#true} #38#return; {504#true} is VALID [2018-11-18 23:59:17,515 INFO L256 TraceCheckUtils]: 3: Hoare triple {504#true} call #t~ret2 := main(); {504#true} is VALID [2018-11-18 23:59:17,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {504#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {508#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:17,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {508#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {508#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:17,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {505#false} is VALID [2018-11-18 23:59:17,531 INFO L256 TraceCheckUtils]: 13: Hoare triple {505#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {505#false} is VALID [2018-11-18 23:59:17,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {505#false} ~cond := #in~cond; {505#false} is VALID [2018-11-18 23:59:17,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {505#false} assume 0 == ~cond; {505#false} is VALID [2018-11-18 23:59:17,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {505#false} assume !false; {505#false} is VALID [2018-11-18 23:59:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:17,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:17,534 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-18 23:59:17,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:59:17,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:59:17,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:17,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:17,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2018-11-18 23:59:17,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-18 23:59:17,700 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {504#true} {504#true} #38#return; {504#true} is VALID [2018-11-18 23:59:17,701 INFO L256 TraceCheckUtils]: 3: Hoare triple {504#true} call #t~ret2 := main(); {504#true} is VALID [2018-11-18 23:59:17,701 INFO L273 TraceCheckUtils]: 4: Hoare triple {504#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:17,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:17,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:17,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:17,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {505#false} is VALID [2018-11-18 23:59:17,713 INFO L256 TraceCheckUtils]: 13: Hoare triple {505#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {505#false} is VALID [2018-11-18 23:59:17,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {505#false} ~cond := #in~cond; {505#false} is VALID [2018-11-18 23:59:17,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {505#false} assume 0 == ~cond; {505#false} is VALID [2018-11-18 23:59:17,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {505#false} assume !false; {505#false} is VALID [2018-11-18 23:59:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:17,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:17,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 23:59:17,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:17,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:17,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:59:17,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:17,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:59:17,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:59:17,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:17,822 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2018-11-18 23:59:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:18,020 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 23:59:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:59:18,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 23:59:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-18 23:59:18,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-18 23:59:18,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:18,075 INFO L225 Difference]: With dead ends: 29 [2018-11-18 23:59:18,075 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 23:59:18,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 23:59:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-11-18 23:59:18,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:18,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 21 states. [2018-11-18 23:59:18,094 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 21 states. [2018-11-18 23:59:18,094 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 21 states. [2018-11-18 23:59:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:18,096 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 23:59:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-18 23:59:18,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:18,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:18,097 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 24 states. [2018-11-18 23:59:18,098 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 24 states. [2018-11-18 23:59:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:18,100 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 23:59:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-18 23:59:18,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:18,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:18,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:18,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:59:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-18 23:59:18,103 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2018-11-18 23:59:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:18,103 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 23:59:18,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:59:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-18 23:59:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:59:18,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:18,104 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:18,104 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:18,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash -849134272, now seen corresponding path program 1 times [2018-11-18 23:59:18,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:18,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:18,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2018-11-18 23:59:18,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2018-11-18 23:59:18,372 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #38#return; {681#true} is VALID [2018-11-18 23:59:18,372 INFO L256 TraceCheckUtils]: 3: Hoare triple {681#true} call #t~ret2 := main(); {681#true} is VALID [2018-11-18 23:59:18,372 INFO L273 TraceCheckUtils]: 4: Hoare triple {681#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:18,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:18,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:18,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {683#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:18,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:18,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:18,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {684#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {685#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:18,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {685#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {685#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:18,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {685#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {682#false} is VALID [2018-11-18 23:59:18,394 INFO L256 TraceCheckUtils]: 13: Hoare triple {682#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {682#false} is VALID [2018-11-18 23:59:18,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2018-11-18 23:59:18,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2018-11-18 23:59:18,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2018-11-18 23:59:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:18,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:18,398 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-18 23:59:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:18,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:18,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2018-11-18 23:59:18,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2018-11-18 23:59:18,595 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #38#return; {681#true} is VALID [2018-11-18 23:59:18,596 INFO L256 TraceCheckUtils]: 3: Hoare triple {681#true} call #t~ret2 := main(); {681#true} is VALID [2018-11-18 23:59:18,596 INFO L273 TraceCheckUtils]: 4: Hoare triple {681#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {681#true} is VALID [2018-11-18 23:59:18,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {681#true} assume true; {681#true} is VALID [2018-11-18 23:59:18,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#true} assume !!(~x~0 % 4294967296 < 99); {681#true} is VALID [2018-11-18 23:59:18,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {681#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {710#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-18 23:59:18,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#(<= (mod main_~y~0 2) 0)} assume true; {710#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-18 23:59:18,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#(<= (mod main_~y~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {710#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-18 23:59:18,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {710#(<= (mod main_~y~0 2) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {682#false} is VALID [2018-11-18 23:59:18,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {682#false} assume true; {682#false} is VALID [2018-11-18 23:59:18,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {682#false} assume !(~x~0 % 4294967296 < 99); {682#false} is VALID [2018-11-18 23:59:18,603 INFO L256 TraceCheckUtils]: 13: Hoare triple {682#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {682#false} is VALID [2018-11-18 23:59:18,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2018-11-18 23:59:18,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2018-11-18 23:59:18,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2018-11-18 23:59:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:59:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 23:59:18,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:18,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:18,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:59:18,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:18,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:59:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:59:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:18,652 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2018-11-18 23:59:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:18,893 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-18 23:59:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:59:18,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-18 23:59:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-18 23:59:18,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2018-11-18 23:59:19,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:19,036 INFO L225 Difference]: With dead ends: 37 [2018-11-18 23:59:19,036 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 23:59:19,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:59:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 23:59:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-18 23:59:19,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:19,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2018-11-18 23:59:19,082 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2018-11-18 23:59:19,082 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2018-11-18 23:59:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:19,085 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 23:59:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-18 23:59:19,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:19,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:19,086 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2018-11-18 23:59:19,086 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2018-11-18 23:59:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:19,088 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-18 23:59:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-18 23:59:19,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:19,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:19,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:19,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 23:59:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 23:59:19,091 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-18 23:59:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 23:59:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:59:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 23:59:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:59:19,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:19,093 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:19,093 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:19,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1277798652, now seen corresponding path program 2 times [2018-11-18 23:59:19,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:19,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:19,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {892#true} call ULTIMATE.init(); {892#true} is VALID [2018-11-18 23:59:19,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {892#true} assume true; {892#true} is VALID [2018-11-18 23:59:19,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {892#true} {892#true} #38#return; {892#true} is VALID [2018-11-18 23:59:19,845 INFO L256 TraceCheckUtils]: 3: Hoare triple {892#true} call #t~ret2 := main(); {892#true} is VALID [2018-11-18 23:59:19,854 INFO L273 TraceCheckUtils]: 4: Hoare triple {892#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:19,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:19,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:19,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {894#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:19,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:19,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:19,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {896#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:19,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {896#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {896#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:19,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {896#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {893#false} is VALID [2018-11-18 23:59:19,889 INFO L256 TraceCheckUtils]: 13: Hoare triple {893#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {893#false} is VALID [2018-11-18 23:59:19,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {893#false} ~cond := #in~cond; {893#false} is VALID [2018-11-18 23:59:19,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {893#false} assume 0 == ~cond; {893#false} is VALID [2018-11-18 23:59:19,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#false} assume !false; {893#false} is VALID [2018-11-18 23:59:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:19,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:19,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 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-18 23:59:19,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:59:19,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:59:19,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:19,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:20,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {892#true} call ULTIMATE.init(); {892#true} is VALID [2018-11-18 23:59:20,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {892#true} assume true; {892#true} is VALID [2018-11-18 23:59:20,025 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {892#true} {892#true} #38#return; {892#true} is VALID [2018-11-18 23:59:20,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {892#true} call #t~ret2 := main(); {892#true} is VALID [2018-11-18 23:59:20,026 INFO L273 TraceCheckUtils]: 4: Hoare triple {892#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {892#true} is VALID [2018-11-18 23:59:20,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {892#true} assume true; {892#true} is VALID [2018-11-18 23:59:20,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {892#true} assume !!(~x~0 % 4294967296 < 99); {892#true} is VALID [2018-11-18 23:59:20,027 INFO L273 TraceCheckUtils]: 7: Hoare triple {892#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {921#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-18 23:59:20,028 INFO L273 TraceCheckUtils]: 8: Hoare triple {921#(not (= (mod main_~y~0 2) 0))} assume true; {921#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-18 23:59:20,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {921#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {921#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-18 23:59:20,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {921#(not (= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {893#false} is VALID [2018-11-18 23:59:20,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {893#false} assume true; {893#false} is VALID [2018-11-18 23:59:20,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {893#false} assume !(~x~0 % 4294967296 < 99); {893#false} is VALID [2018-11-18 23:59:20,030 INFO L256 TraceCheckUtils]: 13: Hoare triple {893#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {893#false} is VALID [2018-11-18 23:59:20,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {893#false} ~cond := #in~cond; {893#false} is VALID [2018-11-18 23:59:20,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {893#false} assume 0 == ~cond; {893#false} is VALID [2018-11-18 23:59:20,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#false} assume !false; {893#false} is VALID [2018-11-18 23:59:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:59:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 23:59:20,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:20,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:20,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:59:20,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:20,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:59:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:59:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:20,083 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-11-18 23:59:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:20,233 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 23:59:20,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:59:20,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-11-18 23:59:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2018-11-18 23:59:20,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2018-11-18 23:59:20,285 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-18 23:59:20,287 INFO L225 Difference]: With dead ends: 36 [2018-11-18 23:59:20,288 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 23:59:20,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:59:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 23:59:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-18 23:59:20,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:20,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-18 23:59:20,329 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-18 23:59:20,330 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-18 23:59:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:20,331 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 23:59:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 23:59:20,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:20,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:20,333 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-18 23:59:20,333 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-18 23:59:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:20,335 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-18 23:59:20,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-18 23:59:20,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:20,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:20,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:20,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 23:59:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 23:59:20,338 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2018-11-18 23:59:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:20,338 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 23:59:20,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:59:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 23:59:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:59:20,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:20,339 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:20,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:20,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1242161282, now seen corresponding path program 2 times [2018-11-18 23:59:20,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:20,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:20,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-18 23:59:20,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-18 23:59:20,619 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1097#true} {1097#true} #38#return; {1097#true} is VALID [2018-11-18 23:59:20,620 INFO L256 TraceCheckUtils]: 3: Hoare triple {1097#true} call #t~ret2 := main(); {1097#true} is VALID [2018-11-18 23:59:20,620 INFO L273 TraceCheckUtils]: 4: Hoare triple {1097#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1101#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:20,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1101#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:20,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {1101#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1098#false} is VALID [2018-11-18 23:59:20,641 INFO L256 TraceCheckUtils]: 13: Hoare triple {1098#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1098#false} is VALID [2018-11-18 23:59:20,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-18 23:59:20,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-18 23:59:20,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-18 23:59:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:20,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:20,644 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-18 23:59:20,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:59:20,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:59:20,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:20,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:20,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-18 23:59:20,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-18 23:59:20,778 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1097#true} {1097#true} #38#return; {1097#true} is VALID [2018-11-18 23:59:20,778 INFO L256 TraceCheckUtils]: 3: Hoare triple {1097#true} call #t~ret2 := main(); {1097#true} is VALID [2018-11-18 23:59:20,778 INFO L273 TraceCheckUtils]: 4: Hoare triple {1097#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:20,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:20,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1135#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:20,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {1135#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1135#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:20,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {1135#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {1098#false} is VALID [2018-11-18 23:59:20,794 INFO L256 TraceCheckUtils]: 13: Hoare triple {1098#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1098#false} is VALID [2018-11-18 23:59:20,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-18 23:59:20,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-18 23:59:20,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-18 23:59:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:20,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:20,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 23:59:20,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:20,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:20,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:59:20,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:20,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:59:20,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:59:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:20,843 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-18 23:59:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:20,996 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-18 23:59:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:59:20,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 23:59:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 23:59:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:59:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 23:59:20,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-18 23:59:21,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:21,034 INFO L225 Difference]: With dead ends: 35 [2018-11-18 23:59:21,034 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 23:59:21,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:59:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 23:59:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-18 23:59:21,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:21,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-18 23:59:21,058 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-18 23:59:21,058 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-18 23:59:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:21,059 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-18 23:59:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-18 23:59:21,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:21,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:21,060 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-18 23:59:21,061 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-18 23:59:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:21,062 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-18 23:59:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-18 23:59:21,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:21,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:21,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:21,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:59:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 23:59:21,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2018-11-18 23:59:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:21,065 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 23:59:21,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:59:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 23:59:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:59:21,066 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:21,066 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:21,066 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:21,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 26004059, now seen corresponding path program 3 times [2018-11-18 23:59:21,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:21,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:21,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:21,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2018-11-18 23:59:21,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 23:59:21,345 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #38#return; {1305#true} is VALID [2018-11-18 23:59:21,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {1305#true} call #t~ret2 := main(); {1305#true} is VALID [2018-11-18 23:59:21,346 INFO L273 TraceCheckUtils]: 4: Hoare triple {1305#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1310#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:21,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {1310#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1310#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:21,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {1310#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1306#false} is VALID [2018-11-18 23:59:21,358 INFO L256 TraceCheckUtils]: 16: Hoare triple {1306#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1306#false} is VALID [2018-11-18 23:59:21,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2018-11-18 23:59:21,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2018-11-18 23:59:21,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2018-11-18 23:59:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:21,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:21,361 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-18 23:59:21,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:59:21,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 23:59:21,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:21,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:21,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2018-11-18 23:59:21,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-18 23:59:21,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1305#true} {1305#true} #38#return; {1305#true} is VALID [2018-11-18 23:59:21,485 INFO L256 TraceCheckUtils]: 3: Hoare triple {1305#true} call #t~ret2 := main(); {1305#true} is VALID [2018-11-18 23:59:21,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {1305#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:21,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {1307#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:21,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {1308#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:21,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {1309#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1353#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:21,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {1353#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1353#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:21,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1353#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1306#false} is VALID [2018-11-18 23:59:21,496 INFO L256 TraceCheckUtils]: 16: Hoare triple {1306#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1306#false} is VALID [2018-11-18 23:59:21,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2018-11-18 23:59:21,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {1306#false} assume 0 == ~cond; {1306#false} is VALID [2018-11-18 23:59:21,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2018-11-18 23:59:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:21,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:21,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 23:59:21,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 23:59:21,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:21,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:59:21,545 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-18 23:59:21,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:59:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:59:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:59:21,545 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2018-11-18 23:59:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:21,828 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-18 23:59:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:59:21,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 23:59:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:59:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-18 23:59:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:59:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-18 23:59:21,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-18 23:59:21,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:21,871 INFO L225 Difference]: With dead ends: 38 [2018-11-18 23:59:21,872 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 23:59:21,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:59:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 23:59:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-18 23:59:21,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:21,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-18 23:59:21,922 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-18 23:59:21,922 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-18 23:59:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:21,924 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 23:59:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-18 23:59:21,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:21,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:21,926 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-18 23:59:21,926 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-18 23:59:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:21,928 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-18 23:59:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-18 23:59:21,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:21,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:21,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:21,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 23:59:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-18 23:59:21,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-18 23:59:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:21,931 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-18 23:59:21,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:59:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-18 23:59:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:59:21,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:21,932 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:21,932 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:21,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:21,933 INFO L82 PathProgramCache]: Analyzing trace with hash 821178397, now seen corresponding path program 3 times [2018-11-18 23:59:21,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:21,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:21,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:21,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:22,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {1537#true} call ULTIMATE.init(); {1537#true} is VALID [2018-11-18 23:59:22,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {1537#true} assume true; {1537#true} is VALID [2018-11-18 23:59:22,230 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1537#true} {1537#true} #38#return; {1537#true} is VALID [2018-11-18 23:59:22,230 INFO L256 TraceCheckUtils]: 3: Hoare triple {1537#true} call #t~ret2 := main(); {1537#true} is VALID [2018-11-18 23:59:22,233 INFO L273 TraceCheckUtils]: 4: Hoare triple {1537#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1542#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:22,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {1542#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1542#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:22,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {1542#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1538#false} is VALID [2018-11-18 23:59:22,243 INFO L256 TraceCheckUtils]: 16: Hoare triple {1538#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1538#false} is VALID [2018-11-18 23:59:22,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {1538#false} ~cond := #in~cond; {1538#false} is VALID [2018-11-18 23:59:22,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {1538#false} assume 0 == ~cond; {1538#false} is VALID [2018-11-18 23:59:22,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2018-11-18 23:59:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:22,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:22,246 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-18 23:59:22,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:59:22,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 23:59:22,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:22,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:22,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {1537#true} call ULTIMATE.init(); {1537#true} is VALID [2018-11-18 23:59:22,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1537#true} assume true; {1537#true} is VALID [2018-11-18 23:59:22,391 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1537#true} {1537#true} #38#return; {1537#true} is VALID [2018-11-18 23:59:22,391 INFO L256 TraceCheckUtils]: 3: Hoare triple {1537#true} call #t~ret2 := main(); {1537#true} is VALID [2018-11-18 23:59:22,392 INFO L273 TraceCheckUtils]: 4: Hoare triple {1537#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:22,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:22,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {1540#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:22,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {1541#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1585#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:22,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {1585#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1585#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:22,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1585#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1538#false} is VALID [2018-11-18 23:59:22,402 INFO L256 TraceCheckUtils]: 16: Hoare triple {1538#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1538#false} is VALID [2018-11-18 23:59:22,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {1538#false} ~cond := #in~cond; {1538#false} is VALID [2018-11-18 23:59:22,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {1538#false} assume 0 == ~cond; {1538#false} is VALID [2018-11-18 23:59:22,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2018-11-18 23:59:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:22,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:22,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 23:59:22,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 23:59:22,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:22,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:59:22,459 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-18 23:59:22,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:59:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:59:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:59:22,460 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-11-18 23:59:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:22,967 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 23:59:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:59:22,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-18 23:59:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:59:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 23:59:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:59:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-18 23:59:22,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-18 23:59:23,226 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-18 23:59:23,227 INFO L225 Difference]: With dead ends: 41 [2018-11-18 23:59:23,228 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 23:59:23,228 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:59:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 23:59:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-18 23:59:23,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:23,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-18 23:59:23,304 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-18 23:59:23,304 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-18 23:59:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:23,306 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-18 23:59:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-18 23:59:23,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:23,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:23,306 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-18 23:59:23,307 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-18 23:59:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:23,308 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-18 23:59:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-18 23:59:23,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:23,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:23,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:23,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:59:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-18 23:59:23,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 20 [2018-11-18 23:59:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:23,311 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-18 23:59:23,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:59:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-18 23:59:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:59:23,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:23,312 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:23,312 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:23,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:23,312 INFO L82 PathProgramCache]: Analyzing trace with hash 427509150, now seen corresponding path program 4 times [2018-11-18 23:59:23,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:23,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:23,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:23,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-18 23:59:23,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-18 23:59:23,652 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1783#true} {1783#true} #38#return; {1783#true} is VALID [2018-11-18 23:59:23,653 INFO L256 TraceCheckUtils]: 3: Hoare triple {1783#true} call #t~ret2 := main(); {1783#true} is VALID [2018-11-18 23:59:23,653 INFO L273 TraceCheckUtils]: 4: Hoare triple {1783#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1789#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:23,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {1789#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1789#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:23,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {1789#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1784#false} is VALID [2018-11-18 23:59:23,665 INFO L256 TraceCheckUtils]: 19: Hoare triple {1784#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1784#false} is VALID [2018-11-18 23:59:23,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-18 23:59:23,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-18 23:59:23,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-18 23:59:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:23,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:23,667 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-18 23:59:23,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:59:23,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:59:23,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:23,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:23,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {1783#true} call ULTIMATE.init(); {1783#true} is VALID [2018-11-18 23:59:23,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {1783#true} assume true; {1783#true} is VALID [2018-11-18 23:59:23,806 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1783#true} {1783#true} #38#return; {1783#true} is VALID [2018-11-18 23:59:23,806 INFO L256 TraceCheckUtils]: 3: Hoare triple {1783#true} call #t~ret2 := main(); {1783#true} is VALID [2018-11-18 23:59:23,807 INFO L273 TraceCheckUtils]: 4: Hoare triple {1783#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:23,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {1785#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:23,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:23,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {1787#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:23,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {1788#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1841#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:23,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {1841#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1841#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:23,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {1841#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {1784#false} is VALID [2018-11-18 23:59:23,833 INFO L256 TraceCheckUtils]: 19: Hoare triple {1784#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1784#false} is VALID [2018-11-18 23:59:23,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {1784#false} ~cond := #in~cond; {1784#false} is VALID [2018-11-18 23:59:23,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {1784#false} assume 0 == ~cond; {1784#false} is VALID [2018-11-18 23:59:23,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {1784#false} assume !false; {1784#false} is VALID [2018-11-18 23:59:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 23:59:23,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-18 23:59:23,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:23,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:59:23,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:23,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:59:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:59:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:59:23,879 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-11-18 23:59:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:24,168 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-18 23:59:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:59:24,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-18 23:59:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:59:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-18 23:59:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:59:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2018-11-18 23:59:24,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2018-11-18 23:59:24,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:24,260 INFO L225 Difference]: With dead ends: 44 [2018-11-18 23:59:24,260 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:59:24,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:59:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:59:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-18 23:59:24,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:24,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-18 23:59:24,387 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-18 23:59:24,387 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-18 23:59:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:24,391 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 23:59:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 23:59:24,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:24,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:24,391 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-18 23:59:24,391 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-18 23:59:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:24,392 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-18 23:59:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-18 23:59:24,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:24,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:24,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:24,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 23:59:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-18 23:59:24,395 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2018-11-18 23:59:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:24,395 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 23:59:24,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:59:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-18 23:59:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:59:24,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:24,396 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:24,396 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:24,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 201615134, now seen corresponding path program 4 times [2018-11-18 23:59:24,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:24,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:24,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:24,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:24,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2018-11-18 23:59:24,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {2053#true} assume true; {2053#true} is VALID [2018-11-18 23:59:24,552 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2053#true} {2053#true} #38#return; {2053#true} is VALID [2018-11-18 23:59:24,553 INFO L256 TraceCheckUtils]: 3: Hoare triple {2053#true} call #t~ret2 := main(); {2053#true} is VALID [2018-11-18 23:59:24,553 INFO L273 TraceCheckUtils]: 4: Hoare triple {2053#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2059#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:24,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {2059#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2059#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:24,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {2059#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2054#false} is VALID [2018-11-18 23:59:24,565 INFO L256 TraceCheckUtils]: 19: Hoare triple {2054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2054#false} is VALID [2018-11-18 23:59:24,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {2054#false} ~cond := #in~cond; {2054#false} is VALID [2018-11-18 23:59:24,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {2054#false} assume 0 == ~cond; {2054#false} is VALID [2018-11-18 23:59:24,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {2054#false} assume !false; {2054#false} is VALID [2018-11-18 23:59:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:24,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:24,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 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-18 23:59:24,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:59:24,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:59:24,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:24,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:24,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2053#true} is VALID [2018-11-18 23:59:24,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {2053#true} assume true; {2053#true} is VALID [2018-11-18 23:59:24,682 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2053#true} {2053#true} #38#return; {2053#true} is VALID [2018-11-18 23:59:24,683 INFO L256 TraceCheckUtils]: 3: Hoare triple {2053#true} call #t~ret2 := main(); {2053#true} is VALID [2018-11-18 23:59:24,683 INFO L273 TraceCheckUtils]: 4: Hoare triple {2053#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:24,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {2055#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:24,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {2056#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:24,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {2057#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:24,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {2058#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2111#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:24,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {2111#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2111#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:24,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {2111#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 99); {2054#false} is VALID [2018-11-18 23:59:24,695 INFO L256 TraceCheckUtils]: 19: Hoare triple {2054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2054#false} is VALID [2018-11-18 23:59:24,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {2054#false} ~cond := #in~cond; {2054#false} is VALID [2018-11-18 23:59:24,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {2054#false} assume 0 == ~cond; {2054#false} is VALID [2018-11-18 23:59:24,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {2054#false} assume !false; {2054#false} is VALID [2018-11-18 23:59:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:24,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 23:59:24,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-18 23:59:24,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:24,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:59:24,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:24,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:59:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:59:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:59:24,742 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 8 states. [2018-11-18 23:59:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:25,010 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-18 23:59:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:59:25,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-18 23:59:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:59:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-18 23:59:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:59:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2018-11-18 23:59:25,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2018-11-18 23:59:25,049 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-18 23:59:25,050 INFO L225 Difference]: With dead ends: 47 [2018-11-18 23:59:25,051 INFO L226 Difference]: Without dead ends: 42 [2018-11-18 23:59:25,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:59:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-18 23:59:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-18 23:59:25,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:25,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-18 23:59:25,082 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-18 23:59:25,083 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-18 23:59:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:25,084 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-18 23:59:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-18 23:59:25,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:25,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:25,085 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-18 23:59:25,085 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-18 23:59:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:25,086 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-18 23:59:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-18 23:59:25,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:25,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:25,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:25,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 23:59:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-18 23:59:25,087 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 23 [2018-11-18 23:59:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:25,088 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-18 23:59:25,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:59:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-18 23:59:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:59:25,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:25,088 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:25,088 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:25,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash 181755771, now seen corresponding path program 5 times [2018-11-18 23:59:25,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:25,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:25,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:25,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {2337#true} call ULTIMATE.init(); {2337#true} is VALID [2018-11-18 23:59:25,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {2337#true} assume true; {2337#true} is VALID [2018-11-18 23:59:25,415 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2337#true} {2337#true} #38#return; {2337#true} is VALID [2018-11-18 23:59:25,416 INFO L256 TraceCheckUtils]: 3: Hoare triple {2337#true} call #t~ret2 := main(); {2337#true} is VALID [2018-11-18 23:59:25,416 INFO L273 TraceCheckUtils]: 4: Hoare triple {2337#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2344#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:25,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {2344#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume true; {2344#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:25,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {2344#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {2338#false} is VALID [2018-11-18 23:59:25,430 INFO L256 TraceCheckUtils]: 22: Hoare triple {2338#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2338#false} is VALID [2018-11-18 23:59:25,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {2338#false} ~cond := #in~cond; {2338#false} is VALID [2018-11-18 23:59:25,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {2338#false} assume 0 == ~cond; {2338#false} is VALID [2018-11-18 23:59:25,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {2338#false} assume !false; {2338#false} is VALID [2018-11-18 23:59:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:25,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:25,433 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-18 23:59:25,441 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:59:25,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 23:59:25,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:25,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:25,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {2337#true} call ULTIMATE.init(); {2337#true} is VALID [2018-11-18 23:59:25,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {2337#true} assume true; {2337#true} is VALID [2018-11-18 23:59:25,582 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2337#true} {2337#true} #38#return; {2337#true} is VALID [2018-11-18 23:59:25,582 INFO L256 TraceCheckUtils]: 3: Hoare triple {2337#true} call #t~ret2 := main(); {2337#true} is VALID [2018-11-18 23:59:25,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {2337#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:25,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {2339#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:25,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:25,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:25,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {2342#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:25,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {2343#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2405#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:25,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {2405#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2405#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:25,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {2405#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {2338#false} is VALID [2018-11-18 23:59:25,629 INFO L256 TraceCheckUtils]: 22: Hoare triple {2338#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2338#false} is VALID [2018-11-18 23:59:25,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {2338#false} ~cond := #in~cond; {2338#false} is VALID [2018-11-18 23:59:25,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {2338#false} assume 0 == ~cond; {2338#false} is VALID [2018-11-18 23:59:25,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {2338#false} assume !false; {2338#false} is VALID [2018-11-18 23:59:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:25,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:25,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 23:59:25,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 23:59:25,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:25,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:59:25,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:25,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:59:25,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:59:25,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:59:25,678 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 9 states. [2018-11-18 23:59:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:26,175 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-18 23:59:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:59:26,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 23:59:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:59:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-18 23:59:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:59:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-18 23:59:26,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2018-11-18 23:59:26,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:26,221 INFO L225 Difference]: With dead ends: 50 [2018-11-18 23:59:26,221 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 23:59:26,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:59:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 23:59:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-18 23:59:26,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:26,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-18 23:59:26,253 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-18 23:59:26,254 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-18 23:59:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:26,255 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-18 23:59:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-18 23:59:26,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:26,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:26,256 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-18 23:59:26,256 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-18 23:59:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:26,257 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-18 23:59:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-18 23:59:26,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:26,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:26,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:26,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 23:59:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-18 23:59:26,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-11-18 23:59:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:26,259 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-18 23:59:26,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:59:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-18 23:59:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:59:26,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:26,260 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:26,260 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:26,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1733081987, now seen corresponding path program 5 times [2018-11-18 23:59:26,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:26,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:26,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:26,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:26,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {2645#true} call ULTIMATE.init(); {2645#true} is VALID [2018-11-18 23:59:26,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {2645#true} assume true; {2645#true} is VALID [2018-11-18 23:59:26,411 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2645#true} {2645#true} #38#return; {2645#true} is VALID [2018-11-18 23:59:26,411 INFO L256 TraceCheckUtils]: 3: Hoare triple {2645#true} call #t~ret2 := main(); {2645#true} is VALID [2018-11-18 23:59:26,411 INFO L273 TraceCheckUtils]: 4: Hoare triple {2645#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,420 INFO L273 TraceCheckUtils]: 16: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2652#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:26,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {2652#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2652#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:26,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {2652#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2646#false} is VALID [2018-11-18 23:59:26,425 INFO L256 TraceCheckUtils]: 22: Hoare triple {2646#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2646#false} is VALID [2018-11-18 23:59:26,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {2646#false} ~cond := #in~cond; {2646#false} is VALID [2018-11-18 23:59:26,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {2646#false} assume 0 == ~cond; {2646#false} is VALID [2018-11-18 23:59:26,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {2646#false} assume !false; {2646#false} is VALID [2018-11-18 23:59:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:26,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:26,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:59:26,462 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 23:59:26,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:26,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:26,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {2645#true} call ULTIMATE.init(); {2645#true} is VALID [2018-11-18 23:59:26,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {2645#true} assume true; {2645#true} is VALID [2018-11-18 23:59:26,538 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2645#true} {2645#true} #38#return; {2645#true} is VALID [2018-11-18 23:59:26,538 INFO L256 TraceCheckUtils]: 3: Hoare triple {2645#true} call #t~ret2 := main(); {2645#true} is VALID [2018-11-18 23:59:26,542 INFO L273 TraceCheckUtils]: 4: Hoare triple {2645#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:26,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {2647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:26,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {2648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:26,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {2649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:26,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {2650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:26,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {2651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2713#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:26,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {2713#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2713#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:26,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {2713#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2646#false} is VALID [2018-11-18 23:59:26,554 INFO L256 TraceCheckUtils]: 22: Hoare triple {2646#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2646#false} is VALID [2018-11-18 23:59:26,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {2646#false} ~cond := #in~cond; {2646#false} is VALID [2018-11-18 23:59:26,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {2646#false} assume 0 == ~cond; {2646#false} is VALID [2018-11-18 23:59:26,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {2646#false} assume !false; {2646#false} is VALID [2018-11-18 23:59:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:26,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:26,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 23:59:26,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 23:59:26,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:26,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:59:26,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:26,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:59:26,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:59:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:59:26,605 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 9 states. [2018-11-18 23:59:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:27,040 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-18 23:59:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:59:27,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-18 23:59:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:59:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-11-18 23:59:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:59:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2018-11-18 23:59:27,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2018-11-18 23:59:27,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:27,083 INFO L225 Difference]: With dead ends: 53 [2018-11-18 23:59:27,083 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 23:59:27,084 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:59:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 23:59:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-18 23:59:27,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:27,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-18 23:59:27,119 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-18 23:59:27,119 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-18 23:59:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:27,121 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-18 23:59:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-18 23:59:27,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:27,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:27,122 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-18 23:59:27,122 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-18 23:59:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:27,123 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-18 23:59:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-18 23:59:27,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:27,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:27,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:27,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 23:59:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-18 23:59:27,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 26 [2018-11-18 23:59:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-18 23:59:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:59:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-18 23:59:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:59:27,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:27,126 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:27,126 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:27,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:27,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1862081662, now seen corresponding path program 6 times [2018-11-18 23:59:27,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:27,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:27,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:27,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:27,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2018-11-18 23:59:27,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {2967#true} assume true; {2967#true} is VALID [2018-11-18 23:59:27,555 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2967#true} {2967#true} #38#return; {2967#true} is VALID [2018-11-18 23:59:27,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {2967#true} call #t~ret2 := main(); {2967#true} is VALID [2018-11-18 23:59:27,556 INFO L273 TraceCheckUtils]: 4: Hoare triple {2967#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,562 INFO L273 TraceCheckUtils]: 12: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2975#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:27,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {2975#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2975#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:27,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {2975#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2968#false} is VALID [2018-11-18 23:59:27,587 INFO L256 TraceCheckUtils]: 25: Hoare triple {2968#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2968#false} is VALID [2018-11-18 23:59:27,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {2968#false} ~cond := #in~cond; {2968#false} is VALID [2018-11-18 23:59:27,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {2968#false} assume 0 == ~cond; {2968#false} is VALID [2018-11-18 23:59:27,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {2968#false} assume !false; {2968#false} is VALID [2018-11-18 23:59:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:27,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:27,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:59:27,823 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 23:59:27,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:27,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:27,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {2967#true} call ULTIMATE.init(); {2967#true} is VALID [2018-11-18 23:59:27,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {2967#true} assume true; {2967#true} is VALID [2018-11-18 23:59:27,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2967#true} {2967#true} #38#return; {2967#true} is VALID [2018-11-18 23:59:27,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {2967#true} call #t~ret2 := main(); {2967#true} is VALID [2018-11-18 23:59:27,957 INFO L273 TraceCheckUtils]: 4: Hoare triple {2967#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:27,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {2969#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,959 INFO L273 TraceCheckUtils]: 8: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:27,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:27,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {2971#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:27,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {2972#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:27,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {2973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:27,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {2974#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3045#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:27,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {3045#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3045#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:27,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {3045#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2968#false} is VALID [2018-11-18 23:59:27,971 INFO L256 TraceCheckUtils]: 25: Hoare triple {2968#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2968#false} is VALID [2018-11-18 23:59:27,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {2968#false} ~cond := #in~cond; {2968#false} is VALID [2018-11-18 23:59:27,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {2968#false} assume 0 == ~cond; {2968#false} is VALID [2018-11-18 23:59:27,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {2968#false} assume !false; {2968#false} is VALID [2018-11-18 23:59:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:27,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:27,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 23:59:27,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:59:27,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:27,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:59:28,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:28,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:59:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:59:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:59:28,023 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 10 states. [2018-11-18 23:59:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:28,616 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-18 23:59:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:59:28,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:59:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:59:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-18 23:59:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:59:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-18 23:59:28,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2018-11-18 23:59:28,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:28,695 INFO L225 Difference]: With dead ends: 56 [2018-11-18 23:59:28,695 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 23:59:28,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:59:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 23:59:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-18 23:59:28,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:28,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-18 23:59:28,763 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-18 23:59:28,763 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-18 23:59:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:28,765 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 23:59:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 23:59:28,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:28,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:28,766 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-18 23:59:28,766 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-18 23:59:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:28,767 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-18 23:59:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-18 23:59:28,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:28,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:28,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:28,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 23:59:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-18 23:59:28,770 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 29 [2018-11-18 23:59:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:28,770 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-18 23:59:28,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:59:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-18 23:59:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 23:59:28,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:28,771 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:28,771 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:28,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash 166098622, now seen corresponding path program 6 times [2018-11-18 23:59:28,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:28,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:28,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:28,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:28,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {3313#true} call ULTIMATE.init(); {3313#true} is VALID [2018-11-18 23:59:28,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {3313#true} assume true; {3313#true} is VALID [2018-11-18 23:59:28,970 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3313#true} {3313#true} #38#return; {3313#true} is VALID [2018-11-18 23:59:28,971 INFO L256 TraceCheckUtils]: 3: Hoare triple {3313#true} call #t~ret2 := main(); {3313#true} is VALID [2018-11-18 23:59:28,971 INFO L273 TraceCheckUtils]: 4: Hoare triple {3313#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:28,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:28,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:28,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:28,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:28,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:28,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:28,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:28,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:28,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:28,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:28,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:28,980 INFO L273 TraceCheckUtils]: 16: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:28,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:28,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:28,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:28,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:28,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:28,986 INFO L273 TraceCheckUtils]: 22: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3321#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:28,987 INFO L273 TraceCheckUtils]: 23: Hoare triple {3321#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3321#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:28,988 INFO L273 TraceCheckUtils]: 24: Hoare triple {3321#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3314#false} is VALID [2018-11-18 23:59:28,988 INFO L256 TraceCheckUtils]: 25: Hoare triple {3314#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3314#false} is VALID [2018-11-18 23:59:28,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {3314#false} ~cond := #in~cond; {3314#false} is VALID [2018-11-18 23:59:28,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {3314#false} assume 0 == ~cond; {3314#false} is VALID [2018-11-18 23:59:28,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {3314#false} assume !false; {3314#false} is VALID [2018-11-18 23:59:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:28,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:28,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:29,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:59:29,054 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 23:59:29,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:29,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:29,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {3313#true} call ULTIMATE.init(); {3313#true} is VALID [2018-11-18 23:59:29,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {3313#true} assume true; {3313#true} is VALID [2018-11-18 23:59:29,172 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3313#true} {3313#true} #38#return; {3313#true} is VALID [2018-11-18 23:59:29,172 INFO L256 TraceCheckUtils]: 3: Hoare triple {3313#true} call #t~ret2 := main(); {3313#true} is VALID [2018-11-18 23:59:29,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {3313#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:29,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:29,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:29,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {3315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:29,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:29,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:29,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {3316#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:29,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:29,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:29,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {3317#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:29,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:29,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:29,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {3318#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:29,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:29,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:29,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {3319#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:29,185 INFO L273 TraceCheckUtils]: 20: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:29,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:29,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {3320#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3391#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:29,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {3391#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3391#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:29,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {3391#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3314#false} is VALID [2018-11-18 23:59:29,189 INFO L256 TraceCheckUtils]: 25: Hoare triple {3314#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3314#false} is VALID [2018-11-18 23:59:29,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {3314#false} ~cond := #in~cond; {3314#false} is VALID [2018-11-18 23:59:29,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {3314#false} assume 0 == ~cond; {3314#false} is VALID [2018-11-18 23:59:29,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {3314#false} assume !false; {3314#false} is VALID [2018-11-18 23:59:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:29,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:29,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 23:59:29,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:59:29,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:29,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:59:29,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:29,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:59:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:59:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:59:29,247 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 10 states. [2018-11-18 23:59:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:29,676 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-18 23:59:29,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:59:29,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-18 23:59:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:59:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-18 23:59:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:59:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-18 23:59:29,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2018-11-18 23:59:29,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:29,819 INFO L225 Difference]: With dead ends: 59 [2018-11-18 23:59:29,819 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 23:59:29,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:59:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 23:59:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-18 23:59:29,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:29,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-18 23:59:29,912 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-18 23:59:29,912 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-18 23:59:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:29,914 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-18 23:59:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-18 23:59:29,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:29,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:29,914 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-18 23:59:29,914 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-18 23:59:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:29,915 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-18 23:59:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-18 23:59:29,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:29,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:29,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:29,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 23:59:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-18 23:59:29,917 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 29 [2018-11-18 23:59:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:29,918 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-18 23:59:29,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:59:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-18 23:59:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:59:29,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:29,918 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:29,919 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:29,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1688101733, now seen corresponding path program 7 times [2018-11-18 23:59:29,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:29,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:29,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:30,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {3673#true} call ULTIMATE.init(); {3673#true} is VALID [2018-11-18 23:59:30,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {3673#true} assume true; {3673#true} is VALID [2018-11-18 23:59:30,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3673#true} {3673#true} #38#return; {3673#true} is VALID [2018-11-18 23:59:30,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {3673#true} call #t~ret2 := main(); {3673#true} is VALID [2018-11-18 23:59:30,588 INFO L273 TraceCheckUtils]: 4: Hoare triple {3673#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3682#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:30,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {3682#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3682#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:30,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {3682#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3674#false} is VALID [2018-11-18 23:59:30,606 INFO L256 TraceCheckUtils]: 28: Hoare triple {3674#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3674#false} is VALID [2018-11-18 23:59:30,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {3674#false} ~cond := #in~cond; {3674#false} is VALID [2018-11-18 23:59:30,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {3674#false} assume 0 == ~cond; {3674#false} is VALID [2018-11-18 23:59:30,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {3674#false} assume !false; {3674#false} is VALID [2018-11-18 23:59:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:30,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:30,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:30,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:30,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {3673#true} call ULTIMATE.init(); {3673#true} is VALID [2018-11-18 23:59:30,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {3673#true} assume true; {3673#true} is VALID [2018-11-18 23:59:30,930 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3673#true} {3673#true} #38#return; {3673#true} is VALID [2018-11-18 23:59:30,930 INFO L256 TraceCheckUtils]: 3: Hoare triple {3673#true} call #t~ret2 := main(); {3673#true} is VALID [2018-11-18 23:59:30,930 INFO L273 TraceCheckUtils]: 4: Hoare triple {3673#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:30,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {3675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:30,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {3676#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:30,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {3677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:30,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {3678#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:30,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {3679#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:30,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {3680#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:30,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {3681#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3761#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:30,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {3761#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3761#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:30,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {3761#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3674#false} is VALID [2018-11-18 23:59:30,972 INFO L256 TraceCheckUtils]: 28: Hoare triple {3674#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3674#false} is VALID [2018-11-18 23:59:30,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {3674#false} ~cond := #in~cond; {3674#false} is VALID [2018-11-18 23:59:30,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {3674#false} assume 0 == ~cond; {3674#false} is VALID [2018-11-18 23:59:30,972 INFO L273 TraceCheckUtils]: 31: Hoare triple {3674#false} assume !false; {3674#false} is VALID [2018-11-18 23:59:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:30,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 23:59:30,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 23:59:30,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:30,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:59:31,026 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-18 23:59:31,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:59:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:59:31,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:59:31,027 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 11 states. [2018-11-18 23:59:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:31,554 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-18 23:59:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:59:31,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 23:59:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:59:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2018-11-18 23:59:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:59:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2018-11-18 23:59:31,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2018-11-18 23:59:31,934 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-18 23:59:31,936 INFO L225 Difference]: With dead ends: 62 [2018-11-18 23:59:31,936 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 23:59:31,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:59:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 23:59:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-18 23:59:31,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:31,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-18 23:59:31,978 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-18 23:59:31,978 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-18 23:59:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:31,979 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-18 23:59:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-18 23:59:31,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:31,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:31,980 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-18 23:59:31,980 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-18 23:59:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:31,981 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-18 23:59:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-18 23:59:31,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:31,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:31,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:31,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 23:59:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-18 23:59:31,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2018-11-18 23:59:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:31,984 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-18 23:59:31,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:59:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-18 23:59:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 23:59:31,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:31,984 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:31,985 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:31,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1051431133, now seen corresponding path program 7 times [2018-11-18 23:59:31,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:31,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:31,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:32,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {4057#true} call ULTIMATE.init(); {4057#true} is VALID [2018-11-18 23:59:32,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {4057#true} assume true; {4057#true} is VALID [2018-11-18 23:59:32,236 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4057#true} {4057#true} #38#return; {4057#true} is VALID [2018-11-18 23:59:32,236 INFO L256 TraceCheckUtils]: 3: Hoare triple {4057#true} call #t~ret2 := main(); {4057#true} is VALID [2018-11-18 23:59:32,237 INFO L273 TraceCheckUtils]: 4: Hoare triple {4057#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,246 INFO L273 TraceCheckUtils]: 18: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,247 INFO L273 TraceCheckUtils]: 19: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4066#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:32,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {4066#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {4066#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:32,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {4066#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4058#false} is VALID [2018-11-18 23:59:32,254 INFO L256 TraceCheckUtils]: 28: Hoare triple {4058#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4058#false} is VALID [2018-11-18 23:59:32,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {4058#false} ~cond := #in~cond; {4058#false} is VALID [2018-11-18 23:59:32,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {4058#false} assume 0 == ~cond; {4058#false} is VALID [2018-11-18 23:59:32,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {4058#false} assume !false; {4058#false} is VALID [2018-11-18 23:59:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:32,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:32,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:32,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:32,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {4057#true} call ULTIMATE.init(); {4057#true} is VALID [2018-11-18 23:59:32,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {4057#true} assume true; {4057#true} is VALID [2018-11-18 23:59:32,370 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4057#true} {4057#true} #38#return; {4057#true} is VALID [2018-11-18 23:59:32,371 INFO L256 TraceCheckUtils]: 3: Hoare triple {4057#true} call #t~ret2 := main(); {4057#true} is VALID [2018-11-18 23:59:32,371 INFO L273 TraceCheckUtils]: 4: Hoare triple {4057#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:32,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {4059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:32,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {4060#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:32,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {4061#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:32,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {4062#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:32,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {4063#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:32,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {4064#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:32,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {4065#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:32,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {4145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:32,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {4145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4058#false} is VALID [2018-11-18 23:59:32,388 INFO L256 TraceCheckUtils]: 28: Hoare triple {4058#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4058#false} is VALID [2018-11-18 23:59:32,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {4058#false} ~cond := #in~cond; {4058#false} is VALID [2018-11-18 23:59:32,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {4058#false} assume 0 == ~cond; {4058#false} is VALID [2018-11-18 23:59:32,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {4058#false} assume !false; {4058#false} is VALID [2018-11-18 23:59:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:32,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:32,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 23:59:32,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 23:59:32,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:32,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:59:32,445 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-18 23:59:32,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:59:32,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:59:32,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:59:32,446 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2018-11-18 23:59:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:33,004 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-18 23:59:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:59:33,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-18 23:59:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:59:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2018-11-18 23:59:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:59:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2018-11-18 23:59:33,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2018-11-18 23:59:33,499 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-18 23:59:33,500 INFO L225 Difference]: With dead ends: 65 [2018-11-18 23:59:33,500 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 23:59:33,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:59:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 23:59:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-18 23:59:33,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:33,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-18 23:59:33,608 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-18 23:59:33,608 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-18 23:59:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:33,610 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-18 23:59:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-18 23:59:33,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:33,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:33,610 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-18 23:59:33,610 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-18 23:59:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:33,611 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-18 23:59:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-18 23:59:33,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:33,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:33,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:33,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:33,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 23:59:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-18 23:59:33,613 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 32 [2018-11-18 23:59:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:33,613 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-18 23:59:33,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:59:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-18 23:59:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:59:33,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:33,614 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:33,614 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:33,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1631958178, now seen corresponding path program 8 times [2018-11-18 23:59:33,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:59:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:34,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {4455#true} call ULTIMATE.init(); {4455#true} is VALID [2018-11-18 23:59:34,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-18 23:59:34,947 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4455#true} {4455#true} #38#return; {4455#true} is VALID [2018-11-18 23:59:34,948 INFO L256 TraceCheckUtils]: 3: Hoare triple {4455#true} call #t~ret2 := main(); {4455#true} is VALID [2018-11-18 23:59:34,948 INFO L273 TraceCheckUtils]: 4: Hoare triple {4455#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:34,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:34,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:34,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:34,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:34,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:34,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:34,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:34,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:34,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:34,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:34,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:34,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:34,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:34,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:34,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:34,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:34,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:34,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:34,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:34,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:34,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:34,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:34,964 INFO L273 TraceCheckUtils]: 27: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:34,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4465#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:34,966 INFO L273 TraceCheckUtils]: 29: Hoare triple {4465#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {4465#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:34,967 INFO L273 TraceCheckUtils]: 30: Hoare triple {4465#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4456#false} is VALID [2018-11-18 23:59:34,967 INFO L256 TraceCheckUtils]: 31: Hoare triple {4456#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4456#false} is VALID [2018-11-18 23:59:34,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {4456#false} ~cond := #in~cond; {4456#false} is VALID [2018-11-18 23:59:34,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {4456#false} assume 0 == ~cond; {4456#false} is VALID [2018-11-18 23:59:34,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {4456#false} assume !false; {4456#false} is VALID [2018-11-18 23:59:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:34,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:34,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:59:34,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:59:34,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:35,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:35,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {4455#true} call ULTIMATE.init(); {4455#true} is VALID [2018-11-18 23:59:35,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {4455#true} assume true; {4455#true} is VALID [2018-11-18 23:59:35,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4455#true} {4455#true} #38#return; {4455#true} is VALID [2018-11-18 23:59:35,149 INFO L256 TraceCheckUtils]: 3: Hoare triple {4455#true} call #t~ret2 := main(); {4455#true} is VALID [2018-11-18 23:59:35,150 INFO L273 TraceCheckUtils]: 4: Hoare triple {4455#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:35,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:35,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:35,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {4457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:35,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:35,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:35,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {4458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:35,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:35,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:35,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {4459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:35,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:35,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:35,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {4460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:35,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:35,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:35,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {4461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:35,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:35,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:35,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {4462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:35,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:35,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:35,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {4463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:35,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:35,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:35,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {4464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4553#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:35,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4553#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:35,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {4553#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 99); {4456#false} is VALID [2018-11-18 23:59:35,268 INFO L256 TraceCheckUtils]: 31: Hoare triple {4456#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4456#false} is VALID [2018-11-18 23:59:35,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {4456#false} ~cond := #in~cond; {4456#false} is VALID [2018-11-18 23:59:35,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {4456#false} assume 0 == ~cond; {4456#false} is VALID [2018-11-18 23:59:35,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {4456#false} assume !false; {4456#false} is VALID [2018-11-18 23:59:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:35,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:35,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 23:59:35,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-18 23:59:35,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:35,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 23:59:35,329 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-18 23:59:35,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 23:59:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 23:59:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:59:35,330 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 12 states. [2018-11-18 23:59:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:35,957 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-18 23:59:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:59:35,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-18 23:59:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:35,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:59:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-18 23:59:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:59:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-18 23:59:35,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2018-11-18 23:59:36,606 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-18 23:59:36,607 INFO L225 Difference]: With dead ends: 68 [2018-11-18 23:59:36,607 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 23:59:36,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:59:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 23:59:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-18 23:59:36,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:36,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-18 23:59:36,990 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-18 23:59:36,990 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-18 23:59:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:36,992 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 23:59:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 23:59:36,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:36,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:36,993 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-18 23:59:36,993 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-18 23:59:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:36,995 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-18 23:59:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-18 23:59:36,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:36,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:36,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:36,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 23:59:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-18 23:59:36,998 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 35 [2018-11-18 23:59:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:36,998 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-18 23:59:36,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 23:59:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-18 23:59:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:59:36,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:36,999 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:36,999 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:36,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 598101598, now seen corresponding path program 8 times [2018-11-18 23:59:37,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:37,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:37,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:37,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {4877#true} call ULTIMATE.init(); {4877#true} is VALID [2018-11-18 23:59:37,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {4877#true} assume true; {4877#true} is VALID [2018-11-18 23:59:37,665 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4877#true} {4877#true} #38#return; {4877#true} is VALID [2018-11-18 23:59:37,666 INFO L256 TraceCheckUtils]: 3: Hoare triple {4877#true} call #t~ret2 := main(); {4877#true} is VALID [2018-11-18 23:59:37,666 INFO L273 TraceCheckUtils]: 4: Hoare triple {4877#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,683 INFO L273 TraceCheckUtils]: 27: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4887#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:37,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {4887#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {4887#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:37,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {4887#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4878#false} is VALID [2018-11-18 23:59:37,686 INFO L256 TraceCheckUtils]: 31: Hoare triple {4878#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4878#false} is VALID [2018-11-18 23:59:37,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {4878#false} ~cond := #in~cond; {4878#false} is VALID [2018-11-18 23:59:37,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {4878#false} assume 0 == ~cond; {4878#false} is VALID [2018-11-18 23:59:37,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {4878#false} assume !false; {4878#false} is VALID [2018-11-18 23:59:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:37,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:37,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:59:37,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:59:37,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:37,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:37,862 INFO L256 TraceCheckUtils]: 0: Hoare triple {4877#true} call ULTIMATE.init(); {4877#true} is VALID [2018-11-18 23:59:37,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {4877#true} assume true; {4877#true} is VALID [2018-11-18 23:59:37,863 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4877#true} {4877#true} #38#return; {4877#true} is VALID [2018-11-18 23:59:37,863 INFO L256 TraceCheckUtils]: 3: Hoare triple {4877#true} call #t~ret2 := main(); {4877#true} is VALID [2018-11-18 23:59:37,864 INFO L273 TraceCheckUtils]: 4: Hoare triple {4877#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:37,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {4879#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:37,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {4880#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:37,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {4881#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:37,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {4882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:37,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {4883#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:37,896 INFO L273 TraceCheckUtils]: 22: Hoare triple {4884#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,897 INFO L273 TraceCheckUtils]: 23: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:37,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {4885#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,899 INFO L273 TraceCheckUtils]: 26: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:37,901 INFO L273 TraceCheckUtils]: 28: Hoare triple {4886#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4975#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:37,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {4975#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {4975#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:37,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {4975#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4878#false} is VALID [2018-11-18 23:59:37,902 INFO L256 TraceCheckUtils]: 31: Hoare triple {4878#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4878#false} is VALID [2018-11-18 23:59:37,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {4878#false} ~cond := #in~cond; {4878#false} is VALID [2018-11-18 23:59:37,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {4878#false} assume 0 == ~cond; {4878#false} is VALID [2018-11-18 23:59:37,903 INFO L273 TraceCheckUtils]: 34: Hoare triple {4878#false} assume !false; {4878#false} is VALID [2018-11-18 23:59:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:37,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 23:59:37,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-18 23:59:37,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:37,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 23:59:37,962 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-18 23:59:37,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 23:59:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 23:59:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:59:37,963 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 12 states. [2018-11-18 23:59:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:38,570 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-18 23:59:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:59:38,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-18 23:59:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:59:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2018-11-18 23:59:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:59:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2018-11-18 23:59:38,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2018-11-18 23:59:38,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:38,648 INFO L225 Difference]: With dead ends: 71 [2018-11-18 23:59:38,649 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 23:59:38,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:59:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 23:59:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-18 23:59:38,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:38,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-18 23:59:38,801 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-18 23:59:38,801 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-18 23:59:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:38,803 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-18 23:59:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-18 23:59:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:38,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:38,803 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-18 23:59:38,804 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-18 23:59:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:38,805 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-18 23:59:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-18 23:59:38,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:38,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:38,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:38,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-18 23:59:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-18 23:59:38,806 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 35 [2018-11-18 23:59:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:38,807 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-18 23:59:38,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 23:59:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-18 23:59:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:59:38,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:38,807 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:38,808 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:38,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:38,808 INFO L82 PathProgramCache]: Analyzing trace with hash 198410683, now seen corresponding path program 9 times [2018-11-18 23:59:38,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:38,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:38,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:38,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:39,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {5313#true} call ULTIMATE.init(); {5313#true} is VALID [2018-11-18 23:59:39,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {5313#true} assume true; {5313#true} is VALID [2018-11-18 23:59:39,120 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5313#true} {5313#true} #38#return; {5313#true} is VALID [2018-11-18 23:59:39,120 INFO L256 TraceCheckUtils]: 3: Hoare triple {5313#true} call #t~ret2 := main(); {5313#true} is VALID [2018-11-18 23:59:39,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {5313#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,132 INFO L273 TraceCheckUtils]: 17: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5324#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:39,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {5324#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {5324#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:39,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {5324#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5314#false} is VALID [2018-11-18 23:59:39,146 INFO L256 TraceCheckUtils]: 34: Hoare triple {5314#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5314#false} is VALID [2018-11-18 23:59:39,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {5314#false} ~cond := #in~cond; {5314#false} is VALID [2018-11-18 23:59:39,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {5314#false} assume 0 == ~cond; {5314#false} is VALID [2018-11-18 23:59:39,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2018-11-18 23:59:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:39,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:39,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:39,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:59:39,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 23:59:39,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:39,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:39,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {5313#true} call ULTIMATE.init(); {5313#true} is VALID [2018-11-18 23:59:39,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {5313#true} assume true; {5313#true} is VALID [2018-11-18 23:59:39,875 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5313#true} {5313#true} #38#return; {5313#true} is VALID [2018-11-18 23:59:39,876 INFO L256 TraceCheckUtils]: 3: Hoare triple {5313#true} call #t~ret2 := main(); {5313#true} is VALID [2018-11-18 23:59:39,876 INFO L273 TraceCheckUtils]: 4: Hoare triple {5313#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:39,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {5315#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:39,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {5316#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:39,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {5317#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:39,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {5318#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:39,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {5319#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:39,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {5320#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:39,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {5321#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,895 INFO L273 TraceCheckUtils]: 27: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:39,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {5322#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:39,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {5323#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:39,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {5421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {5421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:39,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {5421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 < 99); {5314#false} is VALID [2018-11-18 23:59:39,901 INFO L256 TraceCheckUtils]: 34: Hoare triple {5314#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5314#false} is VALID [2018-11-18 23:59:39,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {5314#false} ~cond := #in~cond; {5314#false} is VALID [2018-11-18 23:59:39,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {5314#false} assume 0 == ~cond; {5314#false} is VALID [2018-11-18 23:59:39,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2018-11-18 23:59:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:39,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:39,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 23:59:39,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-18 23:59:39,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:39,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:59:39,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:39,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:59:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:59:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:59:39,971 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 13 states. [2018-11-18 23:59:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:40,912 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-18 23:59:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:59:40,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-18 23:59:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:59:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-18 23:59:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:59:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-18 23:59:40,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2018-11-18 23:59:41,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:41,363 INFO L225 Difference]: With dead ends: 74 [2018-11-18 23:59:41,363 INFO L226 Difference]: Without dead ends: 69 [2018-11-18 23:59:41,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:59:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-18 23:59:41,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-18 23:59:41,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:41,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-18 23:59:41,407 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-18 23:59:41,407 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-18 23:59:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:41,409 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-18 23:59:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-18 23:59:41,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:41,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:41,410 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-18 23:59:41,411 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-18 23:59:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:41,412 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-18 23:59:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-18 23:59:41,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:41,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:41,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:41,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 23:59:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-18 23:59:41,414 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2018-11-18 23:59:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:41,414 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-18 23:59:41,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:59:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-18 23:59:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 23:59:41,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:41,415 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:41,415 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:41,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1164896963, now seen corresponding path program 9 times [2018-11-18 23:59:41,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:41,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:41,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:41,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:41,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2018-11-18 23:59:41,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {5773#true} assume true; {5773#true} is VALID [2018-11-18 23:59:41,661 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5773#true} {5773#true} #38#return; {5773#true} is VALID [2018-11-18 23:59:41,661 INFO L256 TraceCheckUtils]: 3: Hoare triple {5773#true} call #t~ret2 := main(); {5773#true} is VALID [2018-11-18 23:59:41,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {5773#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:41,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:41,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:41,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:41,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:41,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:41,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:41,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:41,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:41,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:41,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:41,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:41,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:41,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:41,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:41,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:41,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:41,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:41,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:41,677 INFO L273 TraceCheckUtils]: 23: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:41,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:41,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:41,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:41,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:41,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:41,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:41,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:41,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5784#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:41,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {5784#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {5784#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:41,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {5784#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5774#false} is VALID [2018-11-18 23:59:41,685 INFO L256 TraceCheckUtils]: 34: Hoare triple {5774#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5774#false} is VALID [2018-11-18 23:59:41,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2018-11-18 23:59:41,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2018-11-18 23:59:41,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2018-11-18 23:59:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:41,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:41,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:41,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:59:41,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 23:59:42,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:42,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:42,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {5773#true} call ULTIMATE.init(); {5773#true} is VALID [2018-11-18 23:59:42,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {5773#true} assume true; {5773#true} is VALID [2018-11-18 23:59:42,136 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5773#true} {5773#true} #38#return; {5773#true} is VALID [2018-11-18 23:59:42,136 INFO L256 TraceCheckUtils]: 3: Hoare triple {5773#true} call #t~ret2 := main(); {5773#true} is VALID [2018-11-18 23:59:42,137 INFO L273 TraceCheckUtils]: 4: Hoare triple {5773#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:42,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:42,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:42,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {5775#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:42,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:42,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:42,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {5776#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:42,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:42,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:42,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {5777#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:42,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:42,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:42,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {5778#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:42,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:42,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:42,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {5779#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:42,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:42,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:42,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {5780#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:42,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:42,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:42,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {5781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:42,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:42,156 INFO L273 TraceCheckUtils]: 27: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:42,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {5782#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:42,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:42,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:42,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {5783#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5881#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:42,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {5881#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {5881#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:42,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {5881#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {5774#false} is VALID [2018-11-18 23:59:42,161 INFO L256 TraceCheckUtils]: 34: Hoare triple {5774#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5774#false} is VALID [2018-11-18 23:59:42,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#false} ~cond := #in~cond; {5774#false} is VALID [2018-11-18 23:59:42,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {5774#false} assume 0 == ~cond; {5774#false} is VALID [2018-11-18 23:59:42,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {5774#false} assume !false; {5774#false} is VALID [2018-11-18 23:59:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:42,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:42,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 23:59:42,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-18 23:59:42,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:42,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:59:42,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:42,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:59:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:59:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:59:42,225 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 13 states. [2018-11-18 23:59:43,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:43,421 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-18 23:59:43,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 23:59:43,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-11-18 23:59:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:59:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2018-11-18 23:59:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:59:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2018-11-18 23:59:43,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2018-11-18 23:59:43,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:43,489 INFO L225 Difference]: With dead ends: 77 [2018-11-18 23:59:43,489 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 23:59:43,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:59:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 23:59:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-18 23:59:43,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:43,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-18 23:59:43,535 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-18 23:59:43,535 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-18 23:59:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:43,536 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-18 23:59:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-18 23:59:43,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:43,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:43,537 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-18 23:59:43,537 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-18 23:59:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:43,538 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-18 23:59:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-18 23:59:43,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:43,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:43,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:43,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 23:59:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-18 23:59:43,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2018-11-18 23:59:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:43,541 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-18 23:59:43,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:59:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-18 23:59:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 23:59:43,541 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:43,541 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:43,542 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:43,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash -187641282, now seen corresponding path program 10 times [2018-11-18 23:59:43,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:43,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:43,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:43,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:43,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:43,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {6247#true} call ULTIMATE.init(); {6247#true} is VALID [2018-11-18 23:59:43,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {6247#true} assume true; {6247#true} is VALID [2018-11-18 23:59:43,898 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6247#true} {6247#true} #38#return; {6247#true} is VALID [2018-11-18 23:59:43,898 INFO L256 TraceCheckUtils]: 3: Hoare triple {6247#true} call #t~ret2 := main(); {6247#true} is VALID [2018-11-18 23:59:43,899 INFO L273 TraceCheckUtils]: 4: Hoare triple {6247#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:43,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:43,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:43,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:43,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:43,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:43,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:43,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:43,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:43,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:43,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:43,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:43,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:43,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:43,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:43,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:43,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:43,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:43,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:43,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:43,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:43,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:43,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:43,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:43,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:43,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:43,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:43,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:43,919 INFO L273 TraceCheckUtils]: 32: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:43,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:43,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6259#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:43,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {6259#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {6259#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:43,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {6259#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6248#false} is VALID [2018-11-18 23:59:43,924 INFO L256 TraceCheckUtils]: 37: Hoare triple {6248#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6248#false} is VALID [2018-11-18 23:59:43,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {6248#false} ~cond := #in~cond; {6248#false} is VALID [2018-11-18 23:59:43,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {6248#false} assume 0 == ~cond; {6248#false} is VALID [2018-11-18 23:59:43,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {6248#false} assume !false; {6248#false} is VALID [2018-11-18 23:59:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:43,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:43,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:59:43,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:59:43,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:43,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:44,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {6247#true} call ULTIMATE.init(); {6247#true} is VALID [2018-11-18 23:59:44,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {6247#true} assume true; {6247#true} is VALID [2018-11-18 23:59:44,147 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6247#true} {6247#true} #38#return; {6247#true} is VALID [2018-11-18 23:59:44,147 INFO L256 TraceCheckUtils]: 3: Hoare triple {6247#true} call #t~ret2 := main(); {6247#true} is VALID [2018-11-18 23:59:44,147 INFO L273 TraceCheckUtils]: 4: Hoare triple {6247#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:44,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:44,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:44,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {6249#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:44,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:44,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:44,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {6250#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:44,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:44,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:44,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {6251#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:44,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:44,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:44,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {6252#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:44,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:44,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:44,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {6253#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:44,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:44,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:44,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {6254#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:44,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:44,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:44,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {6255#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:44,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:44,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:44,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {6256#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:44,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:44,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:44,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {6257#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:44,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:44,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:44,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {6258#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6365#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:44,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {6365#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {6365#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:44,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {6365#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6248#false} is VALID [2018-11-18 23:59:44,170 INFO L256 TraceCheckUtils]: 37: Hoare triple {6248#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6248#false} is VALID [2018-11-18 23:59:44,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {6248#false} ~cond := #in~cond; {6248#false} is VALID [2018-11-18 23:59:44,170 INFO L273 TraceCheckUtils]: 39: Hoare triple {6248#false} assume 0 == ~cond; {6248#false} is VALID [2018-11-18 23:59:44,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {6248#false} assume !false; {6248#false} is VALID [2018-11-18 23:59:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:44,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:44,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 23:59:44,193 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-18 23:59:44,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:44,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 23:59:44,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:44,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 23:59:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 23:59:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 23:59:44,237 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 14 states. [2018-11-18 23:59:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:45,165 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-18 23:59:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 23:59:45,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-18 23:59:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:59:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-18 23:59:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:59:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2018-11-18 23:59:45,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2018-11-18 23:59:45,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:45,339 INFO L225 Difference]: With dead ends: 80 [2018-11-18 23:59:45,339 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 23:59:45,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 23:59:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 23:59:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-18 23:59:45,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:45,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-18 23:59:45,396 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-18 23:59:45,396 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-18 23:59:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:45,398 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 23:59:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 23:59:45,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:45,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:45,399 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-18 23:59:45,399 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-18 23:59:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:45,401 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-18 23:59:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-18 23:59:45,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:45,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:45,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:45,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 23:59:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-18 23:59:45,402 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 41 [2018-11-18 23:59:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:45,402 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-18 23:59:45,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 23:59:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-18 23:59:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 23:59:45,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:45,403 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:45,403 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:45,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 500035070, now seen corresponding path program 10 times [2018-11-18 23:59:45,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:45,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:45,745 INFO L256 TraceCheckUtils]: 0: Hoare triple {6745#true} call ULTIMATE.init(); {6745#true} is VALID [2018-11-18 23:59:45,745 INFO L273 TraceCheckUtils]: 1: Hoare triple {6745#true} assume true; {6745#true} is VALID [2018-11-18 23:59:45,746 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6745#true} {6745#true} #38#return; {6745#true} is VALID [2018-11-18 23:59:45,746 INFO L256 TraceCheckUtils]: 3: Hoare triple {6745#true} call #t~ret2 := main(); {6745#true} is VALID [2018-11-18 23:59:45,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {6745#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,767 INFO L273 TraceCheckUtils]: 32: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6757#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:45,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {6757#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume true; {6757#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:45,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {6757#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {6746#false} is VALID [2018-11-18 23:59:45,770 INFO L256 TraceCheckUtils]: 37: Hoare triple {6746#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6746#false} is VALID [2018-11-18 23:59:45,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {6746#false} ~cond := #in~cond; {6746#false} is VALID [2018-11-18 23:59:45,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {6746#false} assume 0 == ~cond; {6746#false} is VALID [2018-11-18 23:59:45,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {6746#false} assume !false; {6746#false} is VALID [2018-11-18 23:59:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:45,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:45,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:45,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:59:45,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:59:45,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:45,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:45,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {6745#true} call ULTIMATE.init(); {6745#true} is VALID [2018-11-18 23:59:45,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {6745#true} assume true; {6745#true} is VALID [2018-11-18 23:59:45,947 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6745#true} {6745#true} #38#return; {6745#true} is VALID [2018-11-18 23:59:45,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {6745#true} call #t~ret2 := main(); {6745#true} is VALID [2018-11-18 23:59:45,948 INFO L273 TraceCheckUtils]: 4: Hoare triple {6745#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:45,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {6747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:45,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {6748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:45,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {6749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:45,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {6750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:45,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {6751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:45,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {6752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:45,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {6753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:45,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {6754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:45,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {6755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,968 INFO L273 TraceCheckUtils]: 33: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:45,969 INFO L273 TraceCheckUtils]: 34: Hoare triple {6756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6863#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:45,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {6863#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {6863#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:45,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {6863#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {6746#false} is VALID [2018-11-18 23:59:45,971 INFO L256 TraceCheckUtils]: 37: Hoare triple {6746#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6746#false} is VALID [2018-11-18 23:59:45,971 INFO L273 TraceCheckUtils]: 38: Hoare triple {6746#false} ~cond := #in~cond; {6746#false} is VALID [2018-11-18 23:59:45,971 INFO L273 TraceCheckUtils]: 39: Hoare triple {6746#false} assume 0 == ~cond; {6746#false} is VALID [2018-11-18 23:59:45,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {6746#false} assume !false; {6746#false} is VALID [2018-11-18 23:59:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:45,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:45,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 23:59:45,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-18 23:59:45,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:45,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 23:59:46,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:46,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 23:59:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 23:59:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 23:59:46,036 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 14 states. [2018-11-18 23:59:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:47,822 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-18 23:59:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 23:59:47,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-18 23:59:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:59:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2018-11-18 23:59:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:59:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2018-11-18 23:59:47,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2018-11-18 23:59:47,881 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-18 23:59:47,883 INFO L225 Difference]: With dead ends: 83 [2018-11-18 23:59:47,883 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 23:59:47,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 23:59:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 23:59:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-18 23:59:47,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:47,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-18 23:59:47,960 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-18 23:59:47,960 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-18 23:59:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:47,961 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-18 23:59:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-18 23:59:47,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:47,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:47,962 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-18 23:59:47,963 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-18 23:59:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:47,964 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-18 23:59:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-18 23:59:47,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:47,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:47,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:47,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 23:59:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-18 23:59:47,967 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 41 [2018-11-18 23:59:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:47,967 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-18 23:59:47,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 23:59:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-18 23:59:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 23:59:47,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:47,969 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:47,969 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:47,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 860688091, now seen corresponding path program 11 times [2018-11-18 23:59:47,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:47,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:48,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {7257#true} call ULTIMATE.init(); {7257#true} is VALID [2018-11-18 23:59:48,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {7257#true} assume true; {7257#true} is VALID [2018-11-18 23:59:48,552 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7257#true} {7257#true} #38#return; {7257#true} is VALID [2018-11-18 23:59:48,553 INFO L256 TraceCheckUtils]: 3: Hoare triple {7257#true} call #t~ret2 := main(); {7257#true} is VALID [2018-11-18 23:59:48,553 INFO L273 TraceCheckUtils]: 4: Hoare triple {7257#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:48,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:48,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:48,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:48,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:48,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:48,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:48,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:48,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:48,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:48,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:48,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:48,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:48,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:48,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:48,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:48,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:48,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:48,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:48,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:48,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:48,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:48,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:48,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:48,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:48,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:48,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:48,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:48,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:48,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:48,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:48,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:48,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:48,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7270#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:48,579 INFO L273 TraceCheckUtils]: 38: Hoare triple {7270#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {7270#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:48,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {7270#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7258#false} is VALID [2018-11-18 23:59:48,580 INFO L256 TraceCheckUtils]: 40: Hoare triple {7258#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7258#false} is VALID [2018-11-18 23:59:48,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {7258#false} ~cond := #in~cond; {7258#false} is VALID [2018-11-18 23:59:48,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {7258#false} assume 0 == ~cond; {7258#false} is VALID [2018-11-18 23:59:48,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {7258#false} assume !false; {7258#false} is VALID [2018-11-18 23:59:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:48,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:48,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:59:50,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 23:59:50,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:50,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:50,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {7257#true} call ULTIMATE.init(); {7257#true} is VALID [2018-11-18 23:59:50,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {7257#true} assume true; {7257#true} is VALID [2018-11-18 23:59:50,991 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7257#true} {7257#true} #38#return; {7257#true} is VALID [2018-11-18 23:59:50,992 INFO L256 TraceCheckUtils]: 3: Hoare triple {7257#true} call #t~ret2 := main(); {7257#true} is VALID [2018-11-18 23:59:50,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {7257#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:50,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:50,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:50,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {7259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:50,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:50,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:50,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {7260#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:50,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:50,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:50,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {7261#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:51,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:51,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:51,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {7262#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:51,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:51,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:51,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {7263#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:51,004 INFO L273 TraceCheckUtils]: 20: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:51,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:51,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {7264#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:51,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:51,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:51,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {7265#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:51,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:51,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:51,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {7266#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:51,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:51,012 INFO L273 TraceCheckUtils]: 30: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:51,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {7267#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:51,013 INFO L273 TraceCheckUtils]: 32: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:51,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:51,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {7268#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:51,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:51,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:51,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7385#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:51,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {7385#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {7385#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:51,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {7385#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 < 99); {7258#false} is VALID [2018-11-18 23:59:51,019 INFO L256 TraceCheckUtils]: 40: Hoare triple {7258#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7258#false} is VALID [2018-11-18 23:59:51,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {7258#false} ~cond := #in~cond; {7258#false} is VALID [2018-11-18 23:59:51,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {7258#false} assume 0 == ~cond; {7258#false} is VALID [2018-11-18 23:59:51,020 INFO L273 TraceCheckUtils]: 43: Hoare triple {7258#false} assume !false; {7258#false} is VALID [2018-11-18 23:59:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:51,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:51,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 23:59:51,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-18 23:59:51,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:51,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 23:59:51,094 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-18 23:59:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 23:59:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 23:59:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:59:51,095 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 15 states. [2018-11-18 23:59:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:52,243 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-18 23:59:52,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 23:59:52,244 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-18 23:59:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:59:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2018-11-18 23:59:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:59:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 61 transitions. [2018-11-18 23:59:52,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 61 transitions. [2018-11-18 23:59:52,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:52,428 INFO L225 Difference]: With dead ends: 86 [2018-11-18 23:59:52,428 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 23:59:52,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:59:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 23:59:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-18 23:59:52,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:52,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-18 23:59:52,476 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-18 23:59:52,476 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-18 23:59:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:52,478 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-18 23:59:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-18 23:59:52,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:52,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:52,479 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-18 23:59:52,479 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-18 23:59:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:52,480 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-18 23:59:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-18 23:59:52,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:52,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:52,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:52,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 23:59:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-18 23:59:52,482 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2018-11-18 23:59:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:52,482 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-18 23:59:52,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 23:59:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-18 23:59:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 23:59:52,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:52,483 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:52,484 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:52,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2087071331, now seen corresponding path program 11 times [2018-11-18 23:59:52,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:52,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:52,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:54,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {7793#true} call ULTIMATE.init(); {7793#true} is VALID [2018-11-18 23:59:54,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {7793#true} assume true; {7793#true} is VALID [2018-11-18 23:59:54,012 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7793#true} {7793#true} #38#return; {7793#true} is VALID [2018-11-18 23:59:54,013 INFO L256 TraceCheckUtils]: 3: Hoare triple {7793#true} call #t~ret2 := main(); {7793#true} is VALID [2018-11-18 23:59:54,014 INFO L273 TraceCheckUtils]: 4: Hoare triple {7793#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:54,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:54,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:54,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:54,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:54,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:54,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:54,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:54,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:54,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:54,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:54,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:54,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:54,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:54,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:54,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:54,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:54,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:54,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:54,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:54,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:54,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:54,037 INFO L273 TraceCheckUtils]: 26: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:54,037 INFO L273 TraceCheckUtils]: 27: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:54,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:54,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:54,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:54,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:54,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:54,043 INFO L273 TraceCheckUtils]: 33: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:54,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:54,047 INFO L273 TraceCheckUtils]: 35: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:54,047 INFO L273 TraceCheckUtils]: 36: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:54,049 INFO L273 TraceCheckUtils]: 37: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7806#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:54,049 INFO L273 TraceCheckUtils]: 38: Hoare triple {7806#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {7806#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:54,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {7806#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7794#false} is VALID [2018-11-18 23:59:54,051 INFO L256 TraceCheckUtils]: 40: Hoare triple {7794#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7794#false} is VALID [2018-11-18 23:59:54,051 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#false} ~cond := #in~cond; {7794#false} is VALID [2018-11-18 23:59:54,051 INFO L273 TraceCheckUtils]: 42: Hoare triple {7794#false} assume 0 == ~cond; {7794#false} is VALID [2018-11-18 23:59:54,052 INFO L273 TraceCheckUtils]: 43: Hoare triple {7794#false} assume !false; {7794#false} is VALID [2018-11-18 23:59:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:54,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:54,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:59:55,495 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 23:59:55,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:55,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:55,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {7793#true} call ULTIMATE.init(); {7793#true} is VALID [2018-11-18 23:59:55,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {7793#true} assume true; {7793#true} is VALID [2018-11-18 23:59:55,626 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7793#true} {7793#true} #38#return; {7793#true} is VALID [2018-11-18 23:59:55,626 INFO L256 TraceCheckUtils]: 3: Hoare triple {7793#true} call #t~ret2 := main(); {7793#true} is VALID [2018-11-18 23:59:55,626 INFO L273 TraceCheckUtils]: 4: Hoare triple {7793#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:55,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:55,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:55,628 INFO L273 TraceCheckUtils]: 7: Hoare triple {7795#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:55,628 INFO L273 TraceCheckUtils]: 8: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:55,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:55,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {7796#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:55,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:55,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:55,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {7797#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:55,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:55,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:55,633 INFO L273 TraceCheckUtils]: 16: Hoare triple {7798#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:55,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:55,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:55,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {7799#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:55,636 INFO L273 TraceCheckUtils]: 20: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:55,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:55,656 INFO L273 TraceCheckUtils]: 22: Hoare triple {7800#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:55,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:55,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:55,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {7801#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:55,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:55,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-18 23:59:55,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {7802#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:55,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:55,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-18 23:59:55,661 INFO L273 TraceCheckUtils]: 31: Hoare triple {7803#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:55,662 INFO L273 TraceCheckUtils]: 32: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:55,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-18 23:59:55,663 INFO L273 TraceCheckUtils]: 34: Hoare triple {7804#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:55,664 INFO L273 TraceCheckUtils]: 35: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:55,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-18 23:59:55,666 INFO L273 TraceCheckUtils]: 37: Hoare triple {7805#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-18 23:59:55,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {7921#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {7921#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-18 23:59:55,667 INFO L273 TraceCheckUtils]: 39: Hoare triple {7921#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {7794#false} is VALID [2018-11-18 23:59:55,667 INFO L256 TraceCheckUtils]: 40: Hoare triple {7794#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7794#false} is VALID [2018-11-18 23:59:55,668 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#false} ~cond := #in~cond; {7794#false} is VALID [2018-11-18 23:59:55,668 INFO L273 TraceCheckUtils]: 42: Hoare triple {7794#false} assume 0 == ~cond; {7794#false} is VALID [2018-11-18 23:59:55,668 INFO L273 TraceCheckUtils]: 43: Hoare triple {7794#false} assume !false; {7794#false} is VALID [2018-11-18 23:59:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:55,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:55,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 23:59:55,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-18 23:59:55,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:55,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 23:59:55,739 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-18 23:59:55,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 23:59:55,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 23:59:55,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:59:55,740 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 15 states. [2018-11-18 23:59:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:58,083 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-11-18 23:59:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 23:59:58,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-18 23:59:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:59:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:59:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2018-11-18 23:59:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:59:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2018-11-18 23:59:58,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2018-11-18 23:59:58,301 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-18 23:59:58,303 INFO L225 Difference]: With dead ends: 89 [2018-11-18 23:59:58,303 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 23:59:58,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-18 23:59:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 23:59:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-18 23:59:58,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:59:58,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-18 23:59:58,417 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-18 23:59:58,417 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-18 23:59:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:58,420 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-18 23:59:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-18 23:59:58,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:58,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:58,420 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-18 23:59:58,421 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-18 23:59:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:59:58,422 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-18 23:59:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-18 23:59:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:59:58,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:59:58,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:59:58,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:59:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 23:59:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-18 23:59:58,424 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 44 [2018-11-18 23:59:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:59:58,425 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-18 23:59:58,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 23:59:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-18 23:59:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 23:59:58,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:59:58,425 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:59:58,426 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:59:58,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:59:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1361137378, now seen corresponding path program 12 times [2018-11-18 23:59:58,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:59:58,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:59:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:58,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:59:58,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:59:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:58,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {8343#true} call ULTIMATE.init(); {8343#true} is VALID [2018-11-18 23:59:58,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {8343#true} assume true; {8343#true} is VALID [2018-11-18 23:59:58,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8343#true} {8343#true} #38#return; {8343#true} is VALID [2018-11-18 23:59:58,742 INFO L256 TraceCheckUtils]: 3: Hoare triple {8343#true} call #t~ret2 := main(); {8343#true} is VALID [2018-11-18 23:59:58,742 INFO L273 TraceCheckUtils]: 4: Hoare triple {8343#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:58,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:58,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:58,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:58,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:58,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:58,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:58,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:58,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:58,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:58,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:58,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:58,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:58,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:58,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:58,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:58,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:58,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:58,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:58,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:58,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:58,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:58,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:58,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:58,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:58,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:58,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:58,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:58,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:58,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:58,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:58,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:58,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:58,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:58,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:58,768 INFO L273 TraceCheckUtils]: 39: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:58,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8357#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:58,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {8357#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {8357#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-18 23:59:58,771 INFO L273 TraceCheckUtils]: 42: Hoare triple {8357#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {8344#false} is VALID [2018-11-18 23:59:58,771 INFO L256 TraceCheckUtils]: 43: Hoare triple {8344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8344#false} is VALID [2018-11-18 23:59:58,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {8344#false} ~cond := #in~cond; {8344#false} is VALID [2018-11-18 23:59:58,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {8344#false} assume 0 == ~cond; {8344#false} is VALID [2018-11-18 23:59:58,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {8344#false} assume !false; {8344#false} is VALID [2018-11-18 23:59:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:58,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:59:58,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:59:58,792 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:59:58,967 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 23:59:58,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:59:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:59:58,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:59:59,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {8343#true} call ULTIMATE.init(); {8343#true} is VALID [2018-11-18 23:59:59,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {8343#true} assume true; {8343#true} is VALID [2018-11-18 23:59:59,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8343#true} {8343#true} #38#return; {8343#true} is VALID [2018-11-18 23:59:59,213 INFO L256 TraceCheckUtils]: 3: Hoare triple {8343#true} call #t~ret2 := main(); {8343#true} is VALID [2018-11-18 23:59:59,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {8343#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:59,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:59,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-18 23:59:59,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {8345#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:59,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:59,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-18 23:59:59,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {8346#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:59,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:59,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-18 23:59:59,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {8347#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:59,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:59,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-18 23:59:59,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {8348#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:59,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:59,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-18 23:59:59,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {8349#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:59,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:59,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-18 23:59:59,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {8350#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:59,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:59,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-18 23:59:59,235 INFO L273 TraceCheckUtils]: 25: Hoare triple {8351#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:59,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:59,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-18 23:59:59,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {8352#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:59,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:59,239 INFO L273 TraceCheckUtils]: 30: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-18 23:59:59,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {8353#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:59,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:59,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-18 23:59:59,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {8354#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:59,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:59,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-18 23:59:59,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {8355#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:59,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:59,249 INFO L273 TraceCheckUtils]: 39: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-18 23:59:59,250 INFO L273 TraceCheckUtils]: 40: Hoare triple {8356#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8481#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:59,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {8481#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {8481#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-18 23:59:59,251 INFO L273 TraceCheckUtils]: 42: Hoare triple {8481#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {8344#false} is VALID [2018-11-18 23:59:59,251 INFO L256 TraceCheckUtils]: 43: Hoare triple {8344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8344#false} is VALID [2018-11-18 23:59:59,251 INFO L273 TraceCheckUtils]: 44: Hoare triple {8344#false} ~cond := #in~cond; {8344#false} is VALID [2018-11-18 23:59:59,252 INFO L273 TraceCheckUtils]: 45: Hoare triple {8344#false} assume 0 == ~cond; {8344#false} is VALID [2018-11-18 23:59:59,252 INFO L273 TraceCheckUtils]: 46: Hoare triple {8344#false} assume !false; {8344#false} is VALID [2018-11-18 23:59:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:59:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:59:59,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 23:59:59,275 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-18 23:59:59,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:59:59,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 23:59:59,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:59:59,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 23:59:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 23:59:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:59:59,357 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 16 states. [2018-11-19 00:00:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:00,722 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-19 00:00:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-19 00:00:00,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-19 00:00:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:00:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2018-11-19 00:00:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:00:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2018-11-19 00:00:00,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2018-11-19 00:00:00,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:00,791 INFO L225 Difference]: With dead ends: 92 [2018-11-19 00:00:00,791 INFO L226 Difference]: Without dead ends: 87 [2018-11-19 00:00:00,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:00:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-19 00:00:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-19 00:00:00,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:00,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-19 00:00:00,857 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-19 00:00:00,857 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-19 00:00:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:00,859 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-19 00:00:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-19 00:00:00,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:00,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:00,860 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-19 00:00:00,860 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-19 00:00:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:00,861 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-19 00:00:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-19 00:00:00,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:00,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:00,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:00,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-19 00:00:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-19 00:00:00,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 47 [2018-11-19 00:00:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:00,863 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-19 00:00:00,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-19 00:00:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-19 00:00:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-19 00:00:00,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:00,863 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:00,863 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:00,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1385736802, now seen corresponding path program 12 times [2018-11-19 00:00:00,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:00,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:01,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2018-11-19 00:00:01,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {8917#true} assume true; {8917#true} is VALID [2018-11-19 00:00:01,528 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8917#true} {8917#true} #38#return; {8917#true} is VALID [2018-11-19 00:00:01,528 INFO L256 TraceCheckUtils]: 3: Hoare triple {8917#true} call #t~ret2 := main(); {8917#true} is VALID [2018-11-19 00:00:01,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {8917#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:01,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:01,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:01,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:01,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:01,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:01,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:01,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:01,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:01,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:01,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:01,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:01,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:01,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:01,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:01,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:01,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:01,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:01,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:01,544 INFO L273 TraceCheckUtils]: 23: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:01,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:01,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:01,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:01,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:01,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:01,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:01,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:01,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:01,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:01,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:01,554 INFO L273 TraceCheckUtils]: 34: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:01,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:01,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:01,557 INFO L273 TraceCheckUtils]: 37: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:01,558 INFO L273 TraceCheckUtils]: 38: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:01,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:01,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8931#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:01,561 INFO L273 TraceCheckUtils]: 41: Hoare triple {8931#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {8931#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:01,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {8931#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {8918#false} is VALID [2018-11-19 00:00:01,562 INFO L256 TraceCheckUtils]: 43: Hoare triple {8918#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8918#false} is VALID [2018-11-19 00:00:01,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {8918#false} ~cond := #in~cond; {8918#false} is VALID [2018-11-19 00:00:01,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {8918#false} assume 0 == ~cond; {8918#false} is VALID [2018-11-19 00:00:01,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2018-11-19 00:00:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:01,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:01,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:01,579 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:00:02,589 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-19 00:00:02,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:02,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:02,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2018-11-19 00:00:02,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {8917#true} assume true; {8917#true} is VALID [2018-11-19 00:00:02,748 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8917#true} {8917#true} #38#return; {8917#true} is VALID [2018-11-19 00:00:02,748 INFO L256 TraceCheckUtils]: 3: Hoare triple {8917#true} call #t~ret2 := main(); {8917#true} is VALID [2018-11-19 00:00:02,748 INFO L273 TraceCheckUtils]: 4: Hoare triple {8917#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:02,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:02,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:02,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {8919#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:02,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:02,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:02,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {8920#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:02,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:02,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:02,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {8921#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:02,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:02,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:02,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {8922#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:02,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:02,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:02,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {8923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:02,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:02,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:02,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {8924#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:02,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:02,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:02,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {8925#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:02,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:02,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:02,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {8926#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:02,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:02,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:02,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:02,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:02,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:02,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {8928#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:02,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:02,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:02,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {8929#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:02,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:02,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:02,798 INFO L273 TraceCheckUtils]: 40: Hoare triple {8930#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9055#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:02,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {9055#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {9055#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:02,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {9055#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {8918#false} is VALID [2018-11-19 00:00:02,800 INFO L256 TraceCheckUtils]: 43: Hoare triple {8918#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8918#false} is VALID [2018-11-19 00:00:02,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {8918#false} ~cond := #in~cond; {8918#false} is VALID [2018-11-19 00:00:02,801 INFO L273 TraceCheckUtils]: 45: Hoare triple {8918#false} assume 0 == ~cond; {8918#false} is VALID [2018-11-19 00:00:02,801 INFO L273 TraceCheckUtils]: 46: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2018-11-19 00:00:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:02,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:02,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-19 00:00:02,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-19 00:00:02,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:02,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-19 00:00:03,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:03,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-19 00:00:03,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-19 00:00:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:00:03,476 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 16 states. [2018-11-19 00:00:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:04,835 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-19 00:00:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-19 00:00:04,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-11-19 00:00:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:00:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-19 00:00:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-19 00:00:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-19 00:00:04,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-19 00:00:04,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:04,902 INFO L225 Difference]: With dead ends: 95 [2018-11-19 00:00:04,902 INFO L226 Difference]: Without dead ends: 90 [2018-11-19 00:00:04,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-19 00:00:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-19 00:00:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-19 00:00:04,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:04,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-19 00:00:04,956 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-19 00:00:04,956 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-19 00:00:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:04,958 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-19 00:00:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-19 00:00:04,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:04,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:04,959 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-19 00:00:04,959 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-19 00:00:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:04,961 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-19 00:00:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-19 00:00:04,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:04,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:04,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:04,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-19 00:00:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-19 00:00:04,963 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 47 [2018-11-19 00:00:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:04,963 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-19 00:00:04,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-19 00:00:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-19 00:00:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-19 00:00:04,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:04,964 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:04,964 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:04,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:04,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2022685701, now seen corresponding path program 13 times [2018-11-19 00:00:04,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:04,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:04,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:04,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:04,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:05,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {9505#true} call ULTIMATE.init(); {9505#true} is VALID [2018-11-19 00:00:05,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {9505#true} assume true; {9505#true} is VALID [2018-11-19 00:00:05,295 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9505#true} {9505#true} #38#return; {9505#true} is VALID [2018-11-19 00:00:05,295 INFO L256 TraceCheckUtils]: 3: Hoare triple {9505#true} call #t~ret2 := main(); {9505#true} is VALID [2018-11-19 00:00:05,296 INFO L273 TraceCheckUtils]: 4: Hoare triple {9505#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,317 INFO L273 TraceCheckUtils]: 32: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,321 INFO L273 TraceCheckUtils]: 37: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,323 INFO L273 TraceCheckUtils]: 40: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9520#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:05,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {9520#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {9520#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:05,327 INFO L273 TraceCheckUtils]: 45: Hoare triple {9520#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {9506#false} is VALID [2018-11-19 00:00:05,327 INFO L256 TraceCheckUtils]: 46: Hoare triple {9506#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9506#false} is VALID [2018-11-19 00:00:05,327 INFO L273 TraceCheckUtils]: 47: Hoare triple {9506#false} ~cond := #in~cond; {9506#false} is VALID [2018-11-19 00:00:05,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {9506#false} assume 0 == ~cond; {9506#false} is VALID [2018-11-19 00:00:05,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {9506#false} assume !false; {9506#false} is VALID [2018-11-19 00:00:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:05,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:05,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:00:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:05,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:05,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {9505#true} call ULTIMATE.init(); {9505#true} is VALID [2018-11-19 00:00:05,517 INFO L273 TraceCheckUtils]: 1: Hoare triple {9505#true} assume true; {9505#true} is VALID [2018-11-19 00:00:05,517 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9505#true} {9505#true} #38#return; {9505#true} is VALID [2018-11-19 00:00:05,517 INFO L256 TraceCheckUtils]: 3: Hoare triple {9505#true} call #t~ret2 := main(); {9505#true} is VALID [2018-11-19 00:00:05,517 INFO L273 TraceCheckUtils]: 4: Hoare triple {9505#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:05,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {9507#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:05,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {9508#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:05,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {9509#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:05,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {9510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:05,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {9511#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,529 INFO L273 TraceCheckUtils]: 21: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:05,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {9512#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,531 INFO L273 TraceCheckUtils]: 24: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:05,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {9513#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,534 INFO L273 TraceCheckUtils]: 27: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:05,535 INFO L273 TraceCheckUtils]: 28: Hoare triple {9514#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:05,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {9515#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:05,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {9516#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:05,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {9517#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,553 INFO L273 TraceCheckUtils]: 38: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,553 INFO L273 TraceCheckUtils]: 39: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:05,554 INFO L273 TraceCheckUtils]: 40: Hoare triple {9518#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:05,557 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9653#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:05,557 INFO L273 TraceCheckUtils]: 44: Hoare triple {9653#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {9653#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:05,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {9653#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {9506#false} is VALID [2018-11-19 00:00:05,558 INFO L256 TraceCheckUtils]: 46: Hoare triple {9506#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9506#false} is VALID [2018-11-19 00:00:05,559 INFO L273 TraceCheckUtils]: 47: Hoare triple {9506#false} ~cond := #in~cond; {9506#false} is VALID [2018-11-19 00:00:05,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {9506#false} assume 0 == ~cond; {9506#false} is VALID [2018-11-19 00:00:05,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {9506#false} assume !false; {9506#false} is VALID [2018-11-19 00:00:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:05,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:05,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-19 00:00:05,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-19 00:00:05,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:05,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-19 00:00:05,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:05,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-19 00:00:05,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-19 00:00:05,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:00:05,633 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 17 states. [2018-11-19 00:00:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:07,428 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-19 00:00:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-19 00:00:07,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-19 00:00:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:00:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 68 transitions. [2018-11-19 00:00:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:00:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 68 transitions. [2018-11-19 00:00:07,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 68 transitions. [2018-11-19 00:00:07,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:07,773 INFO L225 Difference]: With dead ends: 98 [2018-11-19 00:00:07,773 INFO L226 Difference]: Without dead ends: 93 [2018-11-19 00:00:07,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:00:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-19 00:00:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-19 00:00:07,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:07,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-19 00:00:07,847 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-19 00:00:07,847 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-19 00:00:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:07,849 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-19 00:00:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-19 00:00:07,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:07,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:07,849 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-19 00:00:07,849 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-19 00:00:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:07,851 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-19 00:00:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-19 00:00:07,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:07,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:07,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:07,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-19 00:00:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-19 00:00:07,853 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2018-11-19 00:00:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:07,853 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-19 00:00:07,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-19 00:00:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-19 00:00:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-19 00:00:07,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:07,854 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:07,855 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:07,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:07,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1350288893, now seen corresponding path program 13 times [2018-11-19 00:00:07,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:07,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:00:07,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:08,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {10117#true} call ULTIMATE.init(); {10117#true} is VALID [2018-11-19 00:00:08,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {10117#true} assume true; {10117#true} is VALID [2018-11-19 00:00:08,503 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10117#true} {10117#true} #38#return; {10117#true} is VALID [2018-11-19 00:00:08,504 INFO L256 TraceCheckUtils]: 3: Hoare triple {10117#true} call #t~ret2 := main(); {10117#true} is VALID [2018-11-19 00:00:08,504 INFO L273 TraceCheckUtils]: 4: Hoare triple {10117#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,510 INFO L273 TraceCheckUtils]: 14: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,512 INFO L273 TraceCheckUtils]: 17: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,531 INFO L273 TraceCheckUtils]: 41: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10132#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:08,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {10132#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {10132#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:08,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {10132#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {10118#false} is VALID [2018-11-19 00:00:08,534 INFO L256 TraceCheckUtils]: 46: Hoare triple {10118#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10118#false} is VALID [2018-11-19 00:00:08,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {10118#false} ~cond := #in~cond; {10118#false} is VALID [2018-11-19 00:00:08,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {10118#false} assume 0 == ~cond; {10118#false} is VALID [2018-11-19 00:00:08,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {10118#false} assume !false; {10118#false} is VALID [2018-11-19 00:00:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:08,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:08,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:00:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:08,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:08,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {10117#true} call ULTIMATE.init(); {10117#true} is VALID [2018-11-19 00:00:08,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {10117#true} assume true; {10117#true} is VALID [2018-11-19 00:00:08,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10117#true} {10117#true} #38#return; {10117#true} is VALID [2018-11-19 00:00:08,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {10117#true} call #t~ret2 := main(); {10117#true} is VALID [2018-11-19 00:00:08,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {10117#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:08,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {10119#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:08,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {10120#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:08,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {10121#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,716 INFO L273 TraceCheckUtils]: 14: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:08,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {10122#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:08,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {10123#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,721 INFO L273 TraceCheckUtils]: 21: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:08,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {10124#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:08,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {10125#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:08,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {10126#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:08,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {10127#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,730 INFO L273 TraceCheckUtils]: 33: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:08,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {10128#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:08,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {10129#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:08,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {10130#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:08,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {10131#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10265#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:08,739 INFO L273 TraceCheckUtils]: 44: Hoare triple {10265#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {10265#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:08,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {10265#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {10118#false} is VALID [2018-11-19 00:00:08,740 INFO L256 TraceCheckUtils]: 46: Hoare triple {10118#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10118#false} is VALID [2018-11-19 00:00:08,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {10118#false} ~cond := #in~cond; {10118#false} is VALID [2018-11-19 00:00:08,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {10118#false} assume 0 == ~cond; {10118#false} is VALID [2018-11-19 00:00:08,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {10118#false} assume !false; {10118#false} is VALID [2018-11-19 00:00:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:08,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:08,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-19 00:00:08,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-19 00:00:08,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:08,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-19 00:00:08,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:08,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-19 00:00:08,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-19 00:00:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:00:08,818 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 17 states. [2018-11-19 00:00:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:10,219 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-19 00:00:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:00:10,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-19 00:00:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:00:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2018-11-19 00:00:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:00:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2018-11-19 00:00:10,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2018-11-19 00:00:10,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:10,297 INFO L225 Difference]: With dead ends: 101 [2018-11-19 00:00:10,297 INFO L226 Difference]: Without dead ends: 96 [2018-11-19 00:00:10,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:00:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-19 00:00:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-19 00:00:10,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:10,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-19 00:00:10,361 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-19 00:00:10,361 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-19 00:00:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:10,363 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-19 00:00:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-19 00:00:10,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:10,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:10,364 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-19 00:00:10,364 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-19 00:00:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:10,365 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-19 00:00:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-19 00:00:10,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:10,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:10,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:10,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-19 00:00:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-19 00:00:10,367 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 50 [2018-11-19 00:00:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:10,367 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-19 00:00:10,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-19 00:00:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-19 00:00:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-19 00:00:10,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:10,368 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:10,368 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:10,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash -603854850, now seen corresponding path program 14 times [2018-11-19 00:00:10,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:10,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:10,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:10,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:00:10,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:10,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {10743#true} call ULTIMATE.init(); {10743#true} is VALID [2018-11-19 00:00:10,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {10743#true} assume true; {10743#true} is VALID [2018-11-19 00:00:10,762 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10743#true} {10743#true} #38#return; {10743#true} is VALID [2018-11-19 00:00:10,762 INFO L256 TraceCheckUtils]: 3: Hoare triple {10743#true} call #t~ret2 := main(); {10743#true} is VALID [2018-11-19 00:00:10,762 INFO L273 TraceCheckUtils]: 4: Hoare triple {10743#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:10,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:10,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:10,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:10,765 INFO L273 TraceCheckUtils]: 8: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:10,766 INFO L273 TraceCheckUtils]: 9: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:10,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:10,767 INFO L273 TraceCheckUtils]: 11: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:10,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:10,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:10,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:10,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:10,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:10,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:10,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:10,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:10,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:10,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:10,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:10,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:10,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:10,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:10,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:10,779 INFO L273 TraceCheckUtils]: 27: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:10,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:10,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:10,782 INFO L273 TraceCheckUtils]: 30: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:10,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:10,783 INFO L273 TraceCheckUtils]: 32: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:10,784 INFO L273 TraceCheckUtils]: 33: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:10,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:10,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:10,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:10,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:10,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:10,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:10,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:10,790 INFO L273 TraceCheckUtils]: 41: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:10,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:10,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:10,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:10,793 INFO L273 TraceCheckUtils]: 45: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:10,794 INFO L273 TraceCheckUtils]: 46: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10759#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:10,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {10759#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {10759#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:10,796 INFO L273 TraceCheckUtils]: 48: Hoare triple {10759#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {10744#false} is VALID [2018-11-19 00:00:10,796 INFO L256 TraceCheckUtils]: 49: Hoare triple {10744#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10744#false} is VALID [2018-11-19 00:00:10,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {10744#false} ~cond := #in~cond; {10744#false} is VALID [2018-11-19 00:00:10,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {10744#false} assume 0 == ~cond; {10744#false} is VALID [2018-11-19 00:00:10,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {10744#false} assume !false; {10744#false} is VALID [2018-11-19 00:00:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:10,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:10,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:00:10,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:00:10,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:10,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:11,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {10743#true} call ULTIMATE.init(); {10743#true} is VALID [2018-11-19 00:00:11,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {10743#true} assume true; {10743#true} is VALID [2018-11-19 00:00:11,010 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10743#true} {10743#true} #38#return; {10743#true} is VALID [2018-11-19 00:00:11,010 INFO L256 TraceCheckUtils]: 3: Hoare triple {10743#true} call #t~ret2 := main(); {10743#true} is VALID [2018-11-19 00:00:11,010 INFO L273 TraceCheckUtils]: 4: Hoare triple {10743#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:11,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:11,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:11,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {10745#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:11,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:11,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:11,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {10746#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:11,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:11,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:11,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {10747#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:11,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:11,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:11,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {10748#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:11,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:11,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:11,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:11,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:11,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:11,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {10750#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:11,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:11,024 INFO L273 TraceCheckUtils]: 24: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:11,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {10751#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:11,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:11,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:11,028 INFO L273 TraceCheckUtils]: 28: Hoare triple {10752#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:11,028 INFO L273 TraceCheckUtils]: 29: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:11,029 INFO L273 TraceCheckUtils]: 30: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:11,030 INFO L273 TraceCheckUtils]: 31: Hoare triple {10753#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:11,030 INFO L273 TraceCheckUtils]: 32: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:11,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:11,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {10754#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:11,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:11,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:11,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {10755#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:11,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:11,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:11,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {10756#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:11,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:11,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:11,039 INFO L273 TraceCheckUtils]: 43: Hoare triple {10757#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:11,040 INFO L273 TraceCheckUtils]: 44: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:11,040 INFO L273 TraceCheckUtils]: 45: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:11,041 INFO L273 TraceCheckUtils]: 46: Hoare triple {10758#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10901#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:11,042 INFO L273 TraceCheckUtils]: 47: Hoare triple {10901#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {10901#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:11,043 INFO L273 TraceCheckUtils]: 48: Hoare triple {10901#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {10744#false} is VALID [2018-11-19 00:00:11,043 INFO L256 TraceCheckUtils]: 49: Hoare triple {10744#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10744#false} is VALID [2018-11-19 00:00:11,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {10744#false} ~cond := #in~cond; {10744#false} is VALID [2018-11-19 00:00:11,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {10744#false} assume 0 == ~cond; {10744#false} is VALID [2018-11-19 00:00:11,043 INFO L273 TraceCheckUtils]: 52: Hoare triple {10744#false} assume !false; {10744#false} is VALID [2018-11-19 00:00:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:11,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:11,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-19 00:00:11,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-19 00:00:11,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:11,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-19 00:00:11,147 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:00:11,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-19 00:00:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-19 00:00:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:00:11,148 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 18 states. [2018-11-19 00:00:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:12,765 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-11-19 00:00:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:00:12,765 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-19 00:00:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:00:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2018-11-19 00:00:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:00:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2018-11-19 00:00:12,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 72 transitions. [2018-11-19 00:00:12,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:12,841 INFO L225 Difference]: With dead ends: 104 [2018-11-19 00:00:12,841 INFO L226 Difference]: Without dead ends: 99 [2018-11-19 00:00:12,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:00:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-19 00:00:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-19 00:00:12,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:12,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 98 states. [2018-11-19 00:00:12,900 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 98 states. [2018-11-19 00:00:12,900 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 98 states. [2018-11-19 00:00:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:12,902 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-19 00:00:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-19 00:00:12,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:12,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:12,902 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 99 states. [2018-11-19 00:00:12,902 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 99 states. [2018-11-19 00:00:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:12,904 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-11-19 00:00:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-11-19 00:00:12,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:12,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:12,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:12,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-19 00:00:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-11-19 00:00:12,906 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 53 [2018-11-19 00:00:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:12,907 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-11-19 00:00:12,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-19 00:00:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-11-19 00:00:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-19 00:00:12,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:12,908 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:12,908 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:12,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash 402425150, now seen corresponding path program 14 times [2018-11-19 00:00:12,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:12,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:12,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:12,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:13,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {11393#true} call ULTIMATE.init(); {11393#true} is VALID [2018-11-19 00:00:13,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {11393#true} assume true; {11393#true} is VALID [2018-11-19 00:00:13,531 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11393#true} {11393#true} #38#return; {11393#true} is VALID [2018-11-19 00:00:13,531 INFO L256 TraceCheckUtils]: 3: Hoare triple {11393#true} call #t~ret2 := main(); {11393#true} is VALID [2018-11-19 00:00:13,531 INFO L273 TraceCheckUtils]: 4: Hoare triple {11393#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,538 INFO L273 TraceCheckUtils]: 13: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,552 INFO L273 TraceCheckUtils]: 31: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,553 INFO L273 TraceCheckUtils]: 33: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,554 INFO L273 TraceCheckUtils]: 34: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,555 INFO L273 TraceCheckUtils]: 35: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,557 INFO L273 TraceCheckUtils]: 37: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,560 INFO L273 TraceCheckUtils]: 42: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,562 INFO L273 TraceCheckUtils]: 45: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,563 INFO L273 TraceCheckUtils]: 46: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11409#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:13,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {11409#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {11409#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:13,565 INFO L273 TraceCheckUtils]: 48: Hoare triple {11409#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {11394#false} is VALID [2018-11-19 00:00:13,565 INFO L256 TraceCheckUtils]: 49: Hoare triple {11394#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11394#false} is VALID [2018-11-19 00:00:13,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {11394#false} ~cond := #in~cond; {11394#false} is VALID [2018-11-19 00:00:13,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {11394#false} assume 0 == ~cond; {11394#false} is VALID [2018-11-19 00:00:13,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {11394#false} assume !false; {11394#false} is VALID [2018-11-19 00:00:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:13,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:13,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:00:13,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:00:13,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:13,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:13,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {11393#true} call ULTIMATE.init(); {11393#true} is VALID [2018-11-19 00:00:13,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {11393#true} assume true; {11393#true} is VALID [2018-11-19 00:00:13,904 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11393#true} {11393#true} #38#return; {11393#true} is VALID [2018-11-19 00:00:13,905 INFO L256 TraceCheckUtils]: 3: Hoare triple {11393#true} call #t~ret2 := main(); {11393#true} is VALID [2018-11-19 00:00:13,905 INFO L273 TraceCheckUtils]: 4: Hoare triple {11393#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:13,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {11395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:13,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {11396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:13,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {11397#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:13,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {11398#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:13,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {11399#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:13,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {11400#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:13,920 INFO L273 TraceCheckUtils]: 25: Hoare triple {11401#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:13,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {11402#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,923 INFO L273 TraceCheckUtils]: 29: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:13,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {11403#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:13,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {11404#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:13,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {11405#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:13,932 INFO L273 TraceCheckUtils]: 40: Hoare triple {11406#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,933 INFO L273 TraceCheckUtils]: 42: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:13,942 INFO L273 TraceCheckUtils]: 43: Hoare triple {11407#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:13,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {11408#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11551#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:13,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {11551#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {11551#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:13,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {11551#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {11394#false} is VALID [2018-11-19 00:00:13,945 INFO L256 TraceCheckUtils]: 49: Hoare triple {11394#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11394#false} is VALID [2018-11-19 00:00:13,945 INFO L273 TraceCheckUtils]: 50: Hoare triple {11394#false} ~cond := #in~cond; {11394#false} is VALID [2018-11-19 00:00:13,945 INFO L273 TraceCheckUtils]: 51: Hoare triple {11394#false} assume 0 == ~cond; {11394#false} is VALID [2018-11-19 00:00:13,945 INFO L273 TraceCheckUtils]: 52: Hoare triple {11394#false} assume !false; {11394#false} is VALID [2018-11-19 00:00:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:13,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:13,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-19 00:00:13,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-19 00:00:13,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:13,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-19 00:00:14,023 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:00:14,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-19 00:00:14,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-19 00:00:14,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:00:14,024 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 18 states. [2018-11-19 00:00:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:15,544 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-11-19 00:00:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-19 00:00:15,545 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-11-19 00:00:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:00:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2018-11-19 00:00:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:00:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2018-11-19 00:00:15,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2018-11-19 00:00:15,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:15,790 INFO L225 Difference]: With dead ends: 107 [2018-11-19 00:00:15,790 INFO L226 Difference]: Without dead ends: 102 [2018-11-19 00:00:15,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-19 00:00:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-19 00:00:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-19 00:00:15,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:15,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 101 states. [2018-11-19 00:00:15,895 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 101 states. [2018-11-19 00:00:15,895 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 101 states. [2018-11-19 00:00:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:15,897 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-19 00:00:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-11-19 00:00:15,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:15,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:15,898 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 102 states. [2018-11-19 00:00:15,898 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 102 states. [2018-11-19 00:00:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:15,900 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-19 00:00:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-11-19 00:00:15,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:15,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:15,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:15,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-19 00:00:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-19 00:00:15,902 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 53 [2018-11-19 00:00:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:15,902 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-19 00:00:15,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-19 00:00:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-19 00:00:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-19 00:00:15,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:15,903 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:15,903 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:15,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1012867355, now seen corresponding path program 15 times [2018-11-19 00:00:15,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:15,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:16,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2018-11-19 00:00:16,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {12057#true} assume true; {12057#true} is VALID [2018-11-19 00:00:16,308 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12057#true} {12057#true} #38#return; {12057#true} is VALID [2018-11-19 00:00:16,308 INFO L256 TraceCheckUtils]: 3: Hoare triple {12057#true} call #t~ret2 := main(); {12057#true} is VALID [2018-11-19 00:00:16,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {12057#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:16,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:16,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:16,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:16,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:16,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:16,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:16,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:16,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:16,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:16,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:16,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:16,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:16,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:16,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:16,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:16,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:16,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:16,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:16,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:16,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:16,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:16,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:16,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:16,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:16,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:16,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:16,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:16,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:16,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:16,331 INFO L273 TraceCheckUtils]: 34: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:16,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:16,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:16,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:16,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:16,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:16,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:16,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:16,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:16,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:16,338 INFO L273 TraceCheckUtils]: 44: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:16,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:16,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:16,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:16,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:16,343 INFO L273 TraceCheckUtils]: 49: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12074#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:16,343 INFO L273 TraceCheckUtils]: 50: Hoare triple {12074#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume true; {12074#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:16,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {12074#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 99); {12058#false} is VALID [2018-11-19 00:00:16,344 INFO L256 TraceCheckUtils]: 52: Hoare triple {12058#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12058#false} is VALID [2018-11-19 00:00:16,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {12058#false} ~cond := #in~cond; {12058#false} is VALID [2018-11-19 00:00:16,345 INFO L273 TraceCheckUtils]: 54: Hoare triple {12058#false} assume 0 == ~cond; {12058#false} is VALID [2018-11-19 00:00:16,345 INFO L273 TraceCheckUtils]: 55: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2018-11-19 00:00:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:16,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:16,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:16,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:00:17,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-19 00:00:17,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:17,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:18,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2018-11-19 00:00:18,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {12057#true} assume true; {12057#true} is VALID [2018-11-19 00:00:18,040 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12057#true} {12057#true} #38#return; {12057#true} is VALID [2018-11-19 00:00:18,040 INFO L256 TraceCheckUtils]: 3: Hoare triple {12057#true} call #t~ret2 := main(); {12057#true} is VALID [2018-11-19 00:00:18,041 INFO L273 TraceCheckUtils]: 4: Hoare triple {12057#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:18,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:18,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:18,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {12059#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:18,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:18,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:18,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {12060#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:18,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:18,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:18,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {12061#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:18,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:18,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:18,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {12062#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:18,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:18,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:18,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {12063#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:18,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:18,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:18,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {12064#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:18,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:18,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:18,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {12065#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:18,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:18,058 INFO L273 TraceCheckUtils]: 27: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:18,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {12066#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:18,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:18,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:18,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {12067#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:18,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:18,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:18,063 INFO L273 TraceCheckUtils]: 34: Hoare triple {12068#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:18,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:18,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:18,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {12069#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:18,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:18,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:18,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {12070#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:18,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:18,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:18,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {12071#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:18,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:18,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:18,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {12072#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:18,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:18,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:18,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {12073#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12225#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:18,075 INFO L273 TraceCheckUtils]: 50: Hoare triple {12225#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {12225#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:18,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {12225#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 99); {12058#false} is VALID [2018-11-19 00:00:18,076 INFO L256 TraceCheckUtils]: 52: Hoare triple {12058#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12058#false} is VALID [2018-11-19 00:00:18,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {12058#false} ~cond := #in~cond; {12058#false} is VALID [2018-11-19 00:00:18,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {12058#false} assume 0 == ~cond; {12058#false} is VALID [2018-11-19 00:00:18,077 INFO L273 TraceCheckUtils]: 55: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2018-11-19 00:00:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-19 00:00:18,100 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-19 00:00:18,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:18,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-19 00:00:18,158 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:00:18,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-19 00:00:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-19 00:00:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:00:18,159 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 19 states. [2018-11-19 00:00:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:20,155 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-11-19 00:00:20,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-19 00:00:20,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-19 00:00:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:00:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2018-11-19 00:00:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:00:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2018-11-19 00:00:20,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 75 transitions. [2018-11-19 00:00:20,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:20,311 INFO L225 Difference]: With dead ends: 110 [2018-11-19 00:00:20,312 INFO L226 Difference]: Without dead ends: 105 [2018-11-19 00:00:20,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:00:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-19 00:00:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-19 00:00:20,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:20,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 104 states. [2018-11-19 00:00:20,406 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 104 states. [2018-11-19 00:00:20,406 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 104 states. [2018-11-19 00:00:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:20,408 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-11-19 00:00:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-11-19 00:00:20,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:20,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:20,408 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 105 states. [2018-11-19 00:00:20,409 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 105 states. [2018-11-19 00:00:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:20,413 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-11-19 00:00:20,413 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-11-19 00:00:20,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:20,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:20,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:20,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-19 00:00:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-11-19 00:00:20,415 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 56 [2018-11-19 00:00:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:20,416 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-11-19 00:00:20,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-19 00:00:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-11-19 00:00:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-19 00:00:20,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:20,417 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:20,417 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:20,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2003628637, now seen corresponding path program 15 times [2018-11-19 00:00:20,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:20,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:20,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:20,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {12745#true} call ULTIMATE.init(); {12745#true} is VALID [2018-11-19 00:00:20,901 INFO L273 TraceCheckUtils]: 1: Hoare triple {12745#true} assume true; {12745#true} is VALID [2018-11-19 00:00:20,901 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12745#true} {12745#true} #38#return; {12745#true} is VALID [2018-11-19 00:00:20,901 INFO L256 TraceCheckUtils]: 3: Hoare triple {12745#true} call #t~ret2 := main(); {12745#true} is VALID [2018-11-19 00:00:20,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {12745#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:20,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:20,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:20,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:20,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:20,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:20,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:20,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:20,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:20,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:20,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:20,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:20,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:20,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:20,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:20,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:20,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:20,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:20,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:20,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:20,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:20,918 INFO L273 TraceCheckUtils]: 25: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:20,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:20,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:20,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:20,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:20,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:20,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:20,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:20,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:20,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:20,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:20,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:20,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:20,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:20,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:20,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:20,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:20,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:20,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:20,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:20,933 INFO L273 TraceCheckUtils]: 45: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:20,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:20,934 INFO L273 TraceCheckUtils]: 47: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:20,935 INFO L273 TraceCheckUtils]: 48: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:20,936 INFO L273 TraceCheckUtils]: 49: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12762#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:20,937 INFO L273 TraceCheckUtils]: 50: Hoare triple {12762#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {12762#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:20,938 INFO L273 TraceCheckUtils]: 51: Hoare triple {12762#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {12746#false} is VALID [2018-11-19 00:00:20,938 INFO L256 TraceCheckUtils]: 52: Hoare triple {12746#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12746#false} is VALID [2018-11-19 00:00:20,938 INFO L273 TraceCheckUtils]: 53: Hoare triple {12746#false} ~cond := #in~cond; {12746#false} is VALID [2018-11-19 00:00:20,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {12746#false} assume 0 == ~cond; {12746#false} is VALID [2018-11-19 00:00:20,938 INFO L273 TraceCheckUtils]: 55: Hoare triple {12746#false} assume !false; {12746#false} is VALID [2018-11-19 00:00:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:20,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:20,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:20,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:00:25,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-19 00:00:25,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:25,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:25,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {12745#true} call ULTIMATE.init(); {12745#true} is VALID [2018-11-19 00:00:25,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {12745#true} assume true; {12745#true} is VALID [2018-11-19 00:00:25,675 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12745#true} {12745#true} #38#return; {12745#true} is VALID [2018-11-19 00:00:25,675 INFO L256 TraceCheckUtils]: 3: Hoare triple {12745#true} call #t~ret2 := main(); {12745#true} is VALID [2018-11-19 00:00:25,675 INFO L273 TraceCheckUtils]: 4: Hoare triple {12745#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:25,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:25,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:25,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {12747#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:25,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:25,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:25,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {12748#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:25,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:25,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:25,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {12749#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:25,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:25,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:25,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {12750#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:25,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:25,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:25,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {12751#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:25,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:25,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:25,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {12752#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:25,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:25,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:25,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {12753#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:25,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:25,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:25,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {12754#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:25,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:25,695 INFO L273 TraceCheckUtils]: 30: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:25,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {12755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:25,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:25,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:25,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {12756#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:25,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:25,699 INFO L273 TraceCheckUtils]: 36: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:25,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {12757#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:25,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:25,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:25,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {12758#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:25,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:25,704 INFO L273 TraceCheckUtils]: 42: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:25,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {12759#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:25,706 INFO L273 TraceCheckUtils]: 44: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:25,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:25,707 INFO L273 TraceCheckUtils]: 46: Hoare triple {12760#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:25,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:25,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:25,710 INFO L273 TraceCheckUtils]: 49: Hoare triple {12761#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12913#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:25,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {12913#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {12913#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:25,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {12913#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 99); {12746#false} is VALID [2018-11-19 00:00:25,711 INFO L256 TraceCheckUtils]: 52: Hoare triple {12746#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12746#false} is VALID [2018-11-19 00:00:25,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {12746#false} ~cond := #in~cond; {12746#false} is VALID [2018-11-19 00:00:25,712 INFO L273 TraceCheckUtils]: 54: Hoare triple {12746#false} assume 0 == ~cond; {12746#false} is VALID [2018-11-19 00:00:25,712 INFO L273 TraceCheckUtils]: 55: Hoare triple {12746#false} assume !false; {12746#false} is VALID [2018-11-19 00:00:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:25,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-19 00:00:25,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-19 00:00:25,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:25,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-19 00:00:25,794 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:00:25,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-19 00:00:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-19 00:00:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:00:25,795 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 19 states. [2018-11-19 00:00:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:27,437 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-11-19 00:00:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-19 00:00:27,437 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-11-19 00:00:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:00:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-19 00:00:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:00:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2018-11-19 00:00:27,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 71 transitions. [2018-11-19 00:00:27,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:27,511 INFO L225 Difference]: With dead ends: 113 [2018-11-19 00:00:27,511 INFO L226 Difference]: Without dead ends: 108 [2018-11-19 00:00:27,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:00:27,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-19 00:00:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-19 00:00:27,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:27,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-19 00:00:27,588 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-19 00:00:27,588 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-19 00:00:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:27,590 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-19 00:00:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-11-19 00:00:27,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:27,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:27,591 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-19 00:00:27,592 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-19 00:00:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:27,594 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-11-19 00:00:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-11-19 00:00:27,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:27,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:27,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:27,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-19 00:00:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-11-19 00:00:27,596 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 56 [2018-11-19 00:00:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:27,596 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-11-19 00:00:27,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-19 00:00:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-11-19 00:00:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-19 00:00:27,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:27,597 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:27,597 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:27,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1020819166, now seen corresponding path program 16 times [2018-11-19 00:00:27,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:27,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:27,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:28,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {13447#true} call ULTIMATE.init(); {13447#true} is VALID [2018-11-19 00:00:28,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {13447#true} assume true; {13447#true} is VALID [2018-11-19 00:00:28,969 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13447#true} {13447#true} #38#return; {13447#true} is VALID [2018-11-19 00:00:28,969 INFO L256 TraceCheckUtils]: 3: Hoare triple {13447#true} call #t~ret2 := main(); {13447#true} is VALID [2018-11-19 00:00:28,969 INFO L273 TraceCheckUtils]: 4: Hoare triple {13447#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:28,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:28,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:28,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:28,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:28,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:28,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:28,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:28,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:28,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:28,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:28,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:28,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:28,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:28,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:28,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:28,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:28,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:28,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:28,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:28,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:28,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:28,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:28,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:28,987 INFO L273 TraceCheckUtils]: 28: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:28,988 INFO L273 TraceCheckUtils]: 29: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:28,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:28,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:28,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:28,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:28,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:28,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:28,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:28,994 INFO L273 TraceCheckUtils]: 37: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:28,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:28,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:28,996 INFO L273 TraceCheckUtils]: 40: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:28,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:28,998 INFO L273 TraceCheckUtils]: 42: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:28,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:28,999 INFO L273 TraceCheckUtils]: 44: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:29,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:29,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,002 INFO L273 TraceCheckUtils]: 47: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,003 INFO L273 TraceCheckUtils]: 49: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13465#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:29,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {13465#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {13465#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:29,007 INFO L273 TraceCheckUtils]: 54: Hoare triple {13465#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {13448#false} is VALID [2018-11-19 00:00:29,007 INFO L256 TraceCheckUtils]: 55: Hoare triple {13448#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13448#false} is VALID [2018-11-19 00:00:29,008 INFO L273 TraceCheckUtils]: 56: Hoare triple {13448#false} ~cond := #in~cond; {13448#false} is VALID [2018-11-19 00:00:29,008 INFO L273 TraceCheckUtils]: 57: Hoare triple {13448#false} assume 0 == ~cond; {13448#false} is VALID [2018-11-19 00:00:29,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {13448#false} assume !false; {13448#false} is VALID [2018-11-19 00:00:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:29,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:29,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:29,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:00:29,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:00:29,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:29,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:29,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {13447#true} call ULTIMATE.init(); {13447#true} is VALID [2018-11-19 00:00:29,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {13447#true} assume true; {13447#true} is VALID [2018-11-19 00:00:29,193 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13447#true} {13447#true} #38#return; {13447#true} is VALID [2018-11-19 00:00:29,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {13447#true} call #t~ret2 := main(); {13447#true} is VALID [2018-11-19 00:00:29,194 INFO L273 TraceCheckUtils]: 4: Hoare triple {13447#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:29,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:29,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:29,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {13449#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:29,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:29,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:29,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {13450#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:29,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:29,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:29,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {13451#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:29,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:29,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:29,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {13452#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:29,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:29,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:29,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {13453#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:29,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:29,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:29,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {13454#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:29,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:29,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:29,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {13455#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:29,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:29,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:29,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {13456#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:29,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:29,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:29,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {13457#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:29,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:29,215 INFO L273 TraceCheckUtils]: 33: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:29,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {13458#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:29,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:29,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:29,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {13459#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:29,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:29,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:29,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {13460#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:29,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:29,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:29,222 INFO L273 TraceCheckUtils]: 43: Hoare triple {13461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:29,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:29,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:29,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {13462#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,225 INFO L273 TraceCheckUtils]: 47: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:29,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {13463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:29,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {13464#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:29,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {13625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {13625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:29,231 INFO L273 TraceCheckUtils]: 54: Hoare triple {13625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {13448#false} is VALID [2018-11-19 00:00:29,231 INFO L256 TraceCheckUtils]: 55: Hoare triple {13448#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13448#false} is VALID [2018-11-19 00:00:29,231 INFO L273 TraceCheckUtils]: 56: Hoare triple {13448#false} ~cond := #in~cond; {13448#false} is VALID [2018-11-19 00:00:29,231 INFO L273 TraceCheckUtils]: 57: Hoare triple {13448#false} assume 0 == ~cond; {13448#false} is VALID [2018-11-19 00:00:29,231 INFO L273 TraceCheckUtils]: 58: Hoare triple {13448#false} assume !false; {13448#false} is VALID [2018-11-19 00:00:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:29,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:29,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-19 00:00:29,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-19 00:00:29,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:29,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-19 00:00:29,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:29,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-19 00:00:29,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-19 00:00:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:00:29,324 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 20 states. [2018-11-19 00:00:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:31,611 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-11-19 00:00:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-19 00:00:31,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-19 00:00:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:00:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-19 00:00:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:00:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-19 00:00:31,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2018-11-19 00:00:31,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:31,695 INFO L225 Difference]: With dead ends: 116 [2018-11-19 00:00:31,696 INFO L226 Difference]: Without dead ends: 111 [2018-11-19 00:00:31,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:00:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-19 00:00:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-19 00:00:31,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:31,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 110 states. [2018-11-19 00:00:31,771 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 110 states. [2018-11-19 00:00:31,771 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 110 states. [2018-11-19 00:00:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:31,773 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-19 00:00:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-19 00:00:31,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:31,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:31,774 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 111 states. [2018-11-19 00:00:31,774 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 111 states. [2018-11-19 00:00:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:31,776 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-11-19 00:00:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-11-19 00:00:31,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:31,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:31,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:31,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-19 00:00:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-19 00:00:31,779 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 59 [2018-11-19 00:00:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:31,779 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-19 00:00:31,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-19 00:00:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-19 00:00:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-19 00:00:31,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:31,780 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:31,780 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:31,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -745046818, now seen corresponding path program 16 times [2018-11-19 00:00:31,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:31,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:31,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:31,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:31,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:32,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2018-11-19 00:00:32,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-19 00:00:32,430 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14173#true} {14173#true} #38#return; {14173#true} is VALID [2018-11-19 00:00:32,431 INFO L256 TraceCheckUtils]: 3: Hoare triple {14173#true} call #t~ret2 := main(); {14173#true} is VALID [2018-11-19 00:00:32,431 INFO L273 TraceCheckUtils]: 4: Hoare triple {14173#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,432 INFO L273 TraceCheckUtils]: 5: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,440 INFO L273 TraceCheckUtils]: 17: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,441 INFO L273 TraceCheckUtils]: 18: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,443 INFO L273 TraceCheckUtils]: 21: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,449 INFO L273 TraceCheckUtils]: 28: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,449 INFO L273 TraceCheckUtils]: 29: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,452 INFO L273 TraceCheckUtils]: 33: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,454 INFO L273 TraceCheckUtils]: 35: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,454 INFO L273 TraceCheckUtils]: 36: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,465 INFO L273 TraceCheckUtils]: 50: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,467 INFO L273 TraceCheckUtils]: 52: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14191#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:32,468 INFO L273 TraceCheckUtils]: 53: Hoare triple {14191#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {14191#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:32,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {14191#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {14174#false} is VALID [2018-11-19 00:00:32,469 INFO L256 TraceCheckUtils]: 55: Hoare triple {14174#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14174#false} is VALID [2018-11-19 00:00:32,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {14174#false} ~cond := #in~cond; {14174#false} is VALID [2018-11-19 00:00:32,469 INFO L273 TraceCheckUtils]: 57: Hoare triple {14174#false} assume 0 == ~cond; {14174#false} is VALID [2018-11-19 00:00:32,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2018-11-19 00:00:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:32,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:32,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:32,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:00:32,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:00:32,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:32,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:32,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {14173#true} call ULTIMATE.init(); {14173#true} is VALID [2018-11-19 00:00:32,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {14173#true} assume true; {14173#true} is VALID [2018-11-19 00:00:32,658 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14173#true} {14173#true} #38#return; {14173#true} is VALID [2018-11-19 00:00:32,658 INFO L256 TraceCheckUtils]: 3: Hoare triple {14173#true} call #t~ret2 := main(); {14173#true} is VALID [2018-11-19 00:00:32,658 INFO L273 TraceCheckUtils]: 4: Hoare triple {14173#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:32,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {14175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:32,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {14176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:32,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {14177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:32,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {14178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:32,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {14179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:32,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {14180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,673 INFO L273 TraceCheckUtils]: 23: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:32,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {14181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,677 INFO L273 TraceCheckUtils]: 27: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:32,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {14182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,679 INFO L273 TraceCheckUtils]: 30: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:32,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {14183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:32,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {14184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,684 INFO L273 TraceCheckUtils]: 35: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:32,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {14185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:32,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {14186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,690 INFO L273 TraceCheckUtils]: 42: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:32,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {14187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,692 INFO L273 TraceCheckUtils]: 44: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:32,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {14188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:32,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {14189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:32,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {14190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14351#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:00:32,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {14351#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {14351#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:00:32,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {14351#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {14174#false} is VALID [2018-11-19 00:00:32,722 INFO L256 TraceCheckUtils]: 55: Hoare triple {14174#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14174#false} is VALID [2018-11-19 00:00:32,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {14174#false} ~cond := #in~cond; {14174#false} is VALID [2018-11-19 00:00:32,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {14174#false} assume 0 == ~cond; {14174#false} is VALID [2018-11-19 00:00:32,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {14174#false} assume !false; {14174#false} is VALID [2018-11-19 00:00:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:32,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:32,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-19 00:00:32,745 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-19 00:00:32,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:32,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-19 00:00:32,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:32,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-19 00:00:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-19 00:00:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:00:32,809 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 20 states. [2018-11-19 00:00:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:34,606 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-11-19 00:00:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-19 00:00:34,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-11-19 00:00:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:00:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-19 00:00:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-19 00:00:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 74 transitions. [2018-11-19 00:00:34,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 74 transitions. [2018-11-19 00:00:34,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:34,681 INFO L225 Difference]: With dead ends: 119 [2018-11-19 00:00:34,681 INFO L226 Difference]: Without dead ends: 114 [2018-11-19 00:00:34,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-19 00:00:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-19 00:00:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-19 00:00:34,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:34,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 113 states. [2018-11-19 00:00:34,748 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 113 states. [2018-11-19 00:00:34,748 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 113 states. [2018-11-19 00:00:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:34,751 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-19 00:00:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-19 00:00:34,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:34,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:34,751 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 114 states. [2018-11-19 00:00:34,752 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 114 states. [2018-11-19 00:00:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:34,753 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-11-19 00:00:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-11-19 00:00:34,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:34,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:34,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:34,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-19 00:00:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-11-19 00:00:34,755 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 59 [2018-11-19 00:00:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:34,756 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-11-19 00:00:34,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-19 00:00:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-11-19 00:00:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-19 00:00:34,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:34,756 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:34,757 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1690019387, now seen corresponding path program 17 times [2018-11-19 00:00:34,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:34,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:34,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:35,472 INFO L256 TraceCheckUtils]: 0: Hoare triple {14913#true} call ULTIMATE.init(); {14913#true} is VALID [2018-11-19 00:00:35,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {14913#true} assume true; {14913#true} is VALID [2018-11-19 00:00:35,473 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14913#true} {14913#true} #38#return; {14913#true} is VALID [2018-11-19 00:00:35,473 INFO L256 TraceCheckUtils]: 3: Hoare triple {14913#true} call #t~ret2 := main(); {14913#true} is VALID [2018-11-19 00:00:35,474 INFO L273 TraceCheckUtils]: 4: Hoare triple {14913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:35,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:35,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:35,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:35,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:35,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:35,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:35,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:35,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:35,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:35,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:35,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:35,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:35,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:35,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:35,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:35,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:35,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:35,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:35,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:35,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:35,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:35,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:35,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:35,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:35,493 INFO L273 TraceCheckUtils]: 29: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:35,493 INFO L273 TraceCheckUtils]: 30: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:35,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:35,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:35,495 INFO L273 TraceCheckUtils]: 33: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:35,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:35,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:35,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:35,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:35,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:35,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:35,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:35,502 INFO L273 TraceCheckUtils]: 41: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:35,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:35,503 INFO L273 TraceCheckUtils]: 43: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:35,504 INFO L273 TraceCheckUtils]: 44: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:35,505 INFO L273 TraceCheckUtils]: 45: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:35,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:35,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:35,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:35,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:35,510 INFO L273 TraceCheckUtils]: 50: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:35,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:35,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:35,512 INFO L273 TraceCheckUtils]: 53: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:35,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:35,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14932#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:35,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {14932#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {14932#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:35,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {14932#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {14914#false} is VALID [2018-11-19 00:00:35,516 INFO L256 TraceCheckUtils]: 58: Hoare triple {14914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14914#false} is VALID [2018-11-19 00:00:35,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {14914#false} ~cond := #in~cond; {14914#false} is VALID [2018-11-19 00:00:35,516 INFO L273 TraceCheckUtils]: 60: Hoare triple {14914#false} assume 0 == ~cond; {14914#false} is VALID [2018-11-19 00:00:35,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {14914#false} assume !false; {14914#false} is VALID [2018-11-19 00:00:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:35,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:35,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:00:39,569 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-19 00:00:39,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:00:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:39,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:00:39,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {14913#true} call ULTIMATE.init(); {14913#true} is VALID [2018-11-19 00:00:39,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {14913#true} assume true; {14913#true} is VALID [2018-11-19 00:00:39,754 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14913#true} {14913#true} #38#return; {14913#true} is VALID [2018-11-19 00:00:39,754 INFO L256 TraceCheckUtils]: 3: Hoare triple {14913#true} call #t~ret2 := main(); {14913#true} is VALID [2018-11-19 00:00:39,755 INFO L273 TraceCheckUtils]: 4: Hoare triple {14913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:39,755 INFO L273 TraceCheckUtils]: 5: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:39,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:39,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {14915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:39,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:39,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:00:39,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {14916#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:39,759 INFO L273 TraceCheckUtils]: 11: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:39,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:39,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {14917#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:39,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:39,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:00:39,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {14918#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:39,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:39,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:39,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {14919#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:39,766 INFO L273 TraceCheckUtils]: 20: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:39,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:00:39,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {14920#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:39,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:39,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:39,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {14921#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:39,770 INFO L273 TraceCheckUtils]: 26: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:39,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:00:39,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {14922#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:39,772 INFO L273 TraceCheckUtils]: 29: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:39,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:39,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {14923#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:39,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:39,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:00:39,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {14924#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:39,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:39,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:39,779 INFO L273 TraceCheckUtils]: 37: Hoare triple {14925#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:39,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:39,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:00:39,781 INFO L273 TraceCheckUtils]: 40: Hoare triple {14926#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:39,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:39,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:39,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {14927#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:39,784 INFO L273 TraceCheckUtils]: 44: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:39,784 INFO L273 TraceCheckUtils]: 45: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:00:39,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {14928#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:39,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:39,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:39,788 INFO L273 TraceCheckUtils]: 49: Hoare triple {14929#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:39,788 INFO L273 TraceCheckUtils]: 50: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:39,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:00:39,790 INFO L273 TraceCheckUtils]: 52: Hoare triple {14930#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:39,791 INFO L273 TraceCheckUtils]: 53: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:39,791 INFO L273 TraceCheckUtils]: 54: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:39,792 INFO L273 TraceCheckUtils]: 55: Hoare triple {14931#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15101#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:00:39,793 INFO L273 TraceCheckUtils]: 56: Hoare triple {15101#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {15101#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:00:39,794 INFO L273 TraceCheckUtils]: 57: Hoare triple {15101#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {14914#false} is VALID [2018-11-19 00:00:39,794 INFO L256 TraceCheckUtils]: 58: Hoare triple {14914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14914#false} is VALID [2018-11-19 00:00:39,794 INFO L273 TraceCheckUtils]: 59: Hoare triple {14914#false} ~cond := #in~cond; {14914#false} is VALID [2018-11-19 00:00:39,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {14914#false} assume 0 == ~cond; {14914#false} is VALID [2018-11-19 00:00:39,795 INFO L273 TraceCheckUtils]: 61: Hoare triple {14914#false} assume !false; {14914#false} is VALID [2018-11-19 00:00:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:39,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:00:39,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-19 00:00:39,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-19 00:00:39,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:00:39,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-19 00:00:39,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:39,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-19 00:00:39,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-19 00:00:39,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:00:39,911 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 21 states. [2018-11-19 00:00:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:42,447 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-11-19 00:00:42,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-19 00:00:42,447 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-19 00:00:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:00:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:00:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2018-11-19 00:00:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:00:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 82 transitions. [2018-11-19 00:00:42,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 82 transitions. [2018-11-19 00:00:42,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:00:42,542 INFO L225 Difference]: With dead ends: 122 [2018-11-19 00:00:42,542 INFO L226 Difference]: Without dead ends: 117 [2018-11-19 00:00:42,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:00:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-19 00:00:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-19 00:00:42,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:00:42,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 116 states. [2018-11-19 00:00:42,635 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 116 states. [2018-11-19 00:00:42,635 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 116 states. [2018-11-19 00:00:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:42,638 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-11-19 00:00:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-11-19 00:00:42,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:42,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:42,639 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 117 states. [2018-11-19 00:00:42,639 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 117 states. [2018-11-19 00:00:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:00:42,640 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-11-19 00:00:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-11-19 00:00:42,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:00:42,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:00:42,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:00:42,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:00:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-19 00:00:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-11-19 00:00:42,642 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 62 [2018-11-19 00:00:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:00:42,643 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-11-19 00:00:42,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-19 00:00:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-11-19 00:00:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-19 00:00:42,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:00:42,643 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:00:42,643 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:00:42,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:00:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1310938813, now seen corresponding path program 17 times [2018-11-19 00:00:42,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:00:42,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:00:42,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:42,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:00:42,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:00:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:00:43,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {15677#true} call ULTIMATE.init(); {15677#true} is VALID [2018-11-19 00:00:43,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {15677#true} assume true; {15677#true} is VALID [2018-11-19 00:00:43,139 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15677#true} {15677#true} #38#return; {15677#true} is VALID [2018-11-19 00:00:43,140 INFO L256 TraceCheckUtils]: 3: Hoare triple {15677#true} call #t~ret2 := main(); {15677#true} is VALID [2018-11-19 00:00:43,146 INFO L273 TraceCheckUtils]: 4: Hoare triple {15677#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:43,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:43,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:00:43,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:43,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:43,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:00:43,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:43,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:43,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:00:43,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:43,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:43,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:00:43,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:43,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:43,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:00:43,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:43,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:43,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:00:43,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:43,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:43,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:00:43,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:43,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:43,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:00:43,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:43,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:43,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:00:43,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:43,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:43,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:00:43,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:43,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:43,170 INFO L273 TraceCheckUtils]: 36: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:00:43,171 INFO L273 TraceCheckUtils]: 37: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:43,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:43,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:00:43,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:43,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:43,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:00:43,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:43,177 INFO L273 TraceCheckUtils]: 44: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:43,177 INFO L273 TraceCheckUtils]: 45: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:00:43,178 INFO L273 TraceCheckUtils]: 46: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:43,179 INFO L273 TraceCheckUtils]: 47: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:43,179 INFO L273 TraceCheckUtils]: 48: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:00:43,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:43,181 INFO L273 TraceCheckUtils]: 50: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:43,182 INFO L273 TraceCheckUtils]: 51: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:00:43,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:00:43,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:00:43,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:00:43,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15696#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:43,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {15696#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {15696#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:00:43,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {15696#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {15678#false} is VALID [2018-11-19 00:00:43,193 INFO L256 TraceCheckUtils]: 58: Hoare triple {15678#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15678#false} is VALID [2018-11-19 00:00:43,193 INFO L273 TraceCheckUtils]: 59: Hoare triple {15678#false} ~cond := #in~cond; {15678#false} is VALID [2018-11-19 00:00:43,193 INFO L273 TraceCheckUtils]: 60: Hoare triple {15678#false} assume 0 == ~cond; {15678#false} is VALID [2018-11-19 00:00:43,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {15678#false} assume !false; {15678#false} is VALID [2018-11-19 00:00:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:00:43,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:00:43,198 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:00:43,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:01:19,959 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-19 00:01:19,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:01:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:20,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:20,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {15677#true} call ULTIMATE.init(); {15677#true} is VALID [2018-11-19 00:01:20,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {15677#true} assume true; {15677#true} is VALID [2018-11-19 00:01:20,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15677#true} {15677#true} #38#return; {15677#true} is VALID [2018-11-19 00:01:20,184 INFO L256 TraceCheckUtils]: 3: Hoare triple {15677#true} call #t~ret2 := main(); {15677#true} is VALID [2018-11-19 00:01:20,184 INFO L273 TraceCheckUtils]: 4: Hoare triple {15677#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:20,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:20,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:20,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {15679#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:20,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:20,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:20,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {15680#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:20,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:20,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:20,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {15681#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:20,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:20,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:20,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {15682#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:20,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:20,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:20,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {15683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:20,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:20,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:20,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {15684#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:20,197 INFO L273 TraceCheckUtils]: 23: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:20,198 INFO L273 TraceCheckUtils]: 24: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:20,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {15685#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:20,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:20,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:20,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {15686#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:20,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:20,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:20,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {15687#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:20,204 INFO L273 TraceCheckUtils]: 32: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:20,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:20,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {15688#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:20,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:20,207 INFO L273 TraceCheckUtils]: 36: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:20,208 INFO L273 TraceCheckUtils]: 37: Hoare triple {15689#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:20,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:20,209 INFO L273 TraceCheckUtils]: 39: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:20,225 INFO L273 TraceCheckUtils]: 40: Hoare triple {15690#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:20,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:20,252 INFO L273 TraceCheckUtils]: 42: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:20,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {15691#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:20,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:20,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:20,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {15692#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:20,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:20,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:20,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {15693#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:20,256 INFO L273 TraceCheckUtils]: 50: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:20,257 INFO L273 TraceCheckUtils]: 51: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:20,258 INFO L273 TraceCheckUtils]: 52: Hoare triple {15694#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:20,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:20,259 INFO L273 TraceCheckUtils]: 54: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:20,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {15695#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15865#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:20,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {15865#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {15865#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:20,262 INFO L273 TraceCheckUtils]: 57: Hoare triple {15865#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(~x~0 % 4294967296 < 99); {15678#false} is VALID [2018-11-19 00:01:20,262 INFO L256 TraceCheckUtils]: 58: Hoare triple {15678#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15678#false} is VALID [2018-11-19 00:01:20,262 INFO L273 TraceCheckUtils]: 59: Hoare triple {15678#false} ~cond := #in~cond; {15678#false} is VALID [2018-11-19 00:01:20,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {15678#false} assume 0 == ~cond; {15678#false} is VALID [2018-11-19 00:01:20,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {15678#false} assume !false; {15678#false} is VALID [2018-11-19 00:01:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:20,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:20,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-19 00:01:20,289 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-19 00:01:20,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:20,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-19 00:01:20,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:20,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-19 00:01:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-19 00:01:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:01:20,354 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 21 states. [2018-11-19 00:01:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:22,455 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-11-19 00:01:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-19 00:01:22,455 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-11-19 00:01:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:01:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 77 transitions. [2018-11-19 00:01:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:01:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 77 transitions. [2018-11-19 00:01:22,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 77 transitions. [2018-11-19 00:01:22,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:22,534 INFO L225 Difference]: With dead ends: 125 [2018-11-19 00:01:22,534 INFO L226 Difference]: Without dead ends: 120 [2018-11-19 00:01:22,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:01:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-19 00:01:22,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-19 00:01:22,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:01:22,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 119 states. [2018-11-19 00:01:22,632 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 119 states. [2018-11-19 00:01:22,632 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 119 states. [2018-11-19 00:01:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:22,634 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-11-19 00:01:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-11-19 00:01:22,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:22,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:22,635 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 120 states. [2018-11-19 00:01:22,636 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 120 states. [2018-11-19 00:01:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:22,637 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-11-19 00:01:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-11-19 00:01:22,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:22,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:22,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:01:22,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:01:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-19 00:01:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-11-19 00:01:22,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 62 [2018-11-19 00:01:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:01:22,640 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-11-19 00:01:22,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-19 00:01:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-11-19 00:01:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-19 00:01:22,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:01:22,641 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:01:22,641 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:01:22,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:01:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash 595615166, now seen corresponding path program 18 times [2018-11-19 00:01:22,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:01:22,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:01:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:22,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:01:22,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:23,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {16455#true} call ULTIMATE.init(); {16455#true} is VALID [2018-11-19 00:01:23,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {16455#true} assume true; {16455#true} is VALID [2018-11-19 00:01:23,135 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16455#true} {16455#true} #38#return; {16455#true} is VALID [2018-11-19 00:01:23,136 INFO L256 TraceCheckUtils]: 3: Hoare triple {16455#true} call #t~ret2 := main(); {16455#true} is VALID [2018-11-19 00:01:23,136 INFO L273 TraceCheckUtils]: 4: Hoare triple {16455#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:23,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:23,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:23,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:23,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:23,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:23,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:23,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:23,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:23,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:23,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:23,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:23,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:23,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:23,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:23,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:23,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:23,148 INFO L273 TraceCheckUtils]: 21: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:23,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:23,150 INFO L273 TraceCheckUtils]: 23: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:23,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:23,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:23,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:23,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:23,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:23,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:23,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:23,159 INFO L273 TraceCheckUtils]: 31: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:23,160 INFO L273 TraceCheckUtils]: 32: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:23,160 INFO L273 TraceCheckUtils]: 33: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:23,161 INFO L273 TraceCheckUtils]: 34: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:23,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:23,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:23,163 INFO L273 TraceCheckUtils]: 37: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:23,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:23,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:23,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:23,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:23,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:23,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:23,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:23,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:23,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:23,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:23,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:23,173 INFO L273 TraceCheckUtils]: 49: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:23,173 INFO L273 TraceCheckUtils]: 50: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:23,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:23,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:23,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:23,176 INFO L273 TraceCheckUtils]: 54: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:23,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:23,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:23,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:23,179 INFO L273 TraceCheckUtils]: 58: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16475#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:23,180 INFO L273 TraceCheckUtils]: 59: Hoare triple {16475#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {16475#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:23,181 INFO L273 TraceCheckUtils]: 60: Hoare triple {16475#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {16456#false} is VALID [2018-11-19 00:01:23,181 INFO L256 TraceCheckUtils]: 61: Hoare triple {16456#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16456#false} is VALID [2018-11-19 00:01:23,181 INFO L273 TraceCheckUtils]: 62: Hoare triple {16456#false} ~cond := #in~cond; {16456#false} is VALID [2018-11-19 00:01:23,181 INFO L273 TraceCheckUtils]: 63: Hoare triple {16456#false} assume 0 == ~cond; {16456#false} is VALID [2018-11-19 00:01:23,182 INFO L273 TraceCheckUtils]: 64: Hoare triple {16456#false} assume !false; {16456#false} is VALID [2018-11-19 00:01:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:23,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:01:23,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:01:23,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:01:36,386 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-19 00:01:36,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:01:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:36,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:36,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {16455#true} call ULTIMATE.init(); {16455#true} is VALID [2018-11-19 00:01:36,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {16455#true} assume true; {16455#true} is VALID [2018-11-19 00:01:36,760 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16455#true} {16455#true} #38#return; {16455#true} is VALID [2018-11-19 00:01:36,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {16455#true} call #t~ret2 := main(); {16455#true} is VALID [2018-11-19 00:01:36,761 INFO L273 TraceCheckUtils]: 4: Hoare triple {16455#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:36,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:36,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:36,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {16457#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:36,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:36,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:36,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {16458#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:36,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:36,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:36,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {16459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:36,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:36,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:36,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {16460#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:36,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:36,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:36,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {16461#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:36,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:36,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:36,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {16462#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:36,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:36,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:36,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {16463#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:36,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:36,810 INFO L273 TraceCheckUtils]: 27: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:36,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {16464#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:36,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:36,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:36,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {16465#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:36,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:36,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:36,816 INFO L273 TraceCheckUtils]: 34: Hoare triple {16466#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:36,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:36,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:36,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {16467#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:36,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:36,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:36,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {16468#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:36,821 INFO L273 TraceCheckUtils]: 41: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:36,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:36,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {16469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:36,823 INFO L273 TraceCheckUtils]: 44: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:36,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:36,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {16470#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:36,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:36,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:36,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {16471#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:36,828 INFO L273 TraceCheckUtils]: 50: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:36,829 INFO L273 TraceCheckUtils]: 51: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:36,830 INFO L273 TraceCheckUtils]: 52: Hoare triple {16472#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:36,830 INFO L273 TraceCheckUtils]: 53: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:36,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:36,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {16473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:36,833 INFO L273 TraceCheckUtils]: 56: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:36,833 INFO L273 TraceCheckUtils]: 57: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:36,834 INFO L273 TraceCheckUtils]: 58: Hoare triple {16474#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:36,835 INFO L273 TraceCheckUtils]: 59: Hoare triple {16653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {16653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:36,836 INFO L273 TraceCheckUtils]: 60: Hoare triple {16653#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {16456#false} is VALID [2018-11-19 00:01:36,836 INFO L256 TraceCheckUtils]: 61: Hoare triple {16456#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16456#false} is VALID [2018-11-19 00:01:36,836 INFO L273 TraceCheckUtils]: 62: Hoare triple {16456#false} ~cond := #in~cond; {16456#false} is VALID [2018-11-19 00:01:36,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {16456#false} assume 0 == ~cond; {16456#false} is VALID [2018-11-19 00:01:36,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {16456#false} assume !false; {16456#false} is VALID [2018-11-19 00:01:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:36,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:36,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-19 00:01:36,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-19 00:01:36,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:36,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-19 00:01:36,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:36,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-19 00:01:36,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-19 00:01:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:01:36,929 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 22 states. [2018-11-19 00:01:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:39,538 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-11-19 00:01:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-19 00:01:39,538 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-19 00:01:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:01:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2018-11-19 00:01:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:01:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 86 transitions. [2018-11-19 00:01:39,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 86 transitions. [2018-11-19 00:01:39,686 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:01:39,688 INFO L225 Difference]: With dead ends: 128 [2018-11-19 00:01:39,688 INFO L226 Difference]: Without dead ends: 123 [2018-11-19 00:01:39,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:01:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-19 00:01:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-19 00:01:39,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:01:39,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-19 00:01:39,789 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-19 00:01:39,789 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-19 00:01:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:39,791 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-19 00:01:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-19 00:01:39,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:39,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:39,792 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-19 00:01:39,792 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-19 00:01:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:39,793 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-11-19 00:01:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-11-19 00:01:39,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:39,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:39,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:01:39,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:01:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-19 00:01:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-11-19 00:01:39,796 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 65 [2018-11-19 00:01:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:01:39,796 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-11-19 00:01:39,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-19 00:01:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-11-19 00:01:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-19 00:01:39,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:01:39,797 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:01:39,797 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:01:39,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:01:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash 650263678, now seen corresponding path program 18 times [2018-11-19 00:01:39,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:01:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:01:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:39,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:01:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:40,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {17257#true} call ULTIMATE.init(); {17257#true} is VALID [2018-11-19 00:01:40,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {17257#true} assume true; {17257#true} is VALID [2018-11-19 00:01:40,279 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17257#true} {17257#true} #38#return; {17257#true} is VALID [2018-11-19 00:01:40,279 INFO L256 TraceCheckUtils]: 3: Hoare triple {17257#true} call #t~ret2 := main(); {17257#true} is VALID [2018-11-19 00:01:40,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {17257#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:40,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:40,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:40,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:40,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:40,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:40,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:40,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:40,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:40,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:40,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:40,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:40,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:40,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:40,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:40,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:40,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:40,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:40,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:40,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:40,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:40,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:40,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:40,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:40,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:40,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:40,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:40,299 INFO L273 TraceCheckUtils]: 31: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:40,300 INFO L273 TraceCheckUtils]: 32: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:40,300 INFO L273 TraceCheckUtils]: 33: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:40,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:40,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:40,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:40,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:40,304 INFO L273 TraceCheckUtils]: 38: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:40,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:40,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:40,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:40,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:40,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:40,309 INFO L273 TraceCheckUtils]: 44: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:40,309 INFO L273 TraceCheckUtils]: 45: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:40,310 INFO L273 TraceCheckUtils]: 46: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:40,311 INFO L273 TraceCheckUtils]: 47: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:40,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:40,313 INFO L273 TraceCheckUtils]: 49: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:40,313 INFO L273 TraceCheckUtils]: 50: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:40,314 INFO L273 TraceCheckUtils]: 51: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:40,315 INFO L273 TraceCheckUtils]: 52: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:40,315 INFO L273 TraceCheckUtils]: 53: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:40,316 INFO L273 TraceCheckUtils]: 54: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:40,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:40,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:40,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:40,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17277#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:40,320 INFO L273 TraceCheckUtils]: 59: Hoare triple {17277#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {17277#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:40,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {17277#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {17258#false} is VALID [2018-11-19 00:01:40,321 INFO L256 TraceCheckUtils]: 61: Hoare triple {17258#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17258#false} is VALID [2018-11-19 00:01:40,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {17258#false} ~cond := #in~cond; {17258#false} is VALID [2018-11-19 00:01:40,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {17258#false} assume 0 == ~cond; {17258#false} is VALID [2018-11-19 00:01:40,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {17258#false} assume !false; {17258#false} is VALID [2018-11-19 00:01:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:40,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:01:40,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:01:40,337 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:01:47,410 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-19 00:01:47,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:01:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:47,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:47,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {17257#true} call ULTIMATE.init(); {17257#true} is VALID [2018-11-19 00:01:47,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {17257#true} assume true; {17257#true} is VALID [2018-11-19 00:01:47,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17257#true} {17257#true} #38#return; {17257#true} is VALID [2018-11-19 00:01:47,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {17257#true} call #t~ret2 := main(); {17257#true} is VALID [2018-11-19 00:01:47,616 INFO L273 TraceCheckUtils]: 4: Hoare triple {17257#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:47,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:47,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:47,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {17259#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:47,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:47,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:47,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {17260#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:47,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:47,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:47,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {17261#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:47,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:47,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:47,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {17262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:47,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:47,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:47,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {17263#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:47,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:47,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:47,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {17264#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:47,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:47,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:47,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {17265#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:47,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:47,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:47,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {17266#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:47,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:47,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:47,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {17267#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:47,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:47,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:47,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {17268#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:47,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:47,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:47,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {17269#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:47,640 INFO L273 TraceCheckUtils]: 38: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:47,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:47,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {17270#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:47,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:47,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:47,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {17271#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:47,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:47,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:47,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {17272#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:47,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:47,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:47,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {17273#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:47,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:47,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:47,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {17274#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:47,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:47,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:47,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {17275#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:47,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:47,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:47,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {17276#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17455#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:47,656 INFO L273 TraceCheckUtils]: 59: Hoare triple {17455#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {17455#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:47,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {17455#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {17258#false} is VALID [2018-11-19 00:01:47,657 INFO L256 TraceCheckUtils]: 61: Hoare triple {17258#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17258#false} is VALID [2018-11-19 00:01:47,658 INFO L273 TraceCheckUtils]: 62: Hoare triple {17258#false} ~cond := #in~cond; {17258#false} is VALID [2018-11-19 00:01:47,658 INFO L273 TraceCheckUtils]: 63: Hoare triple {17258#false} assume 0 == ~cond; {17258#false} is VALID [2018-11-19 00:01:47,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {17258#false} assume !false; {17258#false} is VALID [2018-11-19 00:01:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:47,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-19 00:01:47,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-19 00:01:47,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:47,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-19 00:01:47,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:47,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-19 00:01:47,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-19 00:01:47,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:01:47,751 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 22 states. [2018-11-19 00:01:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:49,980 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-11-19 00:01:49,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-19 00:01:49,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-11-19 00:01:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:01:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-19 00:01:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:01:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 80 transitions. [2018-11-19 00:01:49,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 80 transitions. [2018-11-19 00:01:50,075 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:01:50,077 INFO L225 Difference]: With dead ends: 131 [2018-11-19 00:01:50,077 INFO L226 Difference]: Without dead ends: 126 [2018-11-19 00:01:50,078 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-19 00:01:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-19 00:01:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-19 00:01:50,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:01:50,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-19 00:01:50,228 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-19 00:01:50,228 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-19 00:01:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:50,231 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-19 00:01:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-11-19 00:01:50,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:50,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:50,232 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-19 00:01:50,232 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-19 00:01:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:50,234 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-11-19 00:01:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-11-19 00:01:50,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:50,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:50,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:01:50,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:01:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-19 00:01:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-11-19 00:01:50,237 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 65 [2018-11-19 00:01:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:01:50,237 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-11-19 00:01:50,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-19 00:01:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-11-19 00:01:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-19 00:01:50,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:01:50,238 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:01:50,238 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:01:50,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:01:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash 296211291, now seen corresponding path program 19 times [2018-11-19 00:01:50,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:01:50,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:01:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:50,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:01:50,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:50,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {18073#true} call ULTIMATE.init(); {18073#true} is VALID [2018-11-19 00:01:50,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {18073#true} assume true; {18073#true} is VALID [2018-11-19 00:01:50,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18073#true} {18073#true} #38#return; {18073#true} is VALID [2018-11-19 00:01:50,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {18073#true} call #t~ret2 := main(); {18073#true} is VALID [2018-11-19 00:01:50,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {18073#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:50,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:50,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:50,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:50,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:50,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:50,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:50,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:50,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:50,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:50,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:50,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:50,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:50,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:50,718 INFO L273 TraceCheckUtils]: 18: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:50,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:50,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:50,720 INFO L273 TraceCheckUtils]: 21: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:50,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:50,721 INFO L273 TraceCheckUtils]: 23: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:50,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:50,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:50,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:50,724 INFO L273 TraceCheckUtils]: 27: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:50,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:50,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:50,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:50,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:50,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:50,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:50,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:50,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:50,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:50,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:50,733 INFO L273 TraceCheckUtils]: 38: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:50,733 INFO L273 TraceCheckUtils]: 39: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:50,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:50,735 INFO L273 TraceCheckUtils]: 41: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:50,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:50,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:50,737 INFO L273 TraceCheckUtils]: 44: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:50,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:50,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:50,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:50,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:50,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:50,742 INFO L273 TraceCheckUtils]: 50: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:50,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:50,744 INFO L273 TraceCheckUtils]: 52: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:50,744 INFO L273 TraceCheckUtils]: 53: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:50,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:50,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:50,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:50,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:50,748 INFO L273 TraceCheckUtils]: 58: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:50,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:50,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:50,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18094#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} is VALID [2018-11-19 00:01:50,751 INFO L273 TraceCheckUtils]: 62: Hoare triple {18094#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} assume true; {18094#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} is VALID [2018-11-19 00:01:50,752 INFO L273 TraceCheckUtils]: 63: Hoare triple {18094#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 99); {18074#false} is VALID [2018-11-19 00:01:50,752 INFO L256 TraceCheckUtils]: 64: Hoare triple {18074#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18074#false} is VALID [2018-11-19 00:01:50,752 INFO L273 TraceCheckUtils]: 65: Hoare triple {18074#false} ~cond := #in~cond; {18074#false} is VALID [2018-11-19 00:01:50,753 INFO L273 TraceCheckUtils]: 66: Hoare triple {18074#false} assume 0 == ~cond; {18074#false} is VALID [2018-11-19 00:01:50,753 INFO L273 TraceCheckUtils]: 67: Hoare triple {18074#false} assume !false; {18074#false} is VALID [2018-11-19 00:01:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:50,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:01:50,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:01:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:01:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:50,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:51,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {18073#true} call ULTIMATE.init(); {18073#true} is VALID [2018-11-19 00:01:51,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {18073#true} assume true; {18073#true} is VALID [2018-11-19 00:01:51,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18073#true} {18073#true} #38#return; {18073#true} is VALID [2018-11-19 00:01:51,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {18073#true} call #t~ret2 := main(); {18073#true} is VALID [2018-11-19 00:01:51,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {18073#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:51,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:51,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:51,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {18075#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:51,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:51,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:51,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {18076#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:51,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:51,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:51,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {18077#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:51,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:51,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:51,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {18078#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:51,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:51,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:51,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {18079#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:51,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:51,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:51,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {18080#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:51,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:51,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:51,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {18081#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:51,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:51,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:51,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {18082#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:51,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:51,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:51,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {18083#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:51,106 INFO L273 TraceCheckUtils]: 32: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:51,107 INFO L273 TraceCheckUtils]: 33: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:51,108 INFO L273 TraceCheckUtils]: 34: Hoare triple {18084#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:51,108 INFO L273 TraceCheckUtils]: 35: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:51,109 INFO L273 TraceCheckUtils]: 36: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:51,110 INFO L273 TraceCheckUtils]: 37: Hoare triple {18085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:51,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:51,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:51,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {18086#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:51,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:51,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:51,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {18087#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:51,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:51,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:51,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {18088#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:51,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:51,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:51,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {18089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:51,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:51,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:51,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {18090#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:51,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:51,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:51,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {18091#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:51,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:51,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:51,126 INFO L273 TraceCheckUtils]: 58: Hoare triple {18092#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:51,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:51,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:51,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {18093#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {18281#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:51,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {18281#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {18281#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:51,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {18281#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {18074#false} is VALID [2018-11-19 00:01:51,130 INFO L256 TraceCheckUtils]: 64: Hoare triple {18074#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18074#false} is VALID [2018-11-19 00:01:51,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {18074#false} ~cond := #in~cond; {18074#false} is VALID [2018-11-19 00:01:51,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {18074#false} assume 0 == ~cond; {18074#false} is VALID [2018-11-19 00:01:51,130 INFO L273 TraceCheckUtils]: 67: Hoare triple {18074#false} assume !false; {18074#false} is VALID [2018-11-19 00:01:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:51,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:51,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-19 00:01:51,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-19 00:01:51,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:51,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-19 00:01:51,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:51,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-19 00:01:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-19 00:01:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:01:51,227 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 23 states. [2018-11-19 00:01:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:54,159 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-11-19 00:01:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-19 00:01:54,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-19 00:01:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:01:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2018-11-19 00:01:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:01:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2018-11-19 00:01:54,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 89 transitions. [2018-11-19 00:01:54,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:54,256 INFO L225 Difference]: With dead ends: 134 [2018-11-19 00:01:54,256 INFO L226 Difference]: Without dead ends: 129 [2018-11-19 00:01:54,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:01:54,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-19 00:01:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-19 00:01:54,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:01:54,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 128 states. [2018-11-19 00:01:54,649 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 128 states. [2018-11-19 00:01:54,649 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 128 states. [2018-11-19 00:01:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:54,651 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-11-19 00:01:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-11-19 00:01:54,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:54,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:54,652 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 129 states. [2018-11-19 00:01:54,652 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 129 states. [2018-11-19 00:01:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:54,653 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-11-19 00:01:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-11-19 00:01:54,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:54,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:54,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:01:54,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:01:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-19 00:01:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-11-19 00:01:54,656 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 68 [2018-11-19 00:01:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:01:54,656 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-11-19 00:01:54,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-19 00:01:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-11-19 00:01:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-19 00:01:54,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:01:54,657 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:01:54,657 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:01:54,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:01:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1982532835, now seen corresponding path program 19 times [2018-11-19 00:01:54,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:01:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:01:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:54,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:01:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:55,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {18913#true} call ULTIMATE.init(); {18913#true} is VALID [2018-11-19 00:01:55,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {18913#true} assume true; {18913#true} is VALID [2018-11-19 00:01:55,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18913#true} {18913#true} #38#return; {18913#true} is VALID [2018-11-19 00:01:55,084 INFO L256 TraceCheckUtils]: 3: Hoare triple {18913#true} call #t~ret2 := main(); {18913#true} is VALID [2018-11-19 00:01:55,084 INFO L273 TraceCheckUtils]: 4: Hoare triple {18913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,095 INFO L273 TraceCheckUtils]: 18: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,100 INFO L273 TraceCheckUtils]: 25: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,106 INFO L273 TraceCheckUtils]: 32: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,106 INFO L273 TraceCheckUtils]: 33: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,107 INFO L273 TraceCheckUtils]: 34: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,108 INFO L273 TraceCheckUtils]: 35: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,108 INFO L273 TraceCheckUtils]: 36: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,109 INFO L273 TraceCheckUtils]: 37: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,126 INFO L273 TraceCheckUtils]: 59: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,128 INFO L273 TraceCheckUtils]: 61: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18934#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:55,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {18934#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {18934#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:01:55,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {18934#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {18914#false} is VALID [2018-11-19 00:01:55,130 INFO L256 TraceCheckUtils]: 64: Hoare triple {18914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18914#false} is VALID [2018-11-19 00:01:55,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {18914#false} ~cond := #in~cond; {18914#false} is VALID [2018-11-19 00:01:55,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {18914#false} assume 0 == ~cond; {18914#false} is VALID [2018-11-19 00:01:55,130 INFO L273 TraceCheckUtils]: 67: Hoare triple {18914#false} assume !false; {18914#false} is VALID [2018-11-19 00:01:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:55,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:01:55,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:01:55,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:01:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:55,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:55,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {18913#true} call ULTIMATE.init(); {18913#true} is VALID [2018-11-19 00:01:55,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {18913#true} assume true; {18913#true} is VALID [2018-11-19 00:01:55,366 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18913#true} {18913#true} #38#return; {18913#true} is VALID [2018-11-19 00:01:55,366 INFO L256 TraceCheckUtils]: 3: Hoare triple {18913#true} call #t~ret2 := main(); {18913#true} is VALID [2018-11-19 00:01:55,366 INFO L273 TraceCheckUtils]: 4: Hoare triple {18913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:55,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {18915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:55,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {18916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:55,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {18917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:55,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {18918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,376 INFO L273 TraceCheckUtils]: 18: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:55,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {18919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,378 INFO L273 TraceCheckUtils]: 21: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:55,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {18920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:55,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {18921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:55,384 INFO L273 TraceCheckUtils]: 28: Hoare triple {18922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:55,386 INFO L273 TraceCheckUtils]: 31: Hoare triple {18923#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:55,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {18924#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:55,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {18925#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:01:55,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {18926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:01:55,395 INFO L273 TraceCheckUtils]: 43: Hoare triple {18927#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,397 INFO L273 TraceCheckUtils]: 45: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:01:55,398 INFO L273 TraceCheckUtils]: 46: Hoare triple {18928#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,398 INFO L273 TraceCheckUtils]: 47: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:01:55,400 INFO L273 TraceCheckUtils]: 49: Hoare triple {18929#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:01:55,402 INFO L273 TraceCheckUtils]: 52: Hoare triple {18930#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,403 INFO L273 TraceCheckUtils]: 53: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,403 INFO L273 TraceCheckUtils]: 54: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:01:55,404 INFO L273 TraceCheckUtils]: 55: Hoare triple {18931#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,405 INFO L273 TraceCheckUtils]: 56: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,406 INFO L273 TraceCheckUtils]: 57: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:01:55,407 INFO L273 TraceCheckUtils]: 58: Hoare triple {18932#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,407 INFO L273 TraceCheckUtils]: 59: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,408 INFO L273 TraceCheckUtils]: 60: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:01:55,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {18933#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {19121#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:01:55,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {19121#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {19121#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:01:55,412 INFO L273 TraceCheckUtils]: 63: Hoare triple {19121#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {18914#false} is VALID [2018-11-19 00:01:55,412 INFO L256 TraceCheckUtils]: 64: Hoare triple {18914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {18914#false} is VALID [2018-11-19 00:01:55,413 INFO L273 TraceCheckUtils]: 65: Hoare triple {18914#false} ~cond := #in~cond; {18914#false} is VALID [2018-11-19 00:01:55,413 INFO L273 TraceCheckUtils]: 66: Hoare triple {18914#false} assume 0 == ~cond; {18914#false} is VALID [2018-11-19 00:01:55,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {18914#false} assume !false; {18914#false} is VALID [2018-11-19 00:01:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:55,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:55,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-19 00:01:55,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-19 00:01:55,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:55,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-19 00:01:55,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:55,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-19 00:01:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-19 00:01:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:01:55,510 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 23 states. [2018-11-19 00:01:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:58,031 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-11-19 00:01:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-19 00:01:58,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 68 [2018-11-19 00:01:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:01:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:01:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 83 transitions. [2018-11-19 00:01:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:01:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 83 transitions. [2018-11-19 00:01:58,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 83 transitions. [2018-11-19 00:01:58,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:58,118 INFO L225 Difference]: With dead ends: 137 [2018-11-19 00:01:58,118 INFO L226 Difference]: Without dead ends: 132 [2018-11-19 00:01:58,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:01:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-19 00:01:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-19 00:01:58,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:01:58,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 131 states. [2018-11-19 00:01:58,213 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 131 states. [2018-11-19 00:01:58,213 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 131 states. [2018-11-19 00:01:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:58,216 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-11-19 00:01:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-11-19 00:01:58,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:58,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:58,217 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 132 states. [2018-11-19 00:01:58,217 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 132 states. [2018-11-19 00:01:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:01:58,219 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-11-19 00:01:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-11-19 00:01:58,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:01:58,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:01:58,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:01:58,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:01:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-19 00:01:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-11-19 00:01:58,222 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 68 [2018-11-19 00:01:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:01:58,222 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-11-19 00:01:58,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-19 00:01:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-11-19 00:01:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-19 00:01:58,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:01:58,223 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:01:58,223 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:01:58,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:01:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1402444958, now seen corresponding path program 20 times [2018-11-19 00:01:58,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:01:58,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:01:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:58,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:01:58,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:01:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:58,739 INFO L256 TraceCheckUtils]: 0: Hoare triple {19767#true} call ULTIMATE.init(); {19767#true} is VALID [2018-11-19 00:01:58,739 INFO L273 TraceCheckUtils]: 1: Hoare triple {19767#true} assume true; {19767#true} is VALID [2018-11-19 00:01:58,740 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19767#true} {19767#true} #38#return; {19767#true} is VALID [2018-11-19 00:01:58,740 INFO L256 TraceCheckUtils]: 3: Hoare triple {19767#true} call #t~ret2 := main(); {19767#true} is VALID [2018-11-19 00:01:58,740 INFO L273 TraceCheckUtils]: 4: Hoare triple {19767#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:58,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:58,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:58,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:58,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:58,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:58,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:58,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:58,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:58,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:58,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:58,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:58,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:58,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:58,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:58,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:58,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:58,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:58,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:58,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:58,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:58,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:58,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:58,756 INFO L273 TraceCheckUtils]: 27: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:58,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:58,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:58,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:58,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:58,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:58,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:58,762 INFO L273 TraceCheckUtils]: 34: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:58,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:58,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:58,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:58,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:58,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:58,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:58,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:58,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:58,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:58,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:58,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:58,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:58,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:58,772 INFO L273 TraceCheckUtils]: 48: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:58,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:58,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:58,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:58,775 INFO L273 TraceCheckUtils]: 52: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:58,776 INFO L273 TraceCheckUtils]: 53: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:58,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:58,778 INFO L273 TraceCheckUtils]: 55: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:58,778 INFO L273 TraceCheckUtils]: 56: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:58,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:58,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:58,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:58,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:58,782 INFO L273 TraceCheckUtils]: 61: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:58,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:58,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:58,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19789#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:58,785 INFO L273 TraceCheckUtils]: 65: Hoare triple {19789#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume true; {19789#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:58,786 INFO L273 TraceCheckUtils]: 66: Hoare triple {19789#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {19768#false} is VALID [2018-11-19 00:01:58,786 INFO L256 TraceCheckUtils]: 67: Hoare triple {19768#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19768#false} is VALID [2018-11-19 00:01:58,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {19768#false} ~cond := #in~cond; {19768#false} is VALID [2018-11-19 00:01:58,787 INFO L273 TraceCheckUtils]: 69: Hoare triple {19768#false} assume 0 == ~cond; {19768#false} is VALID [2018-11-19 00:01:58,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {19768#false} assume !false; {19768#false} is VALID [2018-11-19 00:01:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:58,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:01:58,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:01:58,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:01:58,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:01:58,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:01:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:01:58,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:01:59,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {19767#true} call ULTIMATE.init(); {19767#true} is VALID [2018-11-19 00:01:59,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {19767#true} assume true; {19767#true} is VALID [2018-11-19 00:01:59,189 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19767#true} {19767#true} #38#return; {19767#true} is VALID [2018-11-19 00:01:59,189 INFO L256 TraceCheckUtils]: 3: Hoare triple {19767#true} call #t~ret2 := main(); {19767#true} is VALID [2018-11-19 00:01:59,189 INFO L273 TraceCheckUtils]: 4: Hoare triple {19767#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:59,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:59,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:01:59,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {19769#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:59,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:59,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:01:59,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {19770#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:59,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:59,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:01:59,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {19771#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:59,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:59,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:01:59,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {19772#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:59,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:59,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:01:59,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {19773#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:59,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:59,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:01:59,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {19774#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:59,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:59,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:01:59,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {19775#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:59,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:59,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:01:59,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {19776#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:59,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:59,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:01:59,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {19777#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:59,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:59,210 INFO L273 TraceCheckUtils]: 33: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:01:59,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {19778#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:59,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:59,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:01:59,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {19779#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:59,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:59,214 INFO L273 TraceCheckUtils]: 39: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:01:59,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {19780#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:59,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:59,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:01:59,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {19781#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:59,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:59,219 INFO L273 TraceCheckUtils]: 45: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:01:59,220 INFO L273 TraceCheckUtils]: 46: Hoare triple {19782#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:59,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:59,221 INFO L273 TraceCheckUtils]: 48: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:01:59,222 INFO L273 TraceCheckUtils]: 49: Hoare triple {19783#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:59,223 INFO L273 TraceCheckUtils]: 50: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:59,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:01:59,224 INFO L273 TraceCheckUtils]: 52: Hoare triple {19784#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:59,225 INFO L273 TraceCheckUtils]: 53: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:59,226 INFO L273 TraceCheckUtils]: 54: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:01:59,227 INFO L273 TraceCheckUtils]: 55: Hoare triple {19785#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:59,227 INFO L273 TraceCheckUtils]: 56: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:59,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:01:59,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {19786#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:59,229 INFO L273 TraceCheckUtils]: 59: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:59,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:01:59,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {19787#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:59,232 INFO L273 TraceCheckUtils]: 62: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:59,232 INFO L273 TraceCheckUtils]: 63: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:01:59,233 INFO L273 TraceCheckUtils]: 64: Hoare triple {19788#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {19985#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:59,234 INFO L273 TraceCheckUtils]: 65: Hoare triple {19985#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {19985#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:01:59,235 INFO L273 TraceCheckUtils]: 66: Hoare triple {19985#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {19768#false} is VALID [2018-11-19 00:01:59,235 INFO L256 TraceCheckUtils]: 67: Hoare triple {19768#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {19768#false} is VALID [2018-11-19 00:01:59,235 INFO L273 TraceCheckUtils]: 68: Hoare triple {19768#false} ~cond := #in~cond; {19768#false} is VALID [2018-11-19 00:01:59,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {19768#false} assume 0 == ~cond; {19768#false} is VALID [2018-11-19 00:01:59,235 INFO L273 TraceCheckUtils]: 70: Hoare triple {19768#false} assume !false; {19768#false} is VALID [2018-11-19 00:01:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:01:59,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:01:59,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-19 00:01:59,261 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-19 00:01:59,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:01:59,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-19 00:01:59,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:01:59,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-19 00:01:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-19 00:01:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-19 00:01:59,336 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 24 states. [2018-11-19 00:02:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:02,583 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-11-19 00:02:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-19 00:02:02,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-19 00:02:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:02:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 93 transitions. [2018-11-19 00:02:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:02:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 93 transitions. [2018-11-19 00:02:02,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 93 transitions. [2018-11-19 00:02:02,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:02,685 INFO L225 Difference]: With dead ends: 140 [2018-11-19 00:02:02,685 INFO L226 Difference]: Without dead ends: 135 [2018-11-19 00:02:02,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-19 00:02:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-19 00:02:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-19 00:02:02,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:02,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-19 00:02:02,802 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-19 00:02:02,802 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-19 00:02:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:02,805 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-19 00:02:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-11-19 00:02:02,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:02,806 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-19 00:02:02,806 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-19 00:02:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:02,808 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-11-19 00:02:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-11-19 00:02:02,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:02,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:02,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:02,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-19 00:02:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-11-19 00:02:02,811 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 71 [2018-11-19 00:02:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:02,811 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-11-19 00:02:02,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-19 00:02:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-11-19 00:02:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-19 00:02:02,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:02,812 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:02,812 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:02,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash -930692066, now seen corresponding path program 20 times [2018-11-19 00:02:02,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:02,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:02,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:02,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:03,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {20645#true} call ULTIMATE.init(); {20645#true} is VALID [2018-11-19 00:02:03,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {20645#true} assume true; {20645#true} is VALID [2018-11-19 00:02:03,667 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20645#true} {20645#true} #38#return; {20645#true} is VALID [2018-11-19 00:02:03,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {20645#true} call #t~ret2 := main(); {20645#true} is VALID [2018-11-19 00:02:03,668 INFO L273 TraceCheckUtils]: 4: Hoare triple {20645#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,677 INFO L273 TraceCheckUtils]: 18: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,683 INFO L273 TraceCheckUtils]: 26: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,684 INFO L273 TraceCheckUtils]: 27: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,685 INFO L273 TraceCheckUtils]: 29: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,693 INFO L273 TraceCheckUtils]: 39: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,698 INFO L273 TraceCheckUtils]: 46: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,699 INFO L273 TraceCheckUtils]: 47: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,699 INFO L273 TraceCheckUtils]: 48: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,700 INFO L273 TraceCheckUtils]: 49: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20667#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:03,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {20667#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {20667#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:03,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {20667#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {20646#false} is VALID [2018-11-19 00:02:03,713 INFO L256 TraceCheckUtils]: 67: Hoare triple {20646#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20646#false} is VALID [2018-11-19 00:02:03,714 INFO L273 TraceCheckUtils]: 68: Hoare triple {20646#false} ~cond := #in~cond; {20646#false} is VALID [2018-11-19 00:02:03,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {20646#false} assume 0 == ~cond; {20646#false} is VALID [2018-11-19 00:02:03,714 INFO L273 TraceCheckUtils]: 70: Hoare triple {20646#false} assume !false; {20646#false} is VALID [2018-11-19 00:02:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:03,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:03,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:03,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:02:03,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:02:03,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:03,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:03,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {20645#true} call ULTIMATE.init(); {20645#true} is VALID [2018-11-19 00:02:03,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {20645#true} assume true; {20645#true} is VALID [2018-11-19 00:02:03,935 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20645#true} {20645#true} #38#return; {20645#true} is VALID [2018-11-19 00:02:03,936 INFO L256 TraceCheckUtils]: 3: Hoare triple {20645#true} call #t~ret2 := main(); {20645#true} is VALID [2018-11-19 00:02:03,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {20645#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:03,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {20647#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:03,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {20648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:03,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {20649#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:03,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {20650#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,962 INFO L273 TraceCheckUtils]: 17: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:03,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {20651#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:03,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {20652#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:03,968 INFO L273 TraceCheckUtils]: 25: Hoare triple {20653#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:03,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {20654#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:03,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {20655#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:03,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {20656#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:03,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {20657#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:03,979 INFO L273 TraceCheckUtils]: 40: Hoare triple {20658#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,980 INFO L273 TraceCheckUtils]: 41: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,981 INFO L273 TraceCheckUtils]: 42: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:03,982 INFO L273 TraceCheckUtils]: 43: Hoare triple {20659#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,982 INFO L273 TraceCheckUtils]: 44: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:03,984 INFO L273 TraceCheckUtils]: 46: Hoare triple {20660#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,985 INFO L273 TraceCheckUtils]: 48: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:03,986 INFO L273 TraceCheckUtils]: 49: Hoare triple {20661#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,987 INFO L273 TraceCheckUtils]: 50: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,987 INFO L273 TraceCheckUtils]: 51: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:03,988 INFO L273 TraceCheckUtils]: 52: Hoare triple {20662#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,989 INFO L273 TraceCheckUtils]: 53: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:03,991 INFO L273 TraceCheckUtils]: 55: Hoare triple {20663#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,992 INFO L273 TraceCheckUtils]: 57: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:03,993 INFO L273 TraceCheckUtils]: 58: Hoare triple {20664#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,993 INFO L273 TraceCheckUtils]: 59: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,994 INFO L273 TraceCheckUtils]: 60: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:03,995 INFO L273 TraceCheckUtils]: 61: Hoare triple {20665#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:03,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {20666#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {20863#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:03,998 INFO L273 TraceCheckUtils]: 65: Hoare triple {20863#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {20863#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:03,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {20863#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {20646#false} is VALID [2018-11-19 00:02:03,999 INFO L256 TraceCheckUtils]: 67: Hoare triple {20646#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {20646#false} is VALID [2018-11-19 00:02:03,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {20646#false} ~cond := #in~cond; {20646#false} is VALID [2018-11-19 00:02:03,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {20646#false} assume 0 == ~cond; {20646#false} is VALID [2018-11-19 00:02:03,999 INFO L273 TraceCheckUtils]: 70: Hoare triple {20646#false} assume !false; {20646#false} is VALID [2018-11-19 00:02:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:04,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-19 00:02:04,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-19 00:02:04,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:04,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-19 00:02:04,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:04,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-19 00:02:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-19 00:02:04,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-19 00:02:04,100 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 24 states. [2018-11-19 00:02:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:06,772 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-11-19 00:02:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-19 00:02:06,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-19 00:02:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:02:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2018-11-19 00:02:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-19 00:02:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2018-11-19 00:02:06,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 86 transitions. [2018-11-19 00:02:06,860 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:02:06,863 INFO L225 Difference]: With dead ends: 143 [2018-11-19 00:02:06,863 INFO L226 Difference]: Without dead ends: 138 [2018-11-19 00:02:06,863 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-19 00:02:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-19 00:02:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-19 00:02:06,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:06,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 137 states. [2018-11-19 00:02:06,953 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 137 states. [2018-11-19 00:02:06,953 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 137 states. [2018-11-19 00:02:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:06,955 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-11-19 00:02:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-11-19 00:02:06,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:06,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:06,956 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 138 states. [2018-11-19 00:02:06,956 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 138 states. [2018-11-19 00:02:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:06,958 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-11-19 00:02:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-11-19 00:02:06,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:06,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:06,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:06,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-19 00:02:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-11-19 00:02:06,960 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 71 [2018-11-19 00:02:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:06,961 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-11-19 00:02:06,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-19 00:02:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-11-19 00:02:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-19 00:02:06,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:06,961 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:06,961 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:06,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1925556347, now seen corresponding path program 21 times [2018-11-19 00:02:06,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:06,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:06,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:06,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:07,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {21537#true} call ULTIMATE.init(); {21537#true} is VALID [2018-11-19 00:02:07,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {21537#true} assume true; {21537#true} is VALID [2018-11-19 00:02:07,678 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21537#true} {21537#true} #38#return; {21537#true} is VALID [2018-11-19 00:02:07,678 INFO L256 TraceCheckUtils]: 3: Hoare triple {21537#true} call #t~ret2 := main(); {21537#true} is VALID [2018-11-19 00:02:07,679 INFO L273 TraceCheckUtils]: 4: Hoare triple {21537#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:07,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:07,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:07,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:07,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:07,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:07,683 INFO L273 TraceCheckUtils]: 10: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:07,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:07,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:07,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:07,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:07,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:07,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:07,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:07,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:07,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:07,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:07,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:07,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:07,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:07,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:07,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:07,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:07,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:07,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:07,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:07,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:07,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:07,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:07,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:07,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:07,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:07,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:07,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:07,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:07,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:07,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:07,706 INFO L273 TraceCheckUtils]: 41: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:07,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:07,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:07,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:07,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:07,710 INFO L273 TraceCheckUtils]: 46: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:07,711 INFO L273 TraceCheckUtils]: 47: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:07,711 INFO L273 TraceCheckUtils]: 48: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:07,712 INFO L273 TraceCheckUtils]: 49: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:07,713 INFO L273 TraceCheckUtils]: 50: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:07,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:07,715 INFO L273 TraceCheckUtils]: 52: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:07,715 INFO L273 TraceCheckUtils]: 53: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:07,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:07,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:07,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:07,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:07,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:07,720 INFO L273 TraceCheckUtils]: 59: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:07,720 INFO L273 TraceCheckUtils]: 60: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:07,721 INFO L273 TraceCheckUtils]: 61: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:07,722 INFO L273 TraceCheckUtils]: 62: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:07,723 INFO L273 TraceCheckUtils]: 63: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:07,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:07,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:07,725 INFO L273 TraceCheckUtils]: 66: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:07,726 INFO L273 TraceCheckUtils]: 67: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21560#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:07,727 INFO L273 TraceCheckUtils]: 68: Hoare triple {21560#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {21560#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:07,727 INFO L273 TraceCheckUtils]: 69: Hoare triple {21560#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {21538#false} is VALID [2018-11-19 00:02:07,728 INFO L256 TraceCheckUtils]: 70: Hoare triple {21538#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21538#false} is VALID [2018-11-19 00:02:07,728 INFO L273 TraceCheckUtils]: 71: Hoare triple {21538#false} ~cond := #in~cond; {21538#false} is VALID [2018-11-19 00:02:07,728 INFO L273 TraceCheckUtils]: 72: Hoare triple {21538#false} assume 0 == ~cond; {21538#false} is VALID [2018-11-19 00:02:07,728 INFO L273 TraceCheckUtils]: 73: Hoare triple {21538#false} assume !false; {21538#false} is VALID [2018-11-19 00:02:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:07,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:07,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:07,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:02:09,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-19 00:02:09,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:09,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:09,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {21537#true} call ULTIMATE.init(); {21537#true} is VALID [2018-11-19 00:02:09,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {21537#true} assume true; {21537#true} is VALID [2018-11-19 00:02:09,780 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21537#true} {21537#true} #38#return; {21537#true} is VALID [2018-11-19 00:02:09,780 INFO L256 TraceCheckUtils]: 3: Hoare triple {21537#true} call #t~ret2 := main(); {21537#true} is VALID [2018-11-19 00:02:09,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {21537#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:09,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:09,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:09,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {21539#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:09,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:09,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-19 00:02:09,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {21540#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:09,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:09,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:09,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {21541#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:09,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:09,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-19 00:02:09,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {21542#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:09,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:09,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:09,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {21543#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:09,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:09,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-19 00:02:09,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {21544#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:09,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:09,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:09,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {21545#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:09,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:09,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-19 00:02:09,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {21546#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:09,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:09,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:09,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {21547#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:09,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:09,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-19 00:02:09,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {21548#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:09,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:09,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:09,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {21549#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:09,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:09,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-19 00:02:09,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {21550#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:09,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:09,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:09,808 INFO L273 TraceCheckUtils]: 43: Hoare triple {21551#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:09,808 INFO L273 TraceCheckUtils]: 44: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:09,809 INFO L273 TraceCheckUtils]: 45: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-19 00:02:09,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {21552#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:09,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:09,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:09,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {21553#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:09,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:09,813 INFO L273 TraceCheckUtils]: 51: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-19 00:02:09,814 INFO L273 TraceCheckUtils]: 52: Hoare triple {21554#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:09,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:09,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:09,817 INFO L273 TraceCheckUtils]: 55: Hoare triple {21555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:09,817 INFO L273 TraceCheckUtils]: 56: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume true; {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:09,818 INFO L273 TraceCheckUtils]: 57: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-19 00:02:09,819 INFO L273 TraceCheckUtils]: 58: Hoare triple {21556#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:09,820 INFO L273 TraceCheckUtils]: 59: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:09,821 INFO L273 TraceCheckUtils]: 60: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:09,821 INFO L273 TraceCheckUtils]: 61: Hoare triple {21557#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:09,822 INFO L273 TraceCheckUtils]: 62: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume true; {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:09,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-19 00:02:09,823 INFO L273 TraceCheckUtils]: 64: Hoare triple {21558#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:09,823 INFO L273 TraceCheckUtils]: 65: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:09,824 INFO L273 TraceCheckUtils]: 66: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:09,825 INFO L273 TraceCheckUtils]: 67: Hoare triple {21559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {21765#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:02:09,826 INFO L273 TraceCheckUtils]: 68: Hoare triple {21765#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume true; {21765#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-19 00:02:09,826 INFO L273 TraceCheckUtils]: 69: Hoare triple {21765#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 99); {21538#false} is VALID [2018-11-19 00:02:09,827 INFO L256 TraceCheckUtils]: 70: Hoare triple {21538#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21538#false} is VALID [2018-11-19 00:02:09,827 INFO L273 TraceCheckUtils]: 71: Hoare triple {21538#false} ~cond := #in~cond; {21538#false} is VALID [2018-11-19 00:02:09,827 INFO L273 TraceCheckUtils]: 72: Hoare triple {21538#false} assume 0 == ~cond; {21538#false} is VALID [2018-11-19 00:02:09,827 INFO L273 TraceCheckUtils]: 73: Hoare triple {21538#false} assume !false; {21538#false} is VALID [2018-11-19 00:02:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:09,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:09,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-19 00:02:09,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-19 00:02:09,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:09,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-19 00:02:09,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:09,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-19 00:02:09,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-19 00:02:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:02:09,949 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 25 states. [2018-11-19 00:02:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:13,462 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-11-19 00:02:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-19 00:02:13,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-11-19 00:02:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:02:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-19 00:02:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:02:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 96 transitions. [2018-11-19 00:02:13,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 96 transitions. [2018-11-19 00:02:13,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:13,565 INFO L225 Difference]: With dead ends: 146 [2018-11-19 00:02:13,565 INFO L226 Difference]: Without dead ends: 141 [2018-11-19 00:02:13,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:02:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-19 00:02:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-19 00:02:13,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:13,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 140 states. [2018-11-19 00:02:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 140 states. [2018-11-19 00:02:13,652 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 140 states. [2018-11-19 00:02:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:13,654 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-11-19 00:02:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-11-19 00:02:13,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:13,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:13,655 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 141 states. [2018-11-19 00:02:13,655 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 141 states. [2018-11-19 00:02:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:13,656 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-11-19 00:02:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-11-19 00:02:13,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:13,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:13,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:13,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-19 00:02:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-11-19 00:02:13,658 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 74 [2018-11-19 00:02:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:13,659 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-11-19 00:02:13,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-19 00:02:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-11-19 00:02:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-19 00:02:13,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:13,659 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:13,659 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:13,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:13,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1623734403, now seen corresponding path program 21 times [2018-11-19 00:02:13,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:13,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:13,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:14,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {22453#true} call ULTIMATE.init(); {22453#true} is VALID [2018-11-19 00:02:14,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {22453#true} assume true; {22453#true} is VALID [2018-11-19 00:02:14,314 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22453#true} {22453#true} #38#return; {22453#true} is VALID [2018-11-19 00:02:14,314 INFO L256 TraceCheckUtils]: 3: Hoare triple {22453#true} call #t~ret2 := main(); {22453#true} is VALID [2018-11-19 00:02:14,315 INFO L273 TraceCheckUtils]: 4: Hoare triple {22453#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:14,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:14,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-19 00:02:14,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {22455#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:14,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:14,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-19 00:02:14,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {22456#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:14,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:14,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-19 00:02:14,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {22457#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:14,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:14,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-19 00:02:14,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {22458#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:14,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:14,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-19 00:02:14,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {22459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:14,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:14,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:14,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {22460#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:14,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:14,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:14,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {22461#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:14,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:14,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:14,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {22462#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:14,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:14,334 INFO L273 TraceCheckUtils]: 30: Hoare triple {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:14,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {22463#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:14,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:14,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:14,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {22464#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:14,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:14,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:14,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {22465#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:14,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:14,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:14,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {22466#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:14,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:14,343 INFO L273 TraceCheckUtils]: 42: Hoare triple {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:14,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {22467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:14,344 INFO L273 TraceCheckUtils]: 44: Hoare triple {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:14,345 INFO L273 TraceCheckUtils]: 45: Hoare triple {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:14,346 INFO L273 TraceCheckUtils]: 46: Hoare triple {22468#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:14,347 INFO L273 TraceCheckUtils]: 47: Hoare triple {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:14,347 INFO L273 TraceCheckUtils]: 48: Hoare triple {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:14,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {22469#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:14,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:14,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:14,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {22470#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:14,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:14,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:14,353 INFO L273 TraceCheckUtils]: 55: Hoare triple {22471#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:14,353 INFO L273 TraceCheckUtils]: 56: Hoare triple {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:14,354 INFO L273 TraceCheckUtils]: 57: Hoare triple {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:14,355 INFO L273 TraceCheckUtils]: 58: Hoare triple {22472#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:14,356 INFO L273 TraceCheckUtils]: 59: Hoare triple {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:14,356 INFO L273 TraceCheckUtils]: 60: Hoare triple {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:14,357 INFO L273 TraceCheckUtils]: 61: Hoare triple {22473#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:14,358 INFO L273 TraceCheckUtils]: 62: Hoare triple {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:14,358 INFO L273 TraceCheckUtils]: 63: Hoare triple {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:14,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {22474#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:14,360 INFO L273 TraceCheckUtils]: 65: Hoare triple {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:14,361 INFO L273 TraceCheckUtils]: 66: Hoare triple {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:14,362 INFO L273 TraceCheckUtils]: 67: Hoare triple {22475#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {22476#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:14,363 INFO L273 TraceCheckUtils]: 68: Hoare triple {22476#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {22476#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-19 00:02:14,363 INFO L273 TraceCheckUtils]: 69: Hoare triple {22476#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {22454#false} is VALID [2018-11-19 00:02:14,364 INFO L256 TraceCheckUtils]: 70: Hoare triple {22454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22454#false} is VALID [2018-11-19 00:02:14,364 INFO L273 TraceCheckUtils]: 71: Hoare triple {22454#false} ~cond := #in~cond; {22454#false} is VALID [2018-11-19 00:02:14,364 INFO L273 TraceCheckUtils]: 72: Hoare triple {22454#false} assume 0 == ~cond; {22454#false} is VALID [2018-11-19 00:02:14,364 INFO L273 TraceCheckUtils]: 73: Hoare triple {22454#false} assume !false; {22454#false} is VALID [2018-11-19 00:02:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:14,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:14,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2