./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/McCarthyIterative.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 a5e4c58569d8caa47946d30f6cb501096837aef1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:30:59,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:30:59,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:30:59,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:30:59,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:30:59,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:30:59,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:30:59,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:30:59,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:30:59,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:30:59,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:30:59,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:30:59,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:30:59,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:30:59,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:30:59,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:30:59,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:30:59,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:30:59,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:30:59,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:30:59,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:30:59,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:30:59,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:30:59,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:30:59,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:30:59,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:30:59,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:30:59,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:30:59,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:30:59,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:30:59,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:30:59,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:30:59,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:30:59,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:30:59,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:30:59,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:30:59,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:30:59,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:30:59,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:30:59,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:30:59,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:30:59,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:30:59,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:30:59,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:30:59,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:30:59,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:30:59,699 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:30:59,699 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:30:59,699 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:30:59,699 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:30:59,699 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:30:59,700 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:30:59,700 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:30:59,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:30:59,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:30:59,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:30:59,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:30:59,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:30:59,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:30:59,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:30:59,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:30:59,703 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:30:59,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:30:59,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:30:59,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:30:59,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:30:59,704 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:30:59,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:30:59,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:30:59,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:30:59,705 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:30:59,706 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:30:59,706 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 -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2019-11-28 20:31:00,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:31:00,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:31:00,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:31:00,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:31:00,028 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:31:00,029 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-28 20:31:00,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00d7519f/3544901440b9445bb29b0a15257a1d24/FLAG135768016 [2019-11-28 20:31:00,585 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:31:00,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-28 20:31:00,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00d7519f/3544901440b9445bb29b0a15257a1d24/FLAG135768016 [2019-11-28 20:31:01,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f00d7519f/3544901440b9445bb29b0a15257a1d24 [2019-11-28 20:31:01,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:31:01,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:31:01,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:01,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:31:01,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:31:01,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3840934b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01, skipping insertion in model container [2019-11-28 20:31:01,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:31:01,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:31:01,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:01,273 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:31:01,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:31:01,307 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:31:01,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01 WrapperNode [2019-11-28 20:31:01,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:31:01,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:01,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:31:01,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:31:01,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:31:01,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:31:01,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:31:01,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:31:01,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (1/1) ... [2019-11-28 20:31:01,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:31:01,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:31:01,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:31:01,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:31:01,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (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 [2019-11-28 20:31:01,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:31:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:31:01,624 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:31:01,625 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:31:01,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:01 BoogieIcfgContainer [2019-11-28 20:31:01,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:31:01,627 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:31:01,627 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:31:01,630 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:31:01,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:01,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:31:01" (1/3) ... [2019-11-28 20:31:01,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53929d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:01, skipping insertion in model container [2019-11-28 20:31:01,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:01,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:31:01" (2/3) ... [2019-11-28 20:31:01,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53929d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:31:01, skipping insertion in model container [2019-11-28 20:31:01,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:31:01,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:01" (3/3) ... [2019-11-28 20:31:01,635 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2019-11-28 20:31:01,679 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:31:01,679 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:31:01,679 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:31:01,680 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:31:01,680 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:31:01,680 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:31:01,680 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:31:01,680 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:31:01,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 20:31:01,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:01,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:01,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:01,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:01,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:01,718 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:31:01,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-28 20:31:01,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:01,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:01,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:01,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:01,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:01,726 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2019-11-28 20:31:01,726 INFO L796 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2019-11-28 20:31:01,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:31:01,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:01,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456921804] [2019-11-28 20:31:01,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-28 20:31:01,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:01,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379608681] [2019-11-28 20:31:01,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,853 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-28 20:31:01,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:01,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599032036] [2019-11-28 20:31:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:01,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:01,980 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:01,981 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:01,981 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:01,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:01,982 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:01,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:01,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:01,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:01,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-28 20:31:01,983 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:01,983 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:02,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,172 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:02,173 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) [2019-11-28 20:31:02,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:02,189 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 [2019-11-28 20:31:02,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:02,201 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:02,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:02,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:02,216 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2019-11-28 20:31:02,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:02,227 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2019-11-28 20:31:02,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:02,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:02,259 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:02,262 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:02,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:02,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:02,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:02,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:02,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:02,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:02,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-28 20:31:02,264 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:02,264 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:02,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,369 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:02,374 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 20:31:02,393 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 [2019-11-28 20:31:02,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:02,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:02,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:02,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:02,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:02,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:02,411 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 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,428 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 [2019-11-28 20:31:02,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:02,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:02,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:02,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:02,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:02,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:02,443 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:02,460 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 [2019-11-28 20:31:02,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:02,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:02,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:02,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:02,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:02,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:02,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:02,477 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:31:02,477 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2019-11-28 20:31:02,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:02,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:02,493 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:02,494 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 20:31:02,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:02,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:02,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:02,567 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:02,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:02,586 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 [2019-11-28 20:31:02,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-28 20:31:02,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-11-28 20:31:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 20:31:02,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 20:31:02,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:02,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 20:31:02,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:02,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 20:31:02,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:02,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-28 20:31:02,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:02,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-28 20:31:02,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 20:31:02,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-28 20:31:02,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-28 20:31:02,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:02,649 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 20:31:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-28 20:31:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-28 20:31:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 20:31:02,677 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 20:31:02,677 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 20:31:02,677 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:31:02,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-28 20:31:02,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:02,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:02,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:02,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 20:31:02,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:02,679 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2019-11-28 20:31:02,680 INFO L796 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2019-11-28 20:31:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 20:31:02,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:02,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540512978] [2019-11-28 20:31:02,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-28 20:31:02,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:02,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65377358] [2019-11-28 20:31:02,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-28 20:31:02,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:02,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722774272] [2019-11-28 20:31:02,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:02,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:02,767 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:02,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:02,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:02,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:02,767 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:02,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,768 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:02,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:02,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-28 20:31:02,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:02,769 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:02,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:02,853 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2019-11-28 20:31:02,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:02,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:02,868 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:02,868 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:02,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:02,884 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:02,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:02,907 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:02,910 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:02,910 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:02,910 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:02,910 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:02,910 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:02,911 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:02,911 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:02,911 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:02,911 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-28 20:31:02,911 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:02,911 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:02,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,013 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:03,013 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,026 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 [2019-11-28 20:31:03,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:03,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:03,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:03,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:03,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:03,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:03,037 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 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 [2019-11-28 20:31:03,059 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 [2019-11-28 20:31:03,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:03,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:03,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:03,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:03,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:03,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:03,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:03,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:03,090 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:03,090 INFO L444 ModelExtractionUtils]: 0 out of 3 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:03,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:03,105 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:03,105 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 20:31:03,109 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,174 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:03,191 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 [2019-11-28 20:31:03,192 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 20:31:03,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-11-28 20:31:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 20:31:03,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 20:31:03,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 20:31:03,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 20:31:03,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-28 20:31:03,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:03,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 20:31:03,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 20:31:03,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:31:03,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-28 20:31:03,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:03,220 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 20:31:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-28 20:31:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-28 20:31:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-28 20:31:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-28 20:31:03,225 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 20:31:03,226 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-28 20:31:03,226 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:31:03,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-28 20:31:03,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 20:31:03,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:03,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:03,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 20:31:03,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:03,229 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2019-11-28 20:31:03,229 INFO L796 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2019-11-28 20:31:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-28 20:31:03,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268560928] [2019-11-28 20:31:03,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-28 20:31:03,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673024834] [2019-11-28 20:31:03,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-28 20:31:03,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980141605] [2019-11-28 20:31:03,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,313 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:03,313 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:03,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:03,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:03,314 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:03,314 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,314 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:03,314 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:03,314 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-28 20:31:03,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:03,315 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:03,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:03,406 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2019-11-28 20:31:03,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:03,421 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 [2019-11-28 20:31:03,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:03,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:03,438 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:03,440 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:03,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:03,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:03,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:03,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:03,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:03,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:03,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-28 20:31:03,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:03,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:03,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,533 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:03,534 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:31:03,539 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 [2019-11-28 20:31:03,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:03,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:03,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:03,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:03,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:03,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:03,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:03,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:03,551 INFO L444 ModelExtractionUtils]: 0 out of 3 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:03,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:03,557 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:03,557 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 20:31:03,559 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,594 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:03,595 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 [2019-11-28 20:31:03,595 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:31:03,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-28 20:31:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 20:31:03,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 20:31:03,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,607 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,643 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:03,644 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 [2019-11-28 20:31:03,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:31:03,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-28 20:31:03,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-28 20:31:03,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 20:31:03,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,655 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:03,686 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:03,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:03,687 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 [2019-11-28 20:31:03,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:31:03,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-11-28 20:31:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 20:31:03,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 20:31:03,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 20:31:03,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-28 20:31:03,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:03,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-28 20:31:03,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:31:03,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-28 20:31:03,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 20:31:03,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:31:03,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-28 20:31:03,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:03,702 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 20:31:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-28 20:31:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-28 20:31:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-28 20:31:03,703 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 20:31:03,703 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-28 20:31:03,703 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:31:03,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-28 20:31:03,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:31:03,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:03,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:03,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:31:03,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:03,704 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2019-11-28 20:31:03,705 INFO L796 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2019-11-28 20:31:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-28 20:31:03,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457280565] [2019-11-28 20:31:03,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-28 20:31:03,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298697864] [2019-11-28 20:31:03,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-28 20:31:03,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:03,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879972776] [2019-11-28 20:31:03,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:03,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:03,754 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:03,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:03,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:03,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:03,754 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:03,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:03,755 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:03,755 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-28 20:31:03,755 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:03,755 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:03,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:03,843 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:03,843 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,850 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:03,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:03,857 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:03,857 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:03,868 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:03,902 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,916 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:03,916 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [0, 1, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:03,936 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:03,941 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:03,941 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:03,952 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:03,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:03,994 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,010 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:04,012 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:04,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:04,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:04,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:04,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:04,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:04,013 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:04,013 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-28 20:31:04,013 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:04,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:04,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,102 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:04,102 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,110 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 [2019-11-28 20:31:04,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:04,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:04,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,122 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,134 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 [2019-11-28 20:31:04,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:04,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,152 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,160 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 [2019-11-28 20:31:04,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:04,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,171 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,179 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 [2019-11-28 20:31:04,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:04,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:04,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:04,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:04,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:04,191 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,197 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:04,197 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:04,198 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:04,198 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-28 20:31:04,209 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,238 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:04,240 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 [2019-11-28 20:31:04,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-28 20:31:04,250 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-11-28 20:31:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-28 20:31:04,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-28 20:31:04,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 20:31:04,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-28 20:31:04,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-28 20:31:04,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:31:04,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-28 20:31:04,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-28 20:31:04,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-28 20:31:04,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-28 20:31:04,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:04,259 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-28 20:31:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-28 20:31:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-28 20:31:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:31:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-28 20:31:04,261 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 20:31:04,261 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-28 20:31:04,261 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:31:04,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-28 20:31:04,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 20:31:04,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:04,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:04,265 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-28 20:31:04,265 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 20:31:04,265 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-28 20:31:04,266 INFO L796 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-28 20:31:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-28 20:31:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693518928] [2019-11-28 20:31:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:04,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693518928] [2019-11-28 20:31:04,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:04,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:31:04,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037903159] [2019-11-28 20:31:04,334 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:31:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-28 20:31:04,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:04,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898436039] [2019-11-28 20:31:04,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:04,381 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:04,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:04,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:04,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:04,382 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:04,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:04,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:04,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-28 20:31:04,383 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:04,383 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:04,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:04,455 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:04,460 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:04,472 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,492 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:04,493 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 15, 7] Nus: [1, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:04,499 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:04,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:04,518 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:04,520 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:04,520 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:04,521 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:04,521 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:04,521 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:04,521 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,521 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:04,521 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:04,521 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-28 20:31:04,521 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:04,521 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:04,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:04,601 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:04,601 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,608 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 [2019-11-28 20:31:04,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:04,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:04,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,615 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,623 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 [2019-11-28 20:31:04,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:04,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,633 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,639 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 [2019-11-28 20:31:04,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:04,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:04,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:04,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:04,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:04,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:04,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:04,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:04,649 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:04,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:04,654 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:04,654 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:04,654 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-28 20:31:04,656 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,694 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,701 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:04,732 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 [2019-11-28 20:31:04,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:31:04,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-11-28 20:31:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:31:04,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 20:31:04,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,743 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,771 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:04,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:31:04,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:31:04,813 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-28 20:31:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:04,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 20:31:04,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,815 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,837 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:04,842 WARN L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:31:04,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:04,858 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 2 loop predicates [2019-11-28 20:31:04,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 20:31:04,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-11-28 20:31:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:31:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 20:31:04,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 20:31:04,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-28 20:31:04,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-28 20:31:04,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:04,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-28 20:31:04,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:31:04,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-28 20:31:04,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:31:04,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 20:31:04,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 20:31:04,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:04,877 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 20:31:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 20:31:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-28 20:31:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-28 20:31:04,879 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-28 20:31:04,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:31:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:31:04,884 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-28 20:31:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:04,912 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-28 20:31:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:31:04,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-28 20:31:04,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:31:04,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-28 20:31:04,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:31:04,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 20:31:04,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-28 20:31:04,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:04,917 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-28 20:31:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-28 20:31:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-28 20:31:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-28 20:31:04,919 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 20:31:04,919 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-28 20:31:04,919 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:31:04,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-28 20:31:04,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:31:04,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:04,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:04,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-28 20:31:04,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-28 20:31:04,921 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-28 20:31:04,921 INFO L796 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-28 20:31:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-28 20:31:04,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:04,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664120668] [2019-11-28 20:31:04,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-28 20:31:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:04,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985481641] [2019-11-28 20:31:04,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-28 20:31:04,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:04,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320677407] [2019-11-28 20:31:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:04,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:05,020 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:05,020 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:05,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:05,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:05,020 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:05,021 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,021 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:05,021 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:05,021 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-28 20:31:05,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:05,022 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:05,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,097 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:05,097 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:05,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,110 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:05,115 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:05,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,122 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,126 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:05,127 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,137 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:05,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:05,150 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:05,152 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:05,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:05,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:05,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:05,152 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:05,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:05,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:05,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-28 20:31:05,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:05,153 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:05,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,221 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:05,221 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:05,232 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 [2019-11-28 20:31:05,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:05,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:05,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:05,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:05,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:05,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:05,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:05,241 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:05,241 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:05,246 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:05,246 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:05,246 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:05,246 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2019-11-28 20:31:05,249 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:05,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:05,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 20:31:05,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-11-28 20:31:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-28 20:31:05,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:31:05,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,332 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:05,385 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:05,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 20:31:05,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-11-28 20:31:05,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:05,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:31:05,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,405 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:05,459 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 3 loop predicates [2019-11-28 20:31:05,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 20:31:05,469 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-11-28 20:31:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-28 20:31:05,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:31:05,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,471 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,494 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,495 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:05,527 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:05,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 20:31:05,546 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-11-28 20:31:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 20:31:05,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:31:05,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,549 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:05,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:05,606 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-28 20:31:05,682 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-11-28 20:31:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:31:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-28 20:31:05,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-28 20:31:05,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-28 20:31:05,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-28 20:31:05,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:05,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-28 20:31:05,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-28 20:31:05,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-28 20:31:05,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 20:31:05,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 20:31:05,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-28 20:31:05,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:05,695 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-28 20:31:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-28 20:31:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-28 20:31:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:31:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-28 20:31:05,700 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 20:31:05,700 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-28 20:31:05,700 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:31:05,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-28 20:31:05,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:05,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:05,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:05,702 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-28 20:31:05,702 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 20:31:05,702 INFO L794 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-28 20:31:05,703 INFO L796 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-28 20:31:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-28 20:31:05,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:05,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279000557] [2019-11-28 20:31:05,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:31:05,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279000557] [2019-11-28 20:31:05,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444964859] [2019-11-28 20:31:05,731 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:31:05,762 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-28 20:31:05,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:31:05,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:31:05,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:31:05,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:31:05,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-28 20:31:05,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570887166] [2019-11-28 20:31:05,768 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:31:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-28 20:31:05,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:05,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636522603] [2019-11-28 20:31:05,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:05,799 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:05,857 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:05,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:05,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:05,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:05,857 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:05,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,857 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:05,857 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:05,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-28 20:31:05,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:05,858 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:05,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:05,928 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:05,929 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:05,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:05,938 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:05,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:05,949 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:05,954 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:05,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:05,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:06,004 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:06,006 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:06,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:06,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:06,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:06,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:06,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:06,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:06,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-28 20:31:06,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:06,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:06,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,140 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:06,141 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,146 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 [2019-11-28 20:31:06,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:06,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:06,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:06,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:06,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:06,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:06,154 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,160 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 [2019-11-28 20:31:06,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:06,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:06,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:06,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:06,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:06,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:06,172 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:06,179 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 [2019-11-28 20:31:06,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:06,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:06,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:06,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:06,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:06,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:06,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:06,188 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 20:31:06,189 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:06,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:06,194 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:06,195 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 20:31:06,197 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:06,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:06,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:31:06,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:31:06,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-28 20:31:06,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2019-11-28 20:31:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-28 20:31:06,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-28 20:31:06,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:06,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:31:06,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:06,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-28 20:31:06,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:06,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-11-28 20:31:06,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:06,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-11-28 20:31:06,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:31:06,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 20:31:06,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-11-28 20:31:06,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:06,295 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-28 20:31:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-11-28 20:31:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-28 20:31:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:31:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-11-28 20:31:06,301 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-11-28 20:31:06,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:06,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:31:06,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:31:06,302 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-11-28 20:31:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:06,319 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-28 20:31:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:31:06,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-28 20:31:06,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:06,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-11-28 20:31:06,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-28 20:31:06,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-28 20:31:06,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-28 20:31:06,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:06,322 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-28 20:31:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-28 20:31:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-28 20:31:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 20:31:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-28 20:31:06,325 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 20:31:06,326 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 20:31:06,326 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:31:06,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-28 20:31:06,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:31:06,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:06,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:06,328 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-28 20:31:06,328 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-28 20:31:06,328 INFO L794 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-28 20:31:06,328 INFO L796 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-28 20:31:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-28 20:31:06,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:06,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772965857] [2019-11-28 20:31:06,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:06,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-28 20:31:06,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724976613] [2019-11-28 20:31:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:06,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-28 20:31:06,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:06,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505798144] [2019-11-28 20:31:06,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:06,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505798144] [2019-11-28 20:31:06,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340282659] [2019-11-28 20:31:06,467 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:31:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:31:06,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:31:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:31:06,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-28 20:31:06,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698403945] [2019-11-28 20:31:06,626 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:06,626 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:06,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:06,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:06,627 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:06,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:06,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:06,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-28 20:31:06,628 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:06,628 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:06,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,734 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:06,734 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:06,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:06,745 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:06,745 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:06,750 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:06,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:06,820 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:06,822 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:06,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:06,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:06,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:06,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:06,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:06,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:06,823 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-28 20:31:06,823 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:06,823 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:06,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:06,899 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:06,900 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,912 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 [2019-11-28 20:31:06,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:06,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:06,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:06,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:06,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:06,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:06,920 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:06,934 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 [2019-11-28 20:31:06,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:06,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:06,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:06,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:06,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:06,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:06,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:06,941 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:06,941 INFO L444 ModelExtractionUtils]: 0 out of 3 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:06,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:06,945 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:06,945 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:06,945 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 20:31:06,947 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:06,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:06,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:06,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:06,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:06,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:31:06,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:31:07,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-28 20:31:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 20:31:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:31:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,024 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,047 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:07,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-28 20:31:07,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:31:07,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-28 20:31:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-28 20:31:07,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:31:07,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,102 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:07,154 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 4 loop predicates [2019-11-28 20:31:07,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 20:31:07,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-11-28 20:31:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:31:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 20:31:07,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:31:07,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 20:31:07,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 20:31:07,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-28 20:31:07,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-28 20:31:07,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-28 20:31:07,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:31:07,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-28 20:31:07,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-28 20:31:07,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:07,191 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-28 20:31:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-28 20:31:07,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-28 20:31:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:31:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 20:31:07,196 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 20:31:07,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:31:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:31:07,197 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-28 20:31:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:07,376 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-28 20:31:07,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:31:07,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-28 20:31:07,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-28 20:31:07,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-28 20:31:07,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-28 20:31:07,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-28 20:31:07,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-28 20:31:07,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:07,383 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-28 20:31:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-28 20:31:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-28 20:31:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:31:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-28 20:31:07,388 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 20:31:07,388 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-28 20:31:07,388 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:31:07,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-28 20:31:07,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-28 20:31:07,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:07,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:07,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 20:31:07,389 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-28 20:31:07,390 INFO L794 eck$LassoCheckResult]: Stem: 1722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1724#L12-2 assume !!(main_~c~0 > 0); 1738#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1735#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-28 20:31:07,390 INFO L796 eck$LassoCheckResult]: Loop: 1718#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1728#L12-2 assume !!(main_~c~0 > 0); 1734#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1733#L12-2 assume !!(main_~c~0 > 0); 1725#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1726#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-28 20:31:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-28 20:31:07,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:07,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125526284] [2019-11-28 20:31:07,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-28 20:31:07,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:07,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960955880] [2019-11-28 20:31:07,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:31:07,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960955880] [2019-11-28 20:31:07,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:31:07,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:31:07,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208962677] [2019-11-28 20:31:07,426 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:31:07,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:31:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:31:07,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:31:07,427 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-28 20:31:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:31:07,436 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-28 20:31:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:31:07,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-28 20:31:07,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:31:07,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-28 20:31:07,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:31:07,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:31:07,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-28 20:31:07,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:07,440 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-28 20:31:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-28 20:31:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-28 20:31:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:31:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-28 20:31:07,444 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 20:31:07,444 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-28 20:31:07,444 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:31:07,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-28 20:31:07,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-28 20:31:07,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:07,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:07,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 20:31:07,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-28 20:31:07,446 INFO L794 eck$LassoCheckResult]: Stem: 1813#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1815#L12-2 assume !!(main_~c~0 > 0); 1829#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1828#L12-2 assume !!(main_~c~0 > 0); 1821#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-28 20:31:07,446 INFO L796 eck$LassoCheckResult]: Loop: 1809#L12-2 assume !!(main_~c~0 > 0); 1810#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1819#L12-2 assume !!(main_~c~0 > 0); 1826#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1823#L12-2 assume !!(main_~c~0 > 0); 1816#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1817#L12-2 assume !!(main_~c~0 > 0); 1827#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1824#L12-2 assume !!(main_~c~0 > 0); 1820#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-28 20:31:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-28 20:31:07,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:07,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003205513] [2019-11-28 20:31:07,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-28 20:31:07,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:07,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938544024] [2019-11-28 20:31:07,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:07,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-28 20:31:07,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:07,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388498128] [2019-11-28 20:31:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:07,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:07,563 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:07,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:07,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:07,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:07,564 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:07,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:07,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:07,565 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-28 20:31:07,565 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:07,565 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:07,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,632 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:07,632 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:07,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:07,643 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:31:07,647 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:07,654 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:07,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:07,678 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:07,680 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:07,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:07,681 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:07,681 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:07,681 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:07,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:07,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:07,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-28 20:31:07,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:07,681 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:07,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:07,740 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:07,740 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:07,752 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 [2019-11-28 20:31:07,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:07,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:07,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:07,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:31:07,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:31:07,761 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:07,772 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 [2019-11-28 20:31:07,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:07,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:07,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:07,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:07,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:07,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:07,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:07,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:07,783 INFO L444 ModelExtractionUtils]: 0 out of 3 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 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:07,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:07,786 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:07,787 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:07,787 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 20:31:07,788 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:07,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 20:31:07,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 20:31:07,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-28 20:31:07,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:07,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:31:07,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,868 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:07,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 20:31:07,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 20:31:07,935 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-28 20:31:07,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:07,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:31:07,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:07,937 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:07,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:07,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,003 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 5 loop predicates [2019-11-28 20:31:08,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 20:31:08,013 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-11-28 20:31:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 20:31:08,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:31:08,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,014 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,076 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 20:31:08,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 20:31:08,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-11-28 20:31:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 20:31:08,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:31:08,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,125 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,148 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,192 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-28 20:31:08,193 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 20:31:08,239 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,274 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,275 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,276 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,277 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:08,287 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-11-28 20:31:08,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 20:31:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-28 20:31:08,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-28 20:31:08,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-28 20:31:08,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-28 20:31:08,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-28 20:31:08,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-28 20:31:08,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-28 20:31:08,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-28 20:31:08,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-28 20:31:08,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-28 20:31:08,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:08,301 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-28 20:31:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-28 20:31:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-28 20:31:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:31:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-28 20:31:08,308 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 20:31:08,308 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-28 20:31:08,308 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:31:08,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-28 20:31:08,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-28 20:31:08,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:08,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:08,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 20:31:08,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-28 20:31:08,310 INFO L794 eck$LassoCheckResult]: Stem: 2806#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2809#L12-2 assume !!(main_~c~0 > 0); 2833#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2829#L12-2 assume !!(main_~c~0 > 0); 2815#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-28 20:31:08,311 INFO L796 eck$LassoCheckResult]: Loop: 2802#L12-2 assume !!(main_~c~0 > 0); 2803#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2864#L12-2 assume !!(main_~c~0 > 0); 2857#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2855#L12-2 assume !!(main_~c~0 > 0); 2849#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2848#L12-2 assume !!(main_~c~0 > 0); 2847#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2839#L12-2 assume !!(main_~c~0 > 0); 2818#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2830#L12-2 assume !!(main_~c~0 > 0); 2828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2826#L12-2 assume !!(main_~c~0 > 0); 2814#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-28 20:31:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-28 20:31:08,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:08,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109928435] [2019-11-28 20:31:08,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-28 20:31:08,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:08,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611677893] [2019-11-28 20:31:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-28 20:31:08,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:08,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194527010] [2019-11-28 20:31:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:08,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:08,465 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-28 20:31:08,481 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:08,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:08,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:08,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:08,482 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:08,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:08,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:08,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-28 20:31:08,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:08,483 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:08,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:08,553 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,557 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:08,557 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:08,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:08,570 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:08,571 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:08,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:08,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:08,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:08,572 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:08,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:08,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:08,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-28 20:31:08,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:08,572 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:08,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:08,659 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:08,659 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,663 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 [2019-11-28 20:31:08,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:08,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:08,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:08,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:08,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:08,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:08,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:08,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:08,671 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:08,672 INFO L444 ModelExtractionUtils]: 0 out of 3 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:08,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:31:08,676 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:08,676 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:08,676 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-28 20:31:08,677 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,768 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:31:08,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 20:31:08,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-28 20:31:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:31:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:08,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 20:31:08,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,776 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:31:08,876 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 20:31:08,883 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-28 20:31:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:31:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:08,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 20:31:08,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:08,887 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:08,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:31:08,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:08,984 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 7 loop predicates [2019-11-28 20:31:08,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 20:31:09,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-11-28 20:31:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:31:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-28 20:31:09,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 20:31:09,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:09,004 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:09,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:09,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:09,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:31:09,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:09,111 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:31:09,112 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 20:31:09,154 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-11-28 20:31:09,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:31:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 20:31:09,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 20:31:09,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:09,156 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:09,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:09,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:09,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:31:09,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:31:09,272 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-28 20:31:09,272 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-28 20:31:09,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,334 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,336 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,337 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,337 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,338 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,338 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,340 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,341 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,341 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,341 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,409 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,410 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,411 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,413 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,414 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,415 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,416 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,417 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,417 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,417 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,420 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,421 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,422 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,470 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,471 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,471 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,471 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,472 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,472 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,475 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,476 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,476 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,476 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-28 20:31:09,535 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-11-28 20:31:09,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:31:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-28 20:31:09,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 20:31:09,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:09,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-28 20:31:09,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:09,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-28 20:31:09,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:09,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-28 20:31:09,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-28 20:31:09,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-28 20:31:09,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-28 20:31:09,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:31:09,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-28 20:31:09,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:31:09,574 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-28 20:31:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-28 20:31:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-28 20:31:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-28 20:31:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-28 20:31:09,614 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 20:31:09,614 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-28 20:31:09,614 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:31:09,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-28 20:31:09,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 20:31:09,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:31:09,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:31:09,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-28 20:31:09,618 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-28 20:31:09,618 INFO L794 eck$LassoCheckResult]: Stem: 5719#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5724#L12-2 assume !!(main_~c~0 > 0); 5765#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5737#L12-2 assume !!(main_~c~0 > 0); 5733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-28 20:31:09,618 INFO L796 eck$LassoCheckResult]: Loop: 5715#L12-2 assume !!(main_~c~0 > 0); 5716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5934#L12-2 assume !!(main_~c~0 > 0); 5861#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5859#L12-2 assume !!(main_~c~0 > 0); 5857#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5855#L12-2 assume !!(main_~c~0 > 0); 5852#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5841#L12-2 assume !!(main_~c~0 > 0); 5842#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5824#L12-2 assume !!(main_~c~0 > 0); 5825#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5816#L12-2 assume !!(main_~c~0 > 0); 5736#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5759#L12-2 assume !!(main_~c~0 > 0); 5738#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5735#L12-2 assume !!(main_~c~0 > 0); 5732#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-28 20:31:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-28 20:31:09,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693665952] [2019-11-28 20:31:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-28 20:31:09,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192506339] [2019-11-28 20:31:09,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-28 20:31:09,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:31:09,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661605090] [2019-11-28 20:31:09,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:31:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:31:09,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:31:09,834 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-28 20:31:09,848 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:09,849 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:09,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:09,849 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:09,849 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:31:09,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:09,850 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:09,850 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-28 20:31:09,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:09,850 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:09,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,915 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:09,915 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:31:09,922 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:31:09,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:31:09,974 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:31:09,975 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:31:09,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:31:09,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:31:09,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:31:09,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:31:09,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:09,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:31:09,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:31:09,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-28 20:31:09,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:31:09,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:31:09,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:09,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:31:10,047 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:31:10,047 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,052 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 [2019-11-28 20:31:10,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:31:10,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:31:10,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:31:10,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:31:10,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:31:10,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:31:10,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:31:10,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:31:10,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:31:10,060 INFO L444 ModelExtractionUtils]: 0 out of 3 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:31:10,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:31:10,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:31:10,064 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:31:10,064 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-28 20:31:10,065 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:31:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:31:10,153 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:31:10,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 20:31:10,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-28 20:31:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:31:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:10,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 20:31:10,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,168 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:31:10,244 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:31:10,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 20:31:10,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-28 20:31:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:31:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-28 20:31:10,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 20:31:10,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,264 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:31:10,340 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 6 loop predicates [2019-11-28 20:31:10,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 20:31:10,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2019-11-28 20:31:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:31:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-28 20:31:10,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 20:31:10,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,362 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:31:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:31:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:31:10,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:31:10,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:31:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 20:31:10,460 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 20:31:10,461 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-28 20:31:10,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2019-11-28 20:31:10,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-28 20:31:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-28 20:31:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-28 20:31:10,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-28 20:31:10,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-28 20:31:10,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-28 20:31:10,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:31:10,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-11-28 20:31:10,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:31:10,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-11-28 20:31:10,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:31:10,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:31:10,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:31:10,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:31:10,533 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:31:10,533 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:31:10,534 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:31:10,534 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 20:31:10,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:31:10,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:31:10,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:31:10,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:31:10 BoogieIcfgContainer [2019-11-28 20:31:10,546 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:31:10,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:31:10,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:31:10,549 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:31:10,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:31:01" (3/4) ... [2019-11-28 20:31:10,555 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:31:10,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:31:10,558 INFO L168 Benchmark]: Toolchain (without parser) took 9550.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -199.7 MB). Peak memory consumption was 132.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:10,558 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:10,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:10,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:10,567 INFO L168 Benchmark]: Boogie Preprocessor took 16.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:10,567 INFO L168 Benchmark]: RCFGBuilder took 204.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:10,568 INFO L168 Benchmark]: BuchiAutomizer took 8919.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.2 MB). Peak memory consumption was 149.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:31:10,568 INFO L168 Benchmark]: Witness Printer took 7.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:31:10,574 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.54 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 94.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 204.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8919.98 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.2 MB). Peak memory consumption was 149.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.25 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.0s. Construction of modules took 0.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 393 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 154 SDtfs, 161 SDslu, 64 SDs, 0 SdLazy, 353 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp96 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 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...