./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/a.01.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/a.01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 403dc91589da6bf860a5e1f8b16384fde1e35c86 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:31:05,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:31:05,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:31:05,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:31:05,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:31:05,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:31:05,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:31:05,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:31:05,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:31:05,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:31:05,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:31:05,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:31:05,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:31:05,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:31:05,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:31:05,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:31:05,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:31:05,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:31:05,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:31:05,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:31:05,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:31:05,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:31:05,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:31:05,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:31:05,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:31:05,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:31:05,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:31:05,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:31:05,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:31:05,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:31:05,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:31:05,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:31:05,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:31:05,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:31:05,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:31:05,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:31:05,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:31:05,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:31:05,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:31:05,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:31:05,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:31:05,641 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:31:05,658 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:31:05,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:31:05,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:31:05,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:31:05,662 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:31:05,662 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:31:05,663 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:31:05,663 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:31:05,663 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:31:05,663 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:31:05,664 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:31:05,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:31:05,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:31:05,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:31:05,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:31:05,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:31:05,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:31:05,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:31:05,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:31:05,668 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:31:05,668 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:31:05,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:31:05,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:31:05,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:31:05,671 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:31:05,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:31:05,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:31:05,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:31:05,672 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:31:05,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:31:05,674 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 403dc91589da6bf860a5e1f8b16384fde1e35c86 [2020-07-29 01:31:05,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:31:05,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:31:05,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:31:05,978 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:31:05,978 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:31:05,979 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/a.01.c [2020-07-29 01:31:06,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c78d6c23f/abd4152171ea44c29bd08100d761b19c/FLAG0de890f9a [2020-07-29 01:31:06,408 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:31:06,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/a.01.c [2020-07-29 01:31:06,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c78d6c23f/abd4152171ea44c29bd08100d761b19c/FLAG0de890f9a [2020-07-29 01:31:06,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c78d6c23f/abd4152171ea44c29bd08100d761b19c [2020-07-29 01:31:06,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:31:06,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:31:06,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:06,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:31:06,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:31:06,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:06" (1/1) ... [2020-07-29 01:31:06,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb551b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:06, skipping insertion in model container [2020-07-29 01:31:06,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:06" (1/1) ... [2020-07-29 01:31:06,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:31:06,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:31:06,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:06,994 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:31:07,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:07,025 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:31:07,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07 WrapperNode [2020-07-29 01:31:07,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:07,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:07,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:31:07,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:31:07,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:07,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:31:07,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:31:07,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:31:07,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (1/1) ... [2020-07-29 01:31:07,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:31:07,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:31:07,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:31:07,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:31:07,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:07,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:31:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:31:07,444 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:31:07,444 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:31:07,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:07 BoogieIcfgContainer [2020-07-29 01:31:07,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:31:07,451 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:31:07,452 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:31:07,456 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:31:07,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:07,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:31:06" (1/3) ... [2020-07-29 01:31:07,458 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7febbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:07, skipping insertion in model container [2020-07-29 01:31:07,458 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:07,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:07" (2/3) ... [2020-07-29 01:31:07,459 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7febbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:07, skipping insertion in model container [2020-07-29 01:31:07,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:07,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:07" (3/3) ... [2020-07-29 01:31:07,461 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.01.c [2020-07-29 01:31:07,569 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:31:07,572 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:31:07,574 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:31:07,574 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:31:07,575 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:31:07,575 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:31:07,575 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:31:07,575 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:31:07,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:07,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:07,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:07,654 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:31:07,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:07,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:07,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:07,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:07,659 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:07,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:07,668 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 10#L11-2true [2020-07-29 01:31:07,671 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-2true assume !!(main_~x~0 > 0);main_~y~0 := 0; 5#L13-2true assume !(main_~y~0 < main_~x~0); 3#L13-3true main_~x~0 := main_~x~0 - 1; 10#L11-2true [2020-07-29 01:31:07,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:31:07,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:07,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050223024] [2020-07-29 01:31:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:07,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:07,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:07,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:31:07,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:07,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109311004] [2020-07-29 01:31:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:07,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} assume !!(main_~x~0 > 0);main_~y~0 := 0; {16#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:31:07,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#(<= (+ ULTIMATE.start_main_~y~0 1) ULTIMATE.start_main_~x~0)} assume !(main_~y~0 < main_~x~0); {15#false} is VALID [2020-07-29 01:31:07,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} main_~x~0 := main_~x~0 - 1; {15#false} is VALID [2020-07-29 01:31:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:07,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109311004] [2020-07-29 01:31:07,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:31:07,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:31:07,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818177757] [2020-07-29 01:31:07,894 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:07,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:31:07,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:31:07,911 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-07-29 01:31:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:07,956 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:31:07,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:31:07,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:07,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:07,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:31:07,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:07,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2020-07-29 01:31:07,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:31:07,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:31:07,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-07-29 01:31:07,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:07,981 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-07-29 01:31:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-29 01:31:08,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:08,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:08,006 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:08,007 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:08,008 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:31:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:08,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:08,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:08,010 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:31:08,010 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:31:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:08,011 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:31:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:08,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:08,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:08,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:08,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-07-29 01:31:08,014 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:08,014 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:08,014 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:31:08,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:08,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:08,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:08,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:08,016 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:08,016 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:31:08,016 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 27#L11-2 [2020-07-29 01:31:08,016 INFO L796 eck$LassoCheckResult]: Loop: 27#L11-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 29#L13-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 30#L13-2 assume !(main_~y~0 < main_~x~0); 26#L13-3 main_~x~0 := main_~x~0 - 1; 27#L11-2 [2020-07-29 01:31:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,017 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:31:08,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974168558] [2020-07-29 01:31:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,027 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2020-07-29 01:31:08,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739382645] [2020-07-29 01:31:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,043 INFO L82 PathProgramCache]: Analyzing trace with hash 29869391, now seen corresponding path program 1 times [2020-07-29 01:31:08,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:08,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847315157] [2020-07-29 01:31:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:08,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:08,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:08,181 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:08,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:08,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:08,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:08,183 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:08,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:08,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:08,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:08,184 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration2_Loop [2020-07-29 01:31:08,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:08,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:08,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:08,390 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:08,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:08,405 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:08,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:08,464 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:08,602 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:08,604 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:08,604 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:08,604 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:08,604 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:08,604 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:08,604 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:08,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:08,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:08,605 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration2_Loop [2020-07-29 01:31:08,605 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:08,605 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:08,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:08,773 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:08,780 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:08,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:08,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:08,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:08,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:08,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:08,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:08,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:08,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:08,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:08,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:08,834 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:08,840 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:08,840 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:08,841 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:08,842 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:31:08,890 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:08,895 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0);main_~y~0 := 0;" "assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0;" "assume !(main_~y~0 < main_~x~0);" "main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:31:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:08,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:08,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:08,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {50#unseeded} is VALID [2020-07-29 01:31:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:08,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:08,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:09,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0);main_~y~0 := 0; {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:31:09,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:31:09,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume !(main_~y~0 < main_~x~0); {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:31:09,009 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} main_~x~0 := main_~x~0 - 1; {63#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:31:09,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:09,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:09,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:31:09,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-07-29 01:31:09,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 9 states and 12 transitions. Complement of second has 4 states. [2020-07-29 01:31:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:09,094 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:09,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2020-07-29 01:31:09,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:09,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:09,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:09,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:09,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:09,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:09,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:31:09,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:09,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:09,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:09,100 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2020-07-29 01:31:09,102 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:31:09,103 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:09,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:09,106 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:09,107 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:09,108 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:09,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:09,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:09,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:31:09,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:09,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:09,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:09,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:09,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:09,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:31:09,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:31:09,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:31:09,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:31:09,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:09,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:09,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,146 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:09,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:31:09,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:31:09,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-29 01:31:09,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:09,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:09,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:09,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 11 transitions. [2020-07-29 01:31:09,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:31:09,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:31:09,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2020-07-29 01:31:09,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:09,154 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:31:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2020-07-29 01:31:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:31:09,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:09,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:31:09,157 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:31:09,157 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:31:09,158 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:09,160 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:31:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:31:09,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:09,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:09,161 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 11 transitions. [2020-07-29 01:31:09,161 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 11 transitions. [2020-07-29 01:31:09,164 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:09,165 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:31:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:31:09,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:09,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:09,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:09,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:31:09,167 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:31:09,167 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:31:09,167 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:31:09,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:31:09,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:09,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:09,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:09,169 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:31:09,169 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:09,169 INFO L794 eck$LassoCheckResult]: Stem: 95#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 96#L11-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 97#L13-2 [2020-07-29 01:31:09,169 INFO L796 eck$LassoCheckResult]: Loop: 97#L13-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 97#L13-2 [2020-07-29 01:31:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:31:09,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:09,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903173711] [2020-07-29 01:31:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,178 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:31:09,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:09,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277043309] [2020-07-29 01:31:09,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:09,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:09,197 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:31:09,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:09,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132772601] [2020-07-29 01:31:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:09,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:09,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:09,254 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:09,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:09,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:09,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:09,255 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:09,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:09,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:09,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration3_Loop [2020-07-29 01:31:09,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:09,256 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:09,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,368 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:09,368 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:09,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:09,382 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:09,382 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:09,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:09,418 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:09,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:09,460 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,652 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:09,654 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:09,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:09,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:09,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:09,655 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:09,655 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,655 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:09,656 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:09,656 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration3_Loop [2020-07-29 01:31:09,656 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:09,656 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:09,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:09,872 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:09,872 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:09,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:09,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:09,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:09,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:09,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:09,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:09,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:09,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:09,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:09,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:09,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:09,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:09,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:09,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:09,944 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:09,949 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:31:09,950 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:09,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:09,955 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:09,955 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:09,955 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:09,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:09,981 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0;" [2020-07-29 01:31:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:10,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {145#unseeded} is VALID [2020-07-29 01:31:10,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {145#unseeded} is VALID [2020-07-29 01:31:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,018 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:10,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {158#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded)} is VALID [2020-07-29 01:31:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:10,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:10,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:10,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,030 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:10,030 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:31:10,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 15 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:31:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:10,069 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:10,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:10,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:10,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:10,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:10,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:10,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:10,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:10,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:31:10,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:10,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:10,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:10,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:10,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:10,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:10,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:10,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:10,073 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:10,074 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:10,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:10,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:10,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:10,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:10,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:10,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:10,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:10,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,082 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:31:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:10,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:10,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:10,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2020-07-29 01:31:10,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:31:10,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:31:10,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2020-07-29 01:31:10,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:10,088 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:31:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2020-07-29 01:31:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2020-07-29 01:31:10,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:10,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:31:10,089 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:31:10,089 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:31:10,090 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:10,091 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:31:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:31:10,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:10,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:10,092 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:31:10,092 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:31:10,093 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:10,095 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:31:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:31:10,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:10,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:10,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:10,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:31:10,097 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:31:10,097 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:31:10,097 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:31:10,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:31:10,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:10,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:10,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:10,099 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:31:10,099 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:10,099 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 191#L11-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 193#L13-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 194#L13-2 assume !(main_~y~0 < main_~x~0); 188#L13-3 main_~x~0 := main_~x~0 - 1; 189#L11-2 assume !!(main_~x~0 > 0);main_~y~0 := 0; 192#L13-2 [2020-07-29 01:31:10,099 INFO L796 eck$LassoCheckResult]: Loop: 192#L13-2 assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; 192#L13-2 [2020-07-29 01:31:10,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:10,099 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 2 times [2020-07-29 01:31:10,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:10,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859212555] [2020-07-29 01:31:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {256#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {256#true} is VALID [2020-07-29 01:31:10,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} assume !!(main_~x~0 > 0);main_~y~0 := 0; {258#(<= ULTIMATE.start_main_~y~0 0)} is VALID [2020-07-29 01:31:10,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#(<= ULTIMATE.start_main_~y~0 0)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {259#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:10,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {259#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~y~0 < main_~x~0); {260#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:10,157 INFO L280 TraceCheckUtils]: 4: Hoare triple {260#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {261#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:31:10,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {261#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 > 0);main_~y~0 := 0; {257#false} is VALID [2020-07-29 01:31:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:10,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859212555] [2020-07-29 01:31:10,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629829244] [2020-07-29 01:31:10,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:10,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:31:10,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:10,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:10,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:10,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {256#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {256#true} is VALID [2020-07-29 01:31:10,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {256#true} assume !!(main_~x~0 > 0);main_~y~0 := 0; {258#(<= ULTIMATE.start_main_~y~0 0)} is VALID [2020-07-29 01:31:10,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {258#(<= ULTIMATE.start_main_~y~0 0)} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {259#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:10,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {259#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~y~0 < main_~x~0); {260#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:10,280 INFO L280 TraceCheckUtils]: 4: Hoare triple {260#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {261#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:31:10,281 INFO L280 TraceCheckUtils]: 5: Hoare triple {261#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 > 0);main_~y~0 := 0; {257#false} is VALID [2020-07-29 01:31:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:10,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:10,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:31:10,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369805310] [2020-07-29 01:31:10,283 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:31:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:31:10,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:10,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598950686] [2020-07-29 01:31:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:10,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:10,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:10,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:10,306 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:10,306 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:10,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:10,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:10,307 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:10,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:10,307 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:10,307 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration4_Loop [2020-07-29 01:31:10,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:10,308 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:10,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,418 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:10,418 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:10,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:10,435 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,443 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:10,443 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:10,483 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:10,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:10,538 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,735 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:10,738 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:10,738 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:10,738 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:10,738 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:10,738 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:10,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:10,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:10,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.01.c_Iteration4_Loop [2020-07-29 01:31:10,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:10,740 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:10,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:10,913 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:10,913 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:10,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:10,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:10,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:10,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:10,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:10,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:10,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:10,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:10,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:10,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:10,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:10,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:10,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:10,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:10,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:10,963 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:31:10,963 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:10,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:10,972 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:10,972 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:10,972 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~y~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:31:10,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:10,997 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0;" [2020-07-29 01:31:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {279#unseeded} is VALID [2020-07-29 01:31:11,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#unseeded} assume !(main_~y~0 < main_~x~0); {279#unseeded} is VALID [2020-07-29 01:31:11,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#unseeded} main_~x~0 := main_~x~0 - 1; {279#unseeded} is VALID [2020-07-29 01:31:11,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,040 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {292#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded)} is VALID [2020-07-29 01:31:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:11,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:11,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:11,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:11,051 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:11,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:31:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:11,089 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:11,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:31:11,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,092 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,092 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,092 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,093 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:11,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,100 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:11,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,101 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {279#unseeded} is VALID [2020-07-29 01:31:11,133 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#unseeded} assume !(main_~y~0 < main_~x~0); {279#unseeded} is VALID [2020-07-29 01:31:11,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#unseeded} main_~x~0 := main_~x~0 - 1; {279#unseeded} is VALID [2020-07-29 01:31:11,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,144 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {292#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded)} is VALID [2020-07-29 01:31:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:11,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:11,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:11,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:11,155 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:11,184 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:31:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:11,184 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:11,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:31:11,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:11,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:11,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,194 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:11,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,195 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:11,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#unseeded} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {279#unseeded} is VALID [2020-07-29 01:31:11,226 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#unseeded} assume !(main_~y~0 < main_~x~0); {279#unseeded} is VALID [2020-07-29 01:31:11,227 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#unseeded} main_~x~0 := main_~x~0 - 1; {279#unseeded} is VALID [2020-07-29 01:31:11,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#unseeded} assume !!(main_~x~0 > 0);main_~y~0 := 0; {279#unseeded} is VALID [2020-07-29 01:31:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,229 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:11,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:11,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))} assume !!(main_~y~0 < main_~x~0);main_~y~0 := 1 + main_~y~0; {292#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~x~0))) unseeded)} is VALID [2020-07-29 01:31:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:11,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:11,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:11,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,243 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:11,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:11,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2020-07-29 01:31:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:11,282 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:11,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:11,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:11,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:31:11,292 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:11,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:11,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,294 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,294 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:11,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:11,296 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:11,296 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:11,297 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:31:11,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:31:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:31:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:31:11,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:31:11,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:11,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:11,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,307 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:31:11,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:31:11,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:11,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:11,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:11,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-07-29 01:31:11,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:31:11,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:31:11,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:31:11,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:11,316 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:11,316 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:11,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:11,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:31:11,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:31:11,317 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-07-29 01:31:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:11,317 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:31:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:31:11,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:11,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:11,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:31:11,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:11,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:31:11,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:31:11,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:31:11,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:31:11,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:11,326 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:11,326 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:11,326 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:11,326 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:31:11,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:31:11,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:11,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:11,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:31:11 BoogieIcfgContainer [2020-07-29 01:31:11,334 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:31:11,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:31:11,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:31:11,334 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:31:11,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:07" (3/4) ... [2020-07-29 01:31:11,338 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:31:11,338 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:31:11,341 INFO L168 Benchmark]: Toolchain (without parser) took 4537.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:11,341 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:11,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:11,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.90 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:11,343 INFO L168 Benchmark]: Boogie Preprocessor took 117.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:11,344 INFO L168 Benchmark]: RCFGBuilder took 267.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:11,345 INFO L168 Benchmark]: BuchiAutomizer took 3882.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:11,345 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:11,350 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.21 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.90 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -218.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3882.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 20 SDtfs, 27 SDslu, 3 SDs, 0 SdLazy, 42 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax199 hnf96 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...