java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:47,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:47,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:47,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:47,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:47,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:47,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:47,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:47,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:47,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:47,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:47,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:47,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:47,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:47,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:47,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:47,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:47,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:47,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:47,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:47,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:47,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:47,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:47,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:47,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:47,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:47,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:47,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:47,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:47,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:47,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:47,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:47,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:47,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:47,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:47,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:47,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:47,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:47,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:47,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:47,645 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:47,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:47,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:47,646 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:47,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:47,646 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:47,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:47,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:47,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:47,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:47,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:47,647 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:47,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:47,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:47,649 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:47,649 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:47,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:47,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:47,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:47,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:47,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:47,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:47,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:47,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:47,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:47,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:47,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:47,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:47,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:47,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:47,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:47,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:47,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:47,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-23 13:02:47,814 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4f04431/6cb45916a4ca43459256f31a827be68a/FLAG46aaf1ddb [2018-11-23 13:02:48,213 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:48,214 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-23 13:02:48,219 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4f04431/6cb45916a4ca43459256f31a827be68a/FLAG46aaf1ddb [2018-11-23 13:02:48,597 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a4f04431/6cb45916a4ca43459256f31a827be68a [2018-11-23 13:02:48,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:48,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:48,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:48,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:48,612 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:48,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48, skipping insertion in model container [2018-11-23 13:02:48,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:48,651 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:48,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:48,875 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:48,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:48,913 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:48,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48 WrapperNode [2018-11-23 13:02:48,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:48,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:48,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:48,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:48,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:48,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:48,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:48,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:48,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:48,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:48,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:48,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:48,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:49,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:49,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:49,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:49,157 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:49,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:49,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:49,614 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:49,615 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:49,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:49 BoogieIcfgContainer [2018-11-23 13:02:49,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:49,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:49,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:49,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:49,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:48" (1/3) ... [2018-11-23 13:02:49,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414912c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:49, skipping insertion in model container [2018-11-23 13:02:49,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48" (2/3) ... [2018-11-23 13:02:49,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414912c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:49, skipping insertion in model container [2018-11-23 13:02:49,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:49" (3/3) ... [2018-11-23 13:02:49,624 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-11-23 13:02:49,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:49,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:49,659 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:49,693 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:49,694 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:49,695 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:49,695 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:49,696 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:49,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:49,696 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:49,696 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:49,697 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:02:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:02:49,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:49,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:49,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:49,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1345568573, now seen corresponding path program 1 times [2018-11-23 13:02:49,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:02:50,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:02:50,589 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-23 13:02:50,589 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret3 := main(); {22#true} is VALID [2018-11-23 13:02:50,595 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-23 13:02:50,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} assume !false; {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-23 13:02:50,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {25#(and (<= (+ (* 2 main_~x~0) 2) main_~sn~0) (<= main_~sn~0 (+ (* 2 main_~x~0) 2)))} is VALID [2018-11-23 13:02:50,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#(and (<= (+ (* 2 main_~x~0) 2) main_~sn~0) (<= main_~sn~0 (+ (* 2 main_~x~0) 2)))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-23 13:02:50,607 INFO L256 TraceCheckUtils]: 8: Hoare triple {24#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {26#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:50,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {27#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:50,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:02:50,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:02:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:02:50,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:02:50,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:50,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:50,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:50,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:50,698 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2018-11-23 13:02:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,456 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-23 13:02:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:02:51,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:02:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 13:02:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-23 13:02:51,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2018-11-23 13:02:51,645 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-23 13:02:51,663 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:02:51,664 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:02:51,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:02:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:02:51,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:51,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:02:51,909 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:02:51,909 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:02:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,916 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:02:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:02:51,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:02:51,917 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:02:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,926 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:02:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:02:51,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:51,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:02:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:02:51,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2018-11-23 13:02:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:51,938 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:02:51,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:02:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:02:51,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:51,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:51,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:51,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1402826875, now seen corresponding path program 1 times [2018-11-23 13:02:51,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:51,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {164#true} call ULTIMATE.init(); {164#true} is VALID [2018-11-23 13:02:52,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {164#true} assume true; {164#true} is VALID [2018-11-23 13:02:52,073 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {164#true} {164#true} #38#return; {164#true} is VALID [2018-11-23 13:02:52,073 INFO L256 TraceCheckUtils]: 3: Hoare triple {164#true} call #t~ret3 := main(); {164#true} is VALID [2018-11-23 13:02:52,074 INFO L273 TraceCheckUtils]: 4: Hoare triple {164#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {166#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:52,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {166#(= main_~sn~0 0)} assume !false; {166#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:52,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {166#(= main_~sn~0 0)} assume !(~x~0 % 4294967296 < 10); {166#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:52,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {166#(= main_~sn~0 0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {166#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:52,078 INFO L256 TraceCheckUtils]: 8: Hoare triple {166#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {167#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:02:52,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {167#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {168#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:52,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {168#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {165#false} is VALID [2018-11-23 13:02:52,082 INFO L273 TraceCheckUtils]: 11: Hoare triple {165#false} assume !false; {165#false} is VALID [2018-11-23 13:02:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:52,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:52,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:52,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:02:52,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:52,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:52,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:52,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:52,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:52,111 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-11-23 13:02:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,333 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:02:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:52,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:02:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:02:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:02:52,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2018-11-23 13:02:52,407 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-23 13:02:52,409 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:02:52,409 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:02:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:02:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:02:52,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:52,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 13:02:52,452 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:02:52,452 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:02:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,456 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:02:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:02:52,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,457 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:02:52,457 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:02:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,461 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:02:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:02:52,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:52,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:02:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:02:52,465 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 12 [2018-11-23 13:02:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:52,466 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:02:52,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:02:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:02:52,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:52,467 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:52,468 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:52,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:52,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1436486517, now seen corresponding path program 1 times [2018-11-23 13:02:52,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:52,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:52,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2018-11-23 13:02:52,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-23 13:02:52,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #38#return; {335#true} is VALID [2018-11-23 13:02:52,647 INFO L256 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2018-11-23 13:02:52,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:52,657 INFO L256 TraceCheckUtils]: 8: Hoare triple {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {335#true} is VALID [2018-11-23 13:02:52,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {335#true} ~cond := #in~cond; {335#true} is VALID [2018-11-23 13:02:52,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {335#true} assume !(0 == ~cond); {335#true} is VALID [2018-11-23 13:02:52,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-23 13:02:52,659 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {335#true} {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:52,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:52,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {338#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {336#false} is VALID [2018-11-23 13:02:52,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {336#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {336#false} is VALID [2018-11-23 13:02:52,662 INFO L256 TraceCheckUtils]: 16: Hoare triple {336#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {336#false} is VALID [2018-11-23 13:02:52,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {336#false} ~cond := #in~cond; {336#false} is VALID [2018-11-23 13:02:52,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {336#false} assume 0 == ~cond; {336#false} is VALID [2018-11-23 13:02:52,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#false} assume !false; {336#false} is VALID [2018-11-23 13:02:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:52,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:52,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:52,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2018-11-23 13:02:52,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-23 13:02:52,988 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {335#true} {335#true} #38#return; {335#true} is VALID [2018-11-23 13:02:52,989 INFO L256 TraceCheckUtils]: 3: Hoare triple {335#true} call #t~ret3 := main(); {335#true} is VALID [2018-11-23 13:02:52,990 INFO L273 TraceCheckUtils]: 4: Hoare triple {335#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:52,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:52,997 INFO L256 TraceCheckUtils]: 8: Hoare triple {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {335#true} is VALID [2018-11-23 13:02:52,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {335#true} ~cond := #in~cond; {335#true} is VALID [2018-11-23 13:02:52,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {335#true} assume !(0 == ~cond); {335#true} is VALID [2018-11-23 13:02:52,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {335#true} assume true; {335#true} is VALID [2018-11-23 13:02:52,999 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {335#true} {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:53,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:53,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {363#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {336#false} is VALID [2018-11-23 13:02:53,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {336#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {336#false} is VALID [2018-11-23 13:02:53,002 INFO L256 TraceCheckUtils]: 16: Hoare triple {336#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {336#false} is VALID [2018-11-23 13:02:53,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {336#false} ~cond := #in~cond; {336#false} is VALID [2018-11-23 13:02:53,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {336#false} assume 0 == ~cond; {336#false} is VALID [2018-11-23 13:02:53,003 INFO L273 TraceCheckUtils]: 19: Hoare triple {336#false} assume !false; {336#false} is VALID [2018-11-23 13:02:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:53,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:53,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:02:53,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:02:53,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:53,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:53,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:53,081 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2018-11-23 13:02:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,650 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 13:02:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:53,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:02:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 13:02:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2018-11-23 13:02:53,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2018-11-23 13:02:53,738 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-23 13:02:53,740 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:02:53,741 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:02:53,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:02:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:02:53,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:53,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:02:53,776 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:02:53,777 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:02:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,781 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:02:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:02:53,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,783 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:02:53,783 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:02:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,786 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:02:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:02:53,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:53,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:02:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 13:02:53,790 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 20 [2018-11-23 13:02:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:53,790 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 13:02:53,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:02:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:02:53,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:53,792 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:53,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:53,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:53,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1136980881, now seen corresponding path program 2 times [2018-11-23 13:02:53,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:53,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:53,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:54,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 13:02:54,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,057 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #38#return; {568#true} is VALID [2018-11-23 13:02:54,057 INFO L256 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret3 := main(); {568#true} is VALID [2018-11-23 13:02:54,058 INFO L273 TraceCheckUtils]: 4: Hoare triple {568#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,062 INFO L256 TraceCheckUtils]: 8: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {568#true} is VALID [2018-11-23 13:02:54,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2018-11-23 13:02:54,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2018-11-23 13:02:54,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,065 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {568#true} {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:54,067 INFO L256 TraceCheckUtils]: 16: Hoare triple {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {568#true} is VALID [2018-11-23 13:02:54,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2018-11-23 13:02:54,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2018-11-23 13:02:54,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,069 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {568#true} {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:54,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:54,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {572#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {569#false} is VALID [2018-11-23 13:02:54,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {569#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {569#false} is VALID [2018-11-23 13:02:54,071 INFO L256 TraceCheckUtils]: 24: Hoare triple {569#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {569#false} is VALID [2018-11-23 13:02:54,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2018-11-23 13:02:54,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2018-11-23 13:02:54,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 13:02:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:54,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:54,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:54,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:54,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 13:02:54,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,259 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #38#return; {568#true} is VALID [2018-11-23 13:02:54,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret3 := main(); {568#true} is VALID [2018-11-23 13:02:54,260 INFO L273 TraceCheckUtils]: 4: Hoare triple {568#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:54,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,262 INFO L256 TraceCheckUtils]: 8: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {568#true} is VALID [2018-11-23 13:02:54,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2018-11-23 13:02:54,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2018-11-23 13:02:54,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,269 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {568#true} {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:54,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {571#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:54,273 INFO L256 TraceCheckUtils]: 16: Hoare triple {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {568#true} is VALID [2018-11-23 13:02:54,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2018-11-23 13:02:54,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2018-11-23 13:02:54,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 13:02:54,274 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {568#true} {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:54,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:54,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {621#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {569#false} is VALID [2018-11-23 13:02:54,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {569#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {569#false} is VALID [2018-11-23 13:02:54,282 INFO L256 TraceCheckUtils]: 24: Hoare triple {569#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {569#false} is VALID [2018-11-23 13:02:54,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2018-11-23 13:02:54,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2018-11-23 13:02:54,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 13:02:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:02:54,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:54,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:02:54,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 13:02:54,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:54,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:54,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:54,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:54,399 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-11-23 13:02:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,638 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 13:02:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:54,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 13:02:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 13:02:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-23 13:02:54,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2018-11-23 13:02:54,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:54,725 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:02:54,725 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:02:54,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 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-23 13:02:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:02:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:02:54,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:54,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:54,773 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:54,773 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,777 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 13:02:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 13:02:54,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,779 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:02:54,779 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:02:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,782 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 13:02:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 13:02:54,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:54,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:02:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 13:02:54,787 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2018-11-23 13:02:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:54,787 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 13:02:54,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:02:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:02:54,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:54,789 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:54,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:54,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1851034775, now seen corresponding path program 3 times [2018-11-23 13:02:54,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:54,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:55,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 13:02:55,821 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:02:55,821 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {835#true} {835#true} #38#return; {835#true} is VALID [2018-11-23 13:02:55,822 INFO L256 TraceCheckUtils]: 3: Hoare triple {835#true} call #t~ret3 := main(); {835#true} is VALID [2018-11-23 13:02:55,837 INFO L273 TraceCheckUtils]: 4: Hoare triple {835#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:55,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:55,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:02:55,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:55,842 INFO L256 TraceCheckUtils]: 8: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:02:55,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:02:55,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:02:55,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:02:55,846 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {835#true} {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:55,848 INFO L273 TraceCheckUtils]: 13: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:55,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:02:55,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:55,849 INFO L256 TraceCheckUtils]: 16: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:02:55,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:02:55,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:02:55,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:02:55,851 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {835#true} {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:55,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:55,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:02:55,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:55,854 INFO L256 TraceCheckUtils]: 24: Hoare triple {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:02:55,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:02:55,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:02:55,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:02:55,856 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {835#true} {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:55,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:02:55,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {840#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {836#false} is VALID [2018-11-23 13:02:55,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {836#false} is VALID [2018-11-23 13:02:55,858 INFO L256 TraceCheckUtils]: 32: Hoare triple {836#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {836#false} is VALID [2018-11-23 13:02:55,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 13:02:55,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 13:02:55,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 13:02:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:02:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:55,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:18,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:03:18,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:18,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:18,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {835#true} call ULTIMATE.init(); {835#true} is VALID [2018-11-23 13:03:18,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:03:18,770 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {835#true} {835#true} #38#return; {835#true} is VALID [2018-11-23 13:03:18,770 INFO L256 TraceCheckUtils]: 3: Hoare triple {835#true} call #t~ret3 := main(); {835#true} is VALID [2018-11-23 13:03:18,773 INFO L273 TraceCheckUtils]: 4: Hoare triple {835#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:18,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:18,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:18,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {837#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:18,776 INFO L256 TraceCheckUtils]: 8: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:03:18,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:03:18,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:03:18,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:03:18,777 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {835#true} {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:18,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:18,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:18,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {838#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:18,780 INFO L256 TraceCheckUtils]: 16: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:03:18,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:03:18,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:03:18,781 INFO L273 TraceCheckUtils]: 19: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:03:18,783 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {835#true} {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:18,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:18,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:18,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {839#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:18,786 INFO L256 TraceCheckUtils]: 24: Hoare triple {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {835#true} is VALID [2018-11-23 13:03:18,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {835#true} ~cond := #in~cond; {835#true} is VALID [2018-11-23 13:03:18,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {835#true} assume !(0 == ~cond); {835#true} is VALID [2018-11-23 13:03:18,787 INFO L273 TraceCheckUtils]: 27: Hoare triple {835#true} assume true; {835#true} is VALID [2018-11-23 13:03:18,788 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {835#true} {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:18,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:18,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {913#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {836#false} is VALID [2018-11-23 13:03:18,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {836#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {836#false} is VALID [2018-11-23 13:03:18,790 INFO L256 TraceCheckUtils]: 32: Hoare triple {836#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {836#false} is VALID [2018-11-23 13:03:18,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {836#false} ~cond := #in~cond; {836#false} is VALID [2018-11-23 13:03:18,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {836#false} assume 0 == ~cond; {836#false} is VALID [2018-11-23 13:03:18,791 INFO L273 TraceCheckUtils]: 35: Hoare triple {836#false} assume !false; {836#false} is VALID [2018-11-23 13:03:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:03:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:03:18,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 13:03:18,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:18,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:03:18,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:18,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:03:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:03:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:18,873 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2018-11-23 13:03:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,345 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 13:03:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:19,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-23 13:03:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 13:03:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-23 13:03:19,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-23 13:03:19,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:19,412 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:03:19,412 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:03:19,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:03:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:03:19,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:19,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:19,500 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:19,501 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,504 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 13:03:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 13:03:19,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:19,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:19,505 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:03:19,505 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:03:19,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,508 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 13:03:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 13:03:19,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:19,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:19,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:19,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:03:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 13:03:19,513 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 36 [2018-11-23 13:03:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:19,513 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 13:03:19,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:03:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 13:03:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:03:19,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:19,515 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:19,515 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:19,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 103432291, now seen corresponding path program 4 times [2018-11-23 13:03:19,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:19,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:19,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 13:03:19,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:19,866 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1147#true} {1147#true} #38#return; {1147#true} is VALID [2018-11-23 13:03:19,867 INFO L256 TraceCheckUtils]: 3: Hoare triple {1147#true} call #t~ret3 := main(); {1147#true} is VALID [2018-11-23 13:03:19,868 INFO L273 TraceCheckUtils]: 4: Hoare triple {1147#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:19,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:19,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:19,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:19,870 INFO L256 TraceCheckUtils]: 8: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:19,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:19,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:19,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:19,895 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1147#true} {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:19,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:19,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:19,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:19,912 INFO L256 TraceCheckUtils]: 16: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:19,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:19,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:19,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:19,913 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1147#true} {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:19,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:19,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:19,915 INFO L273 TraceCheckUtils]: 23: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:19,915 INFO L256 TraceCheckUtils]: 24: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:19,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:19,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:19,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:19,916 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1147#true} {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:19,920 INFO L273 TraceCheckUtils]: 29: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:19,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:19,923 INFO L273 TraceCheckUtils]: 31: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:03:19,923 INFO L256 TraceCheckUtils]: 32: Hoare triple {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:19,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:19,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:19,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:19,925 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1147#true} {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:03:19,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:03:19,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {1148#false} is VALID [2018-11-23 13:03:19,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {1148#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 13:03:19,927 INFO L256 TraceCheckUtils]: 40: Hoare triple {1148#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1148#false} is VALID [2018-11-23 13:03:19,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 13:03:19,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 13:03:19,929 INFO L273 TraceCheckUtils]: 43: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 13:03:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:03:19,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:19,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:19,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:03:19,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:03:19,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:20,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {1147#true} call ULTIMATE.init(); {1147#true} is VALID [2018-11-23 13:03:20,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:20,235 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1147#true} {1147#true} #38#return; {1147#true} is VALID [2018-11-23 13:03:20,235 INFO L256 TraceCheckUtils]: 3: Hoare triple {1147#true} call #t~ret3 := main(); {1147#true} is VALID [2018-11-23 13:03:20,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {1147#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:20,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:20,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:20,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {1149#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:20,238 INFO L256 TraceCheckUtils]: 8: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:20,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:20,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:20,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:20,239 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1147#true} {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:20,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:20,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:20,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1150#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:20,242 INFO L256 TraceCheckUtils]: 16: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:20,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:20,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:20,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:20,245 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1147#true} {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:20,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:20,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:20,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {1151#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:20,247 INFO L256 TraceCheckUtils]: 24: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:20,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:20,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:20,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:20,248 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1147#true} {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:20,249 INFO L273 TraceCheckUtils]: 29: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:20,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:20,251 INFO L273 TraceCheckUtils]: 31: Hoare triple {1152#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:20,251 INFO L256 TraceCheckUtils]: 32: Hoare triple {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1147#true} is VALID [2018-11-23 13:03:20,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {1147#true} ~cond := #in~cond; {1147#true} is VALID [2018-11-23 13:03:20,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {1147#true} assume !(0 == ~cond); {1147#true} is VALID [2018-11-23 13:03:20,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {1147#true} assume true; {1147#true} is VALID [2018-11-23 13:03:20,253 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1147#true} {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:20,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:20,255 INFO L273 TraceCheckUtils]: 38: Hoare triple {1250#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10); {1148#false} is VALID [2018-11-23 13:03:20,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {1148#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1148#false} is VALID [2018-11-23 13:03:20,255 INFO L256 TraceCheckUtils]: 40: Hoare triple {1148#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1148#false} is VALID [2018-11-23 13:03:20,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {1148#false} ~cond := #in~cond; {1148#false} is VALID [2018-11-23 13:03:20,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {1148#false} assume 0 == ~cond; {1148#false} is VALID [2018-11-23 13:03:20,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {1148#false} assume !false; {1148#false} is VALID [2018-11-23 13:03:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:03:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:03:20,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 13:03:20,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:20,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:20,324 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-23 13:03:20,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:20,325 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-11-23 13:03:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,721 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 13:03:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:20,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 13:03:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 13:03:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2018-11-23 13:03:20,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2018-11-23 13:03:20,821 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-23 13:03:20,823 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:03:20,824 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:03:20,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:03:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:03:20,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:20,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 13:03:20,935 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 13:03:20,935 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 13:03:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,937 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 13:03:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 13:03:20,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,939 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 13:03:20,939 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 13:03:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,942 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 13:03:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 13:03:20,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:20,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:03:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 13:03:20,946 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 44 [2018-11-23 13:03:20,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,947 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 13:03:20,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 13:03:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:03:20,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,949 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:20,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1878094685, now seen corresponding path program 5 times [2018-11-23 13:03:20,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:20,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2018-11-23 13:03:21,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,189 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} #38#return; {1504#true} is VALID [2018-11-23 13:03:21,189 INFO L256 TraceCheckUtils]: 3: Hoare triple {1504#true} call #t~ret3 := main(); {1504#true} is VALID [2018-11-23 13:03:21,190 INFO L273 TraceCheckUtils]: 4: Hoare triple {1504#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:21,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:21,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:03:21,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:21,193 INFO L256 TraceCheckUtils]: 8: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:03:21,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:03:21,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:03:21,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,194 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1504#true} {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:21,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:21,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:03:21,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:21,217 INFO L256 TraceCheckUtils]: 16: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:03:21,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:03:21,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:03:21,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,218 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1504#true} {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:21,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:21,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:03:21,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:21,220 INFO L256 TraceCheckUtils]: 24: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:03:21,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:03:21,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:03:21,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,223 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1504#true} {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:21,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:21,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:03:21,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:21,226 INFO L256 TraceCheckUtils]: 32: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:03:21,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:03:21,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:03:21,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,228 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1504#true} {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:21,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:21,230 INFO L273 TraceCheckUtils]: 38: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:03:21,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:03:21,231 INFO L256 TraceCheckUtils]: 40: Hoare triple {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:03:21,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:03:21,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:03:21,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:03:21,232 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1504#true} {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} #42#return; {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:03:21,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !false; {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:03:21,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {1511#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {1505#false} is VALID [2018-11-23 13:03:21,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {1505#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1505#false} is VALID [2018-11-23 13:03:21,234 INFO L256 TraceCheckUtils]: 48: Hoare triple {1505#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1505#false} is VALID [2018-11-23 13:03:21,235 INFO L273 TraceCheckUtils]: 49: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2018-11-23 13:03:21,235 INFO L273 TraceCheckUtils]: 50: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2018-11-23 13:03:21,236 INFO L273 TraceCheckUtils]: 51: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2018-11-23 13:03:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:03:21,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:04:03,473 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:04:03,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:04,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:05,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2018-11-23 13:04:05,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,195 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} #38#return; {1504#true} is VALID [2018-11-23 13:04:05,195 INFO L256 TraceCheckUtils]: 3: Hoare triple {1504#true} call #t~ret3 := main(); {1504#true} is VALID [2018-11-23 13:04:05,196 INFO L273 TraceCheckUtils]: 4: Hoare triple {1504#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:05,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:05,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:05,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {1506#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:05,198 INFO L256 TraceCheckUtils]: 8: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:04:05,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:04:05,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:04:05,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,199 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1504#true} {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:05,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:05,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:05,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1507#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:05,201 INFO L256 TraceCheckUtils]: 16: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:04:05,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:04:05,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:04:05,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,203 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1504#true} {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:05,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:05,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:05,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {1508#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:05,213 INFO L256 TraceCheckUtils]: 24: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:04:05,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:04:05,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:04:05,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,215 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1504#true} {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:05,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:05,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:05,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {1509#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:05,217 INFO L256 TraceCheckUtils]: 32: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:04:05,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:04:05,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:04:05,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,218 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1504#true} {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:05,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:05,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:05,221 INFO L273 TraceCheckUtils]: 39: Hoare triple {1510#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:05,221 INFO L256 TraceCheckUtils]: 40: Hoare triple {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1504#true} is VALID [2018-11-23 13:04:05,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2018-11-23 13:04:05,222 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2018-11-23 13:04:05,222 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#true} assume true; {1504#true} is VALID [2018-11-23 13:04:05,223 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1504#true} {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:05,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:05,228 INFO L273 TraceCheckUtils]: 46: Hoare triple {1632#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {1505#false} is VALID [2018-11-23 13:04:05,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {1505#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1505#false} is VALID [2018-11-23 13:04:05,229 INFO L256 TraceCheckUtils]: 48: Hoare triple {1505#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1505#false} is VALID [2018-11-23 13:04:05,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2018-11-23 13:04:05,229 INFO L273 TraceCheckUtils]: 50: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2018-11-23 13:04:05,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2018-11-23 13:04:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:04:05,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:05,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:04:05,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 13:04:05,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:05,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:04:05,310 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-23 13:04:05,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:04:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:04:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:04:05,311 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 9 states. [2018-11-23 13:04:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:05,914 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 13:04:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:04:05,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 13:04:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-23 13:04:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:04:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-23 13:04:05,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2018-11-23 13:04:05,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:05,996 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:04:05,996 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:04:05,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 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-23 13:04:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:04:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:04:06,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:06,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 13:04:06,045 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 13:04:06,046 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 13:04:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:06,049 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 13:04:06,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 13:04:06,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:06,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:06,050 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 13:04:06,050 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 13:04:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:06,052 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 13:04:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 13:04:06,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:06,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:06,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:06,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:04:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 13:04:06,056 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 52 [2018-11-23 13:04:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:06,056 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 13:04:06,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:04:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 13:04:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:04:06,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:06,058 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:06,058 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:06,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1262160983, now seen corresponding path program 6 times [2018-11-23 13:04:06,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:06,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:06,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:06,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:06,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2018-11-23 13:04:06,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,366 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1906#true} {1906#true} #38#return; {1906#true} is VALID [2018-11-23 13:04:06,366 INFO L256 TraceCheckUtils]: 3: Hoare triple {1906#true} call #t~ret3 := main(); {1906#true} is VALID [2018-11-23 13:04:06,367 INFO L273 TraceCheckUtils]: 4: Hoare triple {1906#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:06,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:06,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:06,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {1908#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:06,369 INFO L256 TraceCheckUtils]: 8: Hoare triple {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,370 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1906#true} {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:06,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:06,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:06,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {1909#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:06,371 INFO L256 TraceCheckUtils]: 16: Hoare triple {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,373 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1906#true} {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:06,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:06,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:06,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {1910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:06,375 INFO L256 TraceCheckUtils]: 24: Hoare triple {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,375 INFO L273 TraceCheckUtils]: 27: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,376 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1906#true} {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:06,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:06,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:06,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {1911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:06,378 INFO L256 TraceCheckUtils]: 32: Hoare triple {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,378 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,379 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1906#true} {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:06,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:06,381 INFO L273 TraceCheckUtils]: 38: Hoare triple {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:06,382 INFO L273 TraceCheckUtils]: 39: Hoare triple {1912#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:06,382 INFO L256 TraceCheckUtils]: 40: Hoare triple {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,382 INFO L273 TraceCheckUtils]: 42: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,383 INFO L273 TraceCheckUtils]: 43: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,383 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1906#true} {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:06,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:06,385 INFO L273 TraceCheckUtils]: 46: Hoare triple {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:06,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {1913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:06,386 INFO L256 TraceCheckUtils]: 48: Hoare triple {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:06,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:06,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:06,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:06,388 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1906#true} {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:06,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:06,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {1907#false} is VALID [2018-11-23 13:04:06,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {1907#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1907#false} is VALID [2018-11-23 13:04:06,390 INFO L256 TraceCheckUtils]: 56: Hoare triple {1907#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1907#false} is VALID [2018-11-23 13:04:06,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {1907#false} ~cond := #in~cond; {1907#false} is VALID [2018-11-23 13:04:06,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {1907#false} assume 0 == ~cond; {1907#false} is VALID [2018-11-23 13:04:06,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2018-11-23 13:04:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:04:06,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:06,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:04:36,044 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 13:04:36,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:42,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2018-11-23 13:04:42,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,544 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1906#true} {1906#true} #38#return; {1906#true} is VALID [2018-11-23 13:04:42,544 INFO L256 TraceCheckUtils]: 3: Hoare triple {1906#true} call #t~ret3 := main(); {1906#true} is VALID [2018-11-23 13:04:42,545 INFO L273 TraceCheckUtils]: 4: Hoare triple {1906#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1930#(= 0 main_~sn~0)} is VALID [2018-11-23 13:04:42,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {1930#(= 0 main_~sn~0)} assume !false; {1930#(= 0 main_~sn~0)} is VALID [2018-11-23 13:04:42,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {1930#(= 0 main_~sn~0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1937#(= 2 main_~sn~0)} is VALID [2018-11-23 13:04:42,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {1937#(= 2 main_~sn~0)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1937#(= 2 main_~sn~0)} is VALID [2018-11-23 13:04:42,547 INFO L256 TraceCheckUtils]: 8: Hoare triple {1937#(= 2 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {1906#true} ~cond := #in~cond; {1947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:42,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {1947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:04:42,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:04:42,550 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1951#(not (= |__VERIFIER_assert_#in~cond| 0))} {1937#(= 2 main_~sn~0)} #42#return; {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} is VALID [2018-11-23 13:04:42,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} assume !false; {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} is VALID [2018-11-23 13:04:42,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} is VALID [2018-11-23 13:04:42,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {1958#(= (mod (* 2 main_~x~0) 4294967296) 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} is VALID [2018-11-23 13:04:42,553 INFO L256 TraceCheckUtils]: 16: Hoare triple {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:42,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:42,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,554 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1906#true} {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} #42#return; {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} is VALID [2018-11-23 13:04:42,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} assume !false; {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} is VALID [2018-11-23 13:04:42,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} is VALID [2018-11-23 13:04:42,555 INFO L273 TraceCheckUtils]: 23: Hoare triple {1968#(= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} is VALID [2018-11-23 13:04:42,556 INFO L256 TraceCheckUtils]: 24: Hoare triple {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:42,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:42,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,557 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1906#true} {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} #42#return; {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} is VALID [2018-11-23 13:04:42,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} assume !false; {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} is VALID [2018-11-23 13:04:42,558 INFO L273 TraceCheckUtils]: 30: Hoare triple {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} is VALID [2018-11-23 13:04:42,559 INFO L273 TraceCheckUtils]: 31: Hoare triple {1993#(= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) 2)} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} is VALID [2018-11-23 13:04:42,559 INFO L256 TraceCheckUtils]: 32: Hoare triple {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,559 INFO L273 TraceCheckUtils]: 33: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:42,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:42,559 INFO L273 TraceCheckUtils]: 35: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,560 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1906#true} {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} #42#return; {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} is VALID [2018-11-23 13:04:42,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} assume !false; {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} is VALID [2018-11-23 13:04:42,561 INFO L273 TraceCheckUtils]: 38: Hoare triple {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} is VALID [2018-11-23 13:04:42,563 INFO L273 TraceCheckUtils]: 39: Hoare triple {2018#(= 2 (mod (+ (* 2 main_~x~0) 4294967290) 4294967296))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} is VALID [2018-11-23 13:04:42,563 INFO L256 TraceCheckUtils]: 40: Hoare triple {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:42,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:42,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,564 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1906#true} {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} #42#return; {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} is VALID [2018-11-23 13:04:42,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} assume !false; {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} is VALID [2018-11-23 13:04:42,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {2043#(= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2065#(and (= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2) (< (mod main_~x~0 4294967296) 10))} is VALID [2018-11-23 13:04:42,569 INFO L273 TraceCheckUtils]: 47: Hoare triple {2065#(and (= (mod (+ (* 2 main_~x~0) 4294967288) 4294967296) 2) (< (mod main_~x~0 4294967296) 10))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} is VALID [2018-11-23 13:04:42,569 INFO L256 TraceCheckUtils]: 48: Hoare triple {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1906#true} is VALID [2018-11-23 13:04:42,569 INFO L273 TraceCheckUtils]: 49: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2018-11-23 13:04:42,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2018-11-23 13:04:42,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {1906#true} assume true; {1906#true} is VALID [2018-11-23 13:04:42,570 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1906#true} {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} #42#return; {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} is VALID [2018-11-23 13:04:42,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} assume !false; {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} is VALID [2018-11-23 13:04:42,578 INFO L273 TraceCheckUtils]: 54: Hoare triple {2069#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (+ (* 2 main_~x~0) 4294967286) 4294967296) 2))} assume !(~x~0 % 4294967296 < 10); {1907#false} is VALID [2018-11-23 13:04:42,579 INFO L273 TraceCheckUtils]: 55: Hoare triple {1907#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1907#false} is VALID [2018-11-23 13:04:42,579 INFO L256 TraceCheckUtils]: 56: Hoare triple {1907#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1907#false} is VALID [2018-11-23 13:04:42,579 INFO L273 TraceCheckUtils]: 57: Hoare triple {1907#false} ~cond := #in~cond; {1907#false} is VALID [2018-11-23 13:04:42,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {1907#false} assume 0 == ~cond; {1907#false} is VALID [2018-11-23 13:04:42,579 INFO L273 TraceCheckUtils]: 59: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2018-11-23 13:04:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 24 proven. 86 refuted. 1 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:04:42,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-11-23 13:04:42,609 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-23 13:04:42,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:42,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:04:42,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:04:42,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:04:42,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=329, Unknown=1, NotChecked=0, Total=380 [2018-11-23 13:04:42,724 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 20 states. [2018-11-23 13:04:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,556 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-23 13:04:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:04:52,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-23 13:04:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:04:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2018-11-23 13:04:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:04:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2018-11-23 13:04:52,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 63 transitions. [2018-11-23 13:04:52,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:52,638 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:04:52,638 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:04:52,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=74, Invalid=525, Unknown=1, NotChecked=0, Total=600 [2018-11-23 13:04:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:04:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 13:04:52,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:52,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 13:04:52,697 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 13:04:52,697 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 13:04:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,700 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 13:04:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 13:04:52,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:52,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:52,701 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 13:04:52,701 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 13:04:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,704 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 13:04:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 13:04:52,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:52,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:52,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:52,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:04:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-23 13:04:52,707 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 60 [2018-11-23 13:04:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:52,707 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-23 13:04:52,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:04:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 13:04:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:04:52,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:52,709 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:52,709 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:52,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:52,709 INFO L82 PathProgramCache]: Analyzing trace with hash 977341265, now seen corresponding path program 7 times [2018-11-23 13:04:52,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:52,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {2380#true} call ULTIMATE.init(); {2380#true} is VALID [2018-11-23 13:04:53,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,703 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2380#true} {2380#true} #38#return; {2380#true} is VALID [2018-11-23 13:04:53,703 INFO L256 TraceCheckUtils]: 3: Hoare triple {2380#true} call #t~ret3 := main(); {2380#true} is VALID [2018-11-23 13:04:53,704 INFO L273 TraceCheckUtils]: 4: Hoare triple {2380#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:53,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:53,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:53,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:53,706 INFO L256 TraceCheckUtils]: 8: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,712 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2380#true} {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:53,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:53,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:53,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:53,714 INFO L256 TraceCheckUtils]: 16: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,715 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2380#true} {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:53,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:53,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:53,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:53,718 INFO L256 TraceCheckUtils]: 24: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,726 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2380#true} {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:53,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:53,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:53,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:53,732 INFO L256 TraceCheckUtils]: 32: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,733 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2380#true} {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:53,733 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:53,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:53,734 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:53,734 INFO L256 TraceCheckUtils]: 40: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,735 INFO L273 TraceCheckUtils]: 41: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,735 INFO L273 TraceCheckUtils]: 43: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,736 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2380#true} {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:53,736 INFO L273 TraceCheckUtils]: 45: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:53,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:53,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:53,738 INFO L256 TraceCheckUtils]: 48: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,755 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2380#true} {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #42#return; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:53,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:53,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:53,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:53,763 INFO L256 TraceCheckUtils]: 56: Hoare triple {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:53,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:53,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:53,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:53,764 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2380#true} {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:53,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:53,765 INFO L273 TraceCheckUtils]: 62: Hoare triple {2389#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {2381#false} is VALID [2018-11-23 13:04:53,765 INFO L273 TraceCheckUtils]: 63: Hoare triple {2381#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2381#false} is VALID [2018-11-23 13:04:53,765 INFO L256 TraceCheckUtils]: 64: Hoare triple {2381#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2381#false} is VALID [2018-11-23 13:04:53,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {2381#false} ~cond := #in~cond; {2381#false} is VALID [2018-11-23 13:04:53,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {2381#false} assume 0 == ~cond; {2381#false} is VALID [2018-11-23 13:04:53,766 INFO L273 TraceCheckUtils]: 67: Hoare triple {2381#false} assume !false; {2381#false} is VALID [2018-11-23 13:04:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:04:53,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:53,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:53,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:54,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {2380#true} call ULTIMATE.init(); {2380#true} is VALID [2018-11-23 13:04:54,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,020 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2380#true} {2380#true} #38#return; {2380#true} is VALID [2018-11-23 13:04:54,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {2380#true} call #t~ret3 := main(); {2380#true} is VALID [2018-11-23 13:04:54,021 INFO L273 TraceCheckUtils]: 4: Hoare triple {2380#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:54,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:54,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:54,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {2382#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:54,024 INFO L256 TraceCheckUtils]: 8: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,025 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2380#true} {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:54,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:54,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:54,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {2383#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:54,027 INFO L256 TraceCheckUtils]: 16: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,028 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2380#true} {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:54,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:54,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:54,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {2384#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:54,030 INFO L256 TraceCheckUtils]: 24: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,031 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2380#true} {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:54,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:54,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:54,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {2385#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:54,032 INFO L256 TraceCheckUtils]: 32: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,034 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2380#true} {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:54,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:54,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:54,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {2386#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:54,036 INFO L256 TraceCheckUtils]: 40: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,036 INFO L273 TraceCheckUtils]: 41: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,036 INFO L273 TraceCheckUtils]: 42: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,037 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2380#true} {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:54,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:54,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:54,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {2387#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:54,039 INFO L256 TraceCheckUtils]: 48: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,040 INFO L273 TraceCheckUtils]: 50: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,040 INFO L273 TraceCheckUtils]: 51: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,041 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2380#true} {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #42#return; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:54,042 INFO L273 TraceCheckUtils]: 53: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:54,042 INFO L273 TraceCheckUtils]: 54: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:54,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {2388#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:54,043 INFO L256 TraceCheckUtils]: 56: Hoare triple {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2380#true} is VALID [2018-11-23 13:04:54,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {2380#true} ~cond := #in~cond; {2380#true} is VALID [2018-11-23 13:04:54,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {2380#true} assume !(0 == ~cond); {2380#true} is VALID [2018-11-23 13:04:54,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {2380#true} assume true; {2380#true} is VALID [2018-11-23 13:04:54,044 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2380#true} {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #42#return; {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:54,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:54,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {2558#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {2381#false} is VALID [2018-11-23 13:04:54,060 INFO L273 TraceCheckUtils]: 63: Hoare triple {2381#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2381#false} is VALID [2018-11-23 13:04:54,060 INFO L256 TraceCheckUtils]: 64: Hoare triple {2381#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2381#false} is VALID [2018-11-23 13:04:54,060 INFO L273 TraceCheckUtils]: 65: Hoare triple {2381#false} ~cond := #in~cond; {2381#false} is VALID [2018-11-23 13:04:54,061 INFO L273 TraceCheckUtils]: 66: Hoare triple {2381#false} assume 0 == ~cond; {2381#false} is VALID [2018-11-23 13:04:54,061 INFO L273 TraceCheckUtils]: 67: Hoare triple {2381#false} assume !false; {2381#false} is VALID [2018-11-23 13:04:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:04:54,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:04:54,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 13:04:54,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:54,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:04:54,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:54,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:04:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:04:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:54,151 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2018-11-23 13:04:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,026 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 13:04:55,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:04:55,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 13:04:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 13:04:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:04:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-23 13:04:55,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2018-11-23 13:04:55,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:55,101 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:04:55,101 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:04:55,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:04:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:04:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:04:55,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:55,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:04:55,190 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:04:55,190 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:04:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,193 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 13:04:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 13:04:55,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,194 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:04:55,194 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:04:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:55,197 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 13:04:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 13:04:55,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:55,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:55,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:55,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:04:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2018-11-23 13:04:55,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 68 [2018-11-23 13:04:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:55,200 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-23 13:04:55,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:04:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-23 13:04:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:04:55,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,202 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:55,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash 87912523, now seen corresponding path program 8 times [2018-11-23 13:04:55,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:55,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {2872#true} call ULTIMATE.init(); {2872#true} is VALID [2018-11-23 13:04:55,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,648 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2872#true} {2872#true} #38#return; {2872#true} is VALID [2018-11-23 13:04:55,648 INFO L256 TraceCheckUtils]: 3: Hoare triple {2872#true} call #t~ret3 := main(); {2872#true} is VALID [2018-11-23 13:04:55,649 INFO L273 TraceCheckUtils]: 4: Hoare triple {2872#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,652 INFO L256 TraceCheckUtils]: 8: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,673 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2872#true} {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,680 INFO L256 TraceCheckUtils]: 16: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,682 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2872#true} {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,684 INFO L256 TraceCheckUtils]: 24: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,686 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2872#true} {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:55,689 INFO L256 TraceCheckUtils]: 32: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,691 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2872#true} {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:55,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:55,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:55,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:55,697 INFO L256 TraceCheckUtils]: 40: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,697 INFO L273 TraceCheckUtils]: 43: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,698 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2872#true} {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:55,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:55,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:55,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:55,701 INFO L256 TraceCheckUtils]: 48: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,701 INFO L273 TraceCheckUtils]: 49: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,701 INFO L273 TraceCheckUtils]: 51: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,703 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2872#true} {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #42#return; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:55,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:55,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:55,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:55,705 INFO L256 TraceCheckUtils]: 56: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,707 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2872#true} {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #42#return; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:55,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:55,713 INFO L273 TraceCheckUtils]: 62: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:55,714 INFO L273 TraceCheckUtils]: 63: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:55,714 INFO L256 TraceCheckUtils]: 64: Hoare triple {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,714 INFO L273 TraceCheckUtils]: 65: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,714 INFO L273 TraceCheckUtils]: 66: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,715 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2872#true} {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:55,716 INFO L273 TraceCheckUtils]: 69: Hoare triple {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:55,716 INFO L273 TraceCheckUtils]: 70: Hoare triple {2882#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {2873#false} is VALID [2018-11-23 13:04:55,716 INFO L273 TraceCheckUtils]: 71: Hoare triple {2873#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2873#false} is VALID [2018-11-23 13:04:55,717 INFO L256 TraceCheckUtils]: 72: Hoare triple {2873#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2873#false} is VALID [2018-11-23 13:04:55,717 INFO L273 TraceCheckUtils]: 73: Hoare triple {2873#false} ~cond := #in~cond; {2873#false} is VALID [2018-11-23 13:04:55,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {2873#false} assume 0 == ~cond; {2873#false} is VALID [2018-11-23 13:04:55,718 INFO L273 TraceCheckUtils]: 75: Hoare triple {2873#false} assume !false; {2873#false} is VALID [2018-11-23 13:04:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:04:55,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:55,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:55,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:55,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:55,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:55,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {2872#true} call ULTIMATE.init(); {2872#true} is VALID [2018-11-23 13:04:55,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2872#true} {2872#true} #38#return; {2872#true} is VALID [2018-11-23 13:04:55,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {2872#true} call #t~ret3 := main(); {2872#true} is VALID [2018-11-23 13:04:55,984 INFO L273 TraceCheckUtils]: 4: Hoare triple {2872#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:55,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {2874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,986 INFO L256 TraceCheckUtils]: 8: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,987 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2872#true} {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:55,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {2875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,990 INFO L256 TraceCheckUtils]: 16: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,992 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {2872#true} {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:55,994 INFO L273 TraceCheckUtils]: 23: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,994 INFO L256 TraceCheckUtils]: 24: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,994 INFO L273 TraceCheckUtils]: 25: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,995 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2872#true} {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:55,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {2877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:55,997 INFO L256 TraceCheckUtils]: 32: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:55,998 INFO L273 TraceCheckUtils]: 33: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:55,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:55,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:55,999 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2872#true} {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:56,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:56,001 INFO L273 TraceCheckUtils]: 38: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:56,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {2878#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:56,002 INFO L256 TraceCheckUtils]: 40: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:56,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:56,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:56,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:56,003 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2872#true} {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:56,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:56,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:56,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {2879#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:56,005 INFO L256 TraceCheckUtils]: 48: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:56,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:56,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:56,006 INFO L273 TraceCheckUtils]: 51: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:56,027 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2872#true} {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #42#return; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:56,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:56,042 INFO L273 TraceCheckUtils]: 54: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:56,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {2880#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:56,043 INFO L256 TraceCheckUtils]: 56: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:56,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:56,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:56,043 INFO L273 TraceCheckUtils]: 59: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:56,044 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2872#true} {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #42#return; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:56,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:56,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:56,050 INFO L273 TraceCheckUtils]: 63: Hoare triple {2881#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:56,050 INFO L256 TraceCheckUtils]: 64: Hoare triple {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2872#true} is VALID [2018-11-23 13:04:56,050 INFO L273 TraceCheckUtils]: 65: Hoare triple {2872#true} ~cond := #in~cond; {2872#true} is VALID [2018-11-23 13:04:56,050 INFO L273 TraceCheckUtils]: 66: Hoare triple {2872#true} assume !(0 == ~cond); {2872#true} is VALID [2018-11-23 13:04:56,051 INFO L273 TraceCheckUtils]: 67: Hoare triple {2872#true} assume true; {2872#true} is VALID [2018-11-23 13:04:56,067 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {2872#true} {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #42#return; {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:56,076 INFO L273 TraceCheckUtils]: 69: Hoare triple {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !false; {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:56,089 INFO L273 TraceCheckUtils]: 70: Hoare triple {3075#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 10); {2873#false} is VALID [2018-11-23 13:04:56,089 INFO L273 TraceCheckUtils]: 71: Hoare triple {2873#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2873#false} is VALID [2018-11-23 13:04:56,090 INFO L256 TraceCheckUtils]: 72: Hoare triple {2873#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {2873#false} is VALID [2018-11-23 13:04:56,090 INFO L273 TraceCheckUtils]: 73: Hoare triple {2873#false} ~cond := #in~cond; {2873#false} is VALID [2018-11-23 13:04:56,090 INFO L273 TraceCheckUtils]: 74: Hoare triple {2873#false} assume 0 == ~cond; {2873#false} is VALID [2018-11-23 13:04:56,090 INFO L273 TraceCheckUtils]: 75: Hoare triple {2873#false} assume !false; {2873#false} is VALID [2018-11-23 13:04:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:04:56,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:56,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:04:56,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 13:04:56,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:56,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:04:56,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:04:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:04:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:04:56,202 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 12 states. [2018-11-23 13:04:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,073 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-23 13:04:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:04:57,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 13:04:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 13:04:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 13:04:57,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 13:04:57,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:57,143 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:04:57,144 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:04:57,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:04:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:04:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:04:57,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:04:57,215 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:04:57,215 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:04:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,218 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 13:04:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 13:04:57,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,218 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:04:57,218 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:04:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,220 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 13:04:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 13:04:57,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:04:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-23 13:04:57,224 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 76 [2018-11-23 13:04:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,224 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-23 13:04:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:04:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-23 13:04:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 13:04:57,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,225 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:57,226 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1704314043, now seen corresponding path program 9 times [2018-11-23 13:04:57,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2018-11-23 13:04:57,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3409#true} {3409#true} #38#return; {3409#true} is VALID [2018-11-23 13:04:57,485 INFO L256 TraceCheckUtils]: 3: Hoare triple {3409#true} call #t~ret3 := main(); {3409#true} is VALID [2018-11-23 13:04:57,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {3409#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {3411#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:57,489 INFO L256 TraceCheckUtils]: 8: Hoare triple {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,491 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3409#true} {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #42#return; {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:57,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:57,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:57,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {3412#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:57,493 INFO L256 TraceCheckUtils]: 16: Hoare triple {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,494 INFO L273 TraceCheckUtils]: 18: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,494 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {3409#true} {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #42#return; {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:57,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:57,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:57,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {3413#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:57,497 INFO L256 TraceCheckUtils]: 24: Hoare triple {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,498 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3409#true} {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #42#return; {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:57,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:57,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:04:57,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {3414#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:57,502 INFO L256 TraceCheckUtils]: 32: Hoare triple {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,504 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3409#true} {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #42#return; {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:57,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:57,506 INFO L273 TraceCheckUtils]: 38: Hoare triple {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:04:57,506 INFO L273 TraceCheckUtils]: 39: Hoare triple {3415#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:57,506 INFO L256 TraceCheckUtils]: 40: Hoare triple {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,507 INFO L273 TraceCheckUtils]: 42: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,507 INFO L273 TraceCheckUtils]: 43: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,507 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3409#true} {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #42#return; {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:57,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:57,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:04:57,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {3416#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:57,511 INFO L256 TraceCheckUtils]: 48: Hoare triple {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,511 INFO L273 TraceCheckUtils]: 49: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,511 INFO L273 TraceCheckUtils]: 50: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,513 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3409#true} {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #42#return; {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:57,513 INFO L273 TraceCheckUtils]: 53: Hoare triple {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:57,515 INFO L273 TraceCheckUtils]: 54: Hoare triple {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:04:57,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {3417#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:57,515 INFO L256 TraceCheckUtils]: 56: Hoare triple {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,516 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {3409#true} {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #42#return; {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:57,518 INFO L273 TraceCheckUtils]: 61: Hoare triple {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:57,518 INFO L273 TraceCheckUtils]: 62: Hoare triple {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:04:57,520 INFO L273 TraceCheckUtils]: 63: Hoare triple {3418#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:57,520 INFO L256 TraceCheckUtils]: 64: Hoare triple {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,520 INFO L273 TraceCheckUtils]: 65: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,520 INFO L273 TraceCheckUtils]: 66: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,521 INFO L273 TraceCheckUtils]: 67: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,522 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {3409#true} {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #42#return; {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:57,522 INFO L273 TraceCheckUtils]: 69: Hoare triple {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !false; {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:57,524 INFO L273 TraceCheckUtils]: 70: Hoare triple {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:04:57,524 INFO L273 TraceCheckUtils]: 71: Hoare triple {3419#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:57,524 INFO L256 TraceCheckUtils]: 72: Hoare triple {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3409#true} is VALID [2018-11-23 13:04:57,525 INFO L273 TraceCheckUtils]: 73: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-23 13:04:57,525 INFO L273 TraceCheckUtils]: 74: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2018-11-23 13:04:57,525 INFO L273 TraceCheckUtils]: 75: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-23 13:04:57,525 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {3409#true} {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} #42#return; {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:57,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:57,528 INFO L273 TraceCheckUtils]: 78: Hoare triple {3420#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {3410#false} is VALID [2018-11-23 13:04:57,528 INFO L273 TraceCheckUtils]: 79: Hoare triple {3410#false} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3410#false} is VALID [2018-11-23 13:04:57,528 INFO L256 TraceCheckUtils]: 80: Hoare triple {3410#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {3410#false} is VALID [2018-11-23 13:04:57,528 INFO L273 TraceCheckUtils]: 81: Hoare triple {3410#false} ~cond := #in~cond; {3410#false} is VALID [2018-11-23 13:04:57,528 INFO L273 TraceCheckUtils]: 82: Hoare triple {3410#false} assume 0 == ~cond; {3410#false} is VALID [2018-11-23 13:04:57,529 INFO L273 TraceCheckUtils]: 83: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2018-11-23 13:04:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 13:04:57,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:57,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:57,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2