./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 2559ce56d5bdfaeec5255956226223494fe099f5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:57:41,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:57:41,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:57:41,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:57:41,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:57:41,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:57:41,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:57:41,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:57:41,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:57:41,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:57:41,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:57:41,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:57:41,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:57:41,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:57:41,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:57:41,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:57:41,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:57:41,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:57:41,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:57:41,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:57:41,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:57:41,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:57:41,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:57:41,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:57:41,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:57:41,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:57:41,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:57:41,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:57:41,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:57:41,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:57:41,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:57:41,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:57:41,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:57:41,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:57:41,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:57:41,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:57:41,696 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:57:41,713 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:57:41,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:57:41,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:57:41,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:57:41,715 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:57:41,715 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:57:41,715 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:57:41,716 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:57:41,716 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:57:41,716 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:57:41,716 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:57:41,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:57:41,717 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:57:41,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:57:41,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:57:41,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:57:41,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:57:41,718 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:57:41,719 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:57:41,719 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:57:41,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:57:41,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:57:41,719 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:57:41,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:57:41,720 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:57:41,720 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:57:41,721 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:57:41,721 INFO L133 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2019-01-01 23:57:41,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:57:41,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:57:41,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:57:41,788 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:57:41,789 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:57:41,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2019-01-01 23:57:41,854 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d0a8348/7d628541e6674e88a9949f608e98862b/FLAG1fca54a27 [2019-01-01 23:57:42,375 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:57:42,376 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2019-01-01 23:57:42,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d0a8348/7d628541e6674e88a9949f608e98862b/FLAG1fca54a27 [2019-01-01 23:57:42,702 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89d0a8348/7d628541e6674e88a9949f608e98862b [2019-01-01 23:57:42,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:57:42,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:57:42,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:57:42,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:57:42,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:57:42,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:57:42" (1/1) ... [2019-01-01 23:57:42,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf28d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:42, skipping insertion in model container [2019-01-01 23:57:42,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:57:42" (1/1) ... [2019-01-01 23:57:42,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:57:42,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:57:43,024 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:57:43,030 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:57:43,077 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:57:43,113 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:57:43,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43 WrapperNode [2019-01-01 23:57:43,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:57:43,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:57:43,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:57:43,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:57:43,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:57:43,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:57:43,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:57:43,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:57:43,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (1/1) ... [2019-01-01 23:57:43,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:57:43,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:57:43,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:57:43,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:57:43,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (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-01-01 23:57:43,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:57:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:57:44,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:57:44,663 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2019-01-01 23:57:44,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:57:44 BoogieIcfgContainer [2019-01-01 23:57:44,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:57:44,664 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:57:44,664 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:57:44,669 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:57:44,670 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:44,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:57:42" (1/3) ... [2019-01-01 23:57:44,671 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a022786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:57:44, skipping insertion in model container [2019-01-01 23:57:44,671 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:44,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:43" (2/3) ... [2019-01-01 23:57:44,672 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a022786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:57:44, skipping insertion in model container [2019-01-01 23:57:44,672 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:44,672 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:57:44" (3/3) ... [2019-01-01 23:57:44,674 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2019-01-01 23:57:44,735 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:57:44,736 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:57:44,736 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:57:44,736 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:57:44,737 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:57:44,737 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:57:44,737 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:57:44,737 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:57:44,738 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:57:44,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2019-01-01 23:57:44,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-01 23:57:44,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:44,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:44,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:44,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:44,806 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:57:44,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2019-01-01 23:57:44,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2019-01-01 23:57:44,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:44,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:44,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:44,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:44,831 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 15#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 115#L589true havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 79#L287true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 140#L294-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16#L299-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 51#L304-1true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 146#L107true assume !(1 == ~P_1_pc~0); 122#L107-2true is_P_1_triggered_~__retres1~0 := 0; 149#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 89#L119true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 167#L467true assume !(0 != activate_threads_~tmp~1); 172#L467-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3#L175true assume 1 == ~P_2_pc~0; 113#L176true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 4#L186true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 114#L187true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27#L475true assume !(0 != activate_threads_~tmp___0~1); 5#L475-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 72#L257true assume 1 == ~C_1_pc~0; 173#L258true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 131#L278true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 74#L279true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 33#L483true assume !(0 != activate_threads_~tmp___1~1); 97#L537-1true [2019-01-01 23:57:44,832 INFO L796 eck$LassoCheckResult]: Loop: 97#L537-1true assume !false; 49#L538true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 76#L386true assume !true; 103#L402true start_simulation_~kernel_st~0 := 2; 62#L287-1true start_simulation_~kernel_st~0 := 3; 102#L413true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 112#L107-6true assume 1 == ~P_1_pc~0; 81#L108-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 124#L118-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 83#L119-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 156#L467-6true assume !(0 != activate_threads_~tmp~1); 162#L467-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 163#L175-6true assume !(1 == ~P_2_pc~0); 160#L175-8true is_P_2_triggered_~__retres1~1 := 0; 28#L186-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 138#L187-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11#L475-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 168#L475-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 34#L257-6true assume 1 == ~C_1_pc~0; 169#L258-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 101#L278-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 69#L279-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21#L483-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 29#L483-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 90#L317-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 57#L334-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 155#L335-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 117#L556true assume !(0 == start_simulation_~tmp~3); 120#L556-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 93#L317-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 60#L334-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 158#L335-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 14#L511true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 92#L518true stop_simulation_#res := stop_simulation_~__retres2~0; 24#L519true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 153#L569true assume !(0 != start_simulation_~tmp___0~2); 97#L537-1true [2019-01-01 23:57:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2019-01-01 23:57:44,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:44,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:44,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:44,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:44,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:45,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2019-01-01 23:57:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:45,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:45,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:57:45,021 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:45,044 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 3 states. [2019-01-01 23:57:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:45,103 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2019-01-01 23:57:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:45,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2019-01-01 23:57:45,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-01 23:57:45,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2019-01-01 23:57:45,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-01 23:57:45,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-01 23:57:45,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2019-01-01 23:57:45,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:45,128 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-01 23:57:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2019-01-01 23:57:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-01 23:57:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-01 23:57:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2019-01-01 23:57:45,177 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-01 23:57:45,177 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2019-01-01 23:57:45,177 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:57:45,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2019-01-01 23:57:45,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-01 23:57:45,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:45,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:45,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:45,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:45,184 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 387#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 388#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 481#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 482#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 393#L299-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 394#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 448#L107 assume !(1 == ~P_1_pc~0); 497#L107-2 is_P_1_triggered_~__retres1~0 := 0; 496#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 498#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 499#L467 assume !(0 != activate_threads_~tmp~1); 525#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 360#L175 assume 1 == ~P_2_pc~0; 361#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 363#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 364#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 412#L475 assume !(0 != activate_threads_~tmp___0~1); 365#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 366#L257 assume 1 == ~C_1_pc~0; 471#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 472#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 473#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 417#L483 assume !(0 != activate_threads_~tmp___1~1); 418#L537-1 [2019-01-01 23:57:45,187 INFO L796 eck$LassoCheckResult]: Loop: 418#L537-1 assume !false; 446#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 447#L386 assume !false; 475#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 494#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 372#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 450#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 435#L351 assume !(0 != eval_~tmp___2~0); 436#L402 start_simulation_~kernel_st~0 := 2; 457#L287-1 start_simulation_~kernel_st~0 := 3; 458#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 502#L107-6 assume 1 == ~P_1_pc~0; 484#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 485#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 487#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 488#L467-6 assume !(0 != activate_threads_~tmp~1); 523#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 524#L175-6 assume 1 == ~P_2_pc~0; 515#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 409#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 410#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 378#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 379#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 419#L257-6 assume 1 == ~C_1_pc~0; 421#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 467#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 468#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 399#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 400#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 411#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 376#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 453#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 504#L556 assume !(0 == start_simulation_~tmp~3); 474#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 500#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 381#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 454#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 383#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 384#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 403#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 404#L569 assume !(0 != start_simulation_~tmp___0~2); 418#L537-1 [2019-01-01 23:57:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2019-01-01 23:57:45,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:45,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:45,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:45,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:45,302 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2019-01-01 23:57:45,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:45,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:45,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:45,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:45,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:45,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:45,587 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:45,590 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2019-01-01 23:57:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:45,630 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2019-01-01 23:57:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:45,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2019-01-01 23:57:45,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-01 23:57:45,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2019-01-01 23:57:45,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2019-01-01 23:57:45,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-01 23:57:45,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2019-01-01 23:57:45,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:45,645 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-01 23:57:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2019-01-01 23:57:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-01 23:57:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-01 23:57:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2019-01-01 23:57:45,657 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-01 23:57:45,657 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2019-01-01 23:57:45,657 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:57:45,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2019-01-01 23:57:45,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2019-01-01 23:57:45,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:45,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:45,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:45,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:45,661 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 730#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 731#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 822#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 823#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 732#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 733#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 791#L107 assume !(1 == ~P_1_pc~0); 840#L107-2 is_P_1_triggered_~__retres1~0 := 0; 839#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 841#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 842#L467 assume !(0 != activate_threads_~tmp~1); 868#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 703#L175 assume 1 == ~P_2_pc~0; 704#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 706#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 707#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 752#L475 assume !(0 != activate_threads_~tmp___0~1); 708#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 709#L257 assume 1 == ~C_1_pc~0; 814#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 815#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 816#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 760#L483 assume !(0 != activate_threads_~tmp___1~1); 761#L537-1 [2019-01-01 23:57:45,662 INFO L796 eck$LassoCheckResult]: Loop: 761#L537-1 assume !false; 787#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 788#L386 assume !false; 818#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 835#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 715#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 793#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 777#L351 assume !(0 != eval_~tmp___2~0); 778#L402 start_simulation_~kernel_st~0 := 2; 800#L287-1 start_simulation_~kernel_st~0 := 3; 801#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 845#L107-6 assume 1 == ~P_1_pc~0; 826#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 827#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 830#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 831#L467-6 assume !(0 != activate_threads_~tmp~1); 866#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 867#L175-6 assume 1 == ~P_2_pc~0; 858#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 753#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 754#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 721#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 722#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 762#L257-6 assume 1 == ~C_1_pc~0; 764#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 810#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 811#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 742#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 743#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 755#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 719#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 796#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 847#L556 assume !(0 == start_simulation_~tmp~3); 817#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 843#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 726#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 799#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 728#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 729#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 748#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 749#L569 assume !(0 != start_simulation_~tmp___0~2); 761#L537-1 [2019-01-01 23:57:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2019-01-01 23:57:45,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:45,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:45,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2019-01-01 23:57:45,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:45,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:45,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:45,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:45,844 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:45,845 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 3 states. [2019-01-01 23:57:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:45,968 INFO L93 Difference]: Finished difference Result 301 states and 442 transitions. [2019-01-01 23:57:45,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:45,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 442 transitions. [2019-01-01 23:57:45,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2019-01-01 23:57:45,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 301 states and 442 transitions. [2019-01-01 23:57:45,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2019-01-01 23:57:45,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2019-01-01 23:57:45,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 442 transitions. [2019-01-01 23:57:45,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:45,985 INFO L705 BuchiCegarLoop]: Abstraction has 301 states and 442 transitions. [2019-01-01 23:57:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 442 transitions. [2019-01-01 23:57:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 286. [2019-01-01 23:57:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-01 23:57:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2019-01-01 23:57:46,004 INFO L728 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2019-01-01 23:57:46,004 INFO L608 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2019-01-01 23:57:46,005 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:57:46,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 421 transitions. [2019-01-01 23:57:46,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2019-01-01 23:57:46,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:46,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:46,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:46,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:46,014 INFO L794 eck$LassoCheckResult]: Stem: 1330#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1206#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1207#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1298#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1299#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1212#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1213#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1266#L107 assume !(1 == ~P_1_pc~0); 1316#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1317#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1318#L467 assume !(0 != activate_threads_~tmp~1); 1353#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1180#L175 assume !(1 == ~P_2_pc~0); 1181#L175-2 is_P_2_triggered_~__retres1~1 := 0; 1182#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1183#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1230#L475 assume !(0 != activate_threads_~tmp___0~1); 1184#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1185#L257 assume 1 == ~C_1_pc~0; 1290#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1291#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1292#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1235#L483 assume !(0 != activate_threads_~tmp___1~1); 1236#L537-1 [2019-01-01 23:57:46,014 INFO L796 eck$LassoCheckResult]: Loop: 1236#L537-1 assume !false; 1264#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1265#L386 assume !false; 1294#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1313#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1191#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1271#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1253#L351 assume !(0 != eval_~tmp___2~0); 1254#L402 start_simulation_~kernel_st~0 := 2; 1276#L287-1 start_simulation_~kernel_st~0 := 3; 1277#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1321#L107-6 assume 1 == ~P_1_pc~0; 1302#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1303#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1306#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1307#L467-6 assume !(0 != activate_threads_~tmp~1); 1348#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1352#L175-6 assume !(1 == ~P_2_pc~0); 1351#L175-8 is_P_2_triggered_~__retres1~1 := 0; 1228#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1229#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1197#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1198#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1237#L257-6 assume 1 == ~C_1_pc~0; 1239#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1286#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1287#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1218#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1219#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1227#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1195#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1272#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1324#L556 assume !(0 == start_simulation_~tmp~3); 1293#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1319#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1202#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1273#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1204#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1205#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 1220#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1221#L569 assume !(0 != start_simulation_~tmp___0~2); 1236#L537-1 [2019-01-01 23:57:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2019-01-01 23:57:46,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:46,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:46,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:46,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:46,081 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash 481737154, now seen corresponding path program 1 times [2019-01-01 23:57:46,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:46,144 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:46,145 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. cyclomatic complexity: 136 Second operand 3 states. [2019-01-01 23:57:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:46,601 INFO L93 Difference]: Finished difference Result 532 states and 764 transitions. [2019-01-01 23:57:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:46,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 764 transitions. [2019-01-01 23:57:46,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2019-01-01 23:57:46,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 764 transitions. [2019-01-01 23:57:46,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2019-01-01 23:57:46,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2019-01-01 23:57:46,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 764 transitions. [2019-01-01 23:57:46,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:46,622 INFO L705 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2019-01-01 23:57:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 764 transitions. [2019-01-01 23:57:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2019-01-01 23:57:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-01 23:57:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 744 transitions. [2019-01-01 23:57:46,655 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2019-01-01 23:57:46,655 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2019-01-01 23:57:46,658 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:57:46,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 744 transitions. [2019-01-01 23:57:46,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 490 [2019-01-01 23:57:46,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:46,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:46,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:46,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:46,667 INFO L794 eck$LassoCheckResult]: Stem: 2160#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2033#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2034#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2125#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2126#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2035#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2036#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2093#L107 assume !(1 == ~P_1_pc~0); 2143#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2142#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2144#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2145#L467 assume !(0 != activate_threads_~tmp~1); 2182#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2007#L175 assume !(1 == ~P_2_pc~0); 2008#L175-2 is_P_2_triggered_~__retres1~1 := 0; 2009#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2010#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2055#L475 assume !(0 != activate_threads_~tmp___0~1); 2011#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2012#L257 assume !(1 == ~C_1_pc~0); 2111#L257-2 assume !(2 == ~C_1_pc~0); 2112#L267-1 is_C_1_triggered_~__retres1~2 := 0; 2158#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2119#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2063#L483 assume !(0 != activate_threads_~tmp___1~1); 2064#L537-1 [2019-01-01 23:57:46,668 INFO L796 eck$LassoCheckResult]: Loop: 2064#L537-1 assume !false; 2380#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2376#L386 assume !false; 2375#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2373#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2371#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2369#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2366#L351 assume !(0 != eval_~tmp___2~0); 2367#L402 start_simulation_~kernel_st~0 := 2; 2463#L287-1 start_simulation_~kernel_st~0 := 3; 2462#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2461#L107-6 assume 1 == ~P_1_pc~0; 2459#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2457#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2454#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2452#L467-6 assume !(0 != activate_threads_~tmp~1); 2450#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2448#L175-6 assume !(1 == ~P_2_pc~0); 2446#L175-8 is_P_2_triggered_~__retres1~1 := 0; 2444#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2443#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2442#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2440#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2065#L257-6 assume !(1 == ~C_1_pc~0); 2066#L257-8 assume !(2 == ~C_1_pc~0); 2504#L267-5 is_C_1_triggered_~__retres1~2 := 0; 2503#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2502#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2501#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2499#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2493#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2491#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2490#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2489#L556 assume !(0 == start_simulation_~tmp~3); 2487#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2484#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2483#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2481#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2479#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2477#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 2474#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2472#L569 assume !(0 != start_simulation_~tmp___0~2); 2064#L537-1 [2019-01-01 23:57:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2019-01-01 23:57:46,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash 290270835, now seen corresponding path program 1 times [2019-01-01 23:57:46,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:46,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:46,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:46,837 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:46,838 INFO L87 Difference]: Start difference. First operand 516 states and 744 transitions. cyclomatic complexity: 229 Second operand 5 states. [2019-01-01 23:57:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:47,543 INFO L93 Difference]: Finished difference Result 908 states and 1298 transitions. [2019-01-01 23:57:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:57:47,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1298 transitions. [2019-01-01 23:57:47,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 882 [2019-01-01 23:57:47,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1298 transitions. [2019-01-01 23:57:47,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2019-01-01 23:57:47,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2019-01-01 23:57:47,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1298 transitions. [2019-01-01 23:57:47,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:47,566 INFO L705 BuchiCegarLoop]: Abstraction has 908 states and 1298 transitions. [2019-01-01 23:57:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1298 transitions. [2019-01-01 23:57:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 528. [2019-01-01 23:57:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-01 23:57:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 756 transitions. [2019-01-01 23:57:47,592 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2019-01-01 23:57:47,592 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2019-01-01 23:57:47,592 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:57:47,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 756 transitions. [2019-01-01 23:57:47,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 502 [2019-01-01 23:57:47,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:47,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:47,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:47,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:47,604 INFO L794 eck$LassoCheckResult]: Stem: 3609#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3473#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 3474#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3567#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3568#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 3475#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3476#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3532#L107 assume !(1 == ~P_1_pc~0); 3585#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3584#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3586#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3587#L467 assume !(0 != activate_threads_~tmp~1); 3635#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3447#L175 assume !(1 == ~P_2_pc~0); 3448#L175-2 is_P_2_triggered_~__retres1~1 := 0; 3449#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3450#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3495#L475 assume !(0 != activate_threads_~tmp___0~1); 3451#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3452#L257 assume !(1 == ~C_1_pc~0); 3550#L257-2 assume !(2 == ~C_1_pc~0); 3551#L267-1 is_C_1_triggered_~__retres1~2 := 0; 3607#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3561#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3505#L483 assume !(0 != activate_threads_~tmp___1~1); 3506#L537-1 [2019-01-01 23:57:47,606 INFO L796 eck$LassoCheckResult]: Loop: 3506#L537-1 assume !false; 3789#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3759#L386 assume !false; 3728#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3724#L317 assume !(0 == ~P_1_st~0); 3720#L321 assume !(0 == ~P_2_st~0); 3715#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 3708#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3704#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3702#L351 assume !(0 != eval_~tmp___2~0); 3701#L402 start_simulation_~kernel_st~0 := 2; 3700#L287-1 start_simulation_~kernel_st~0 := 3; 3699#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3698#L107-6 assume 1 == ~P_1_pc~0; 3696#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 3695#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3694#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3693#L467-6 assume !(0 != activate_threads_~tmp~1); 3692#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3690#L175-6 assume !(1 == ~P_2_pc~0); 3691#L175-8 is_P_2_triggered_~__retres1~1 := 0; 3664#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3665#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3655#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3656#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3507#L257-6 assume !(1 == ~C_1_pc~0); 3508#L257-8 assume !(2 == ~C_1_pc~0); 3531#L267-5 is_C_1_triggered_~__retres1~2 := 0; 3592#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3555#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3556#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3498#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3499#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3943#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3626#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3601#L556 assume !(0 == start_simulation_~tmp~3); 3562#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3589#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3469#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3542#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3471#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3472#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 3491#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3492#L569 assume !(0 != start_simulation_~tmp___0~2); 3506#L537-1 [2019-01-01 23:57:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2019-01-01 23:57:47,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:47,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:47,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:47,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:47,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -303364692, now seen corresponding path program 1 times [2019-01-01 23:57:47,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:47,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:47,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:47,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:47,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:47,718 INFO L87 Difference]: Start difference. First operand 528 states and 756 transitions. cyclomatic complexity: 229 Second operand 3 states. [2019-01-01 23:57:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:47,935 INFO L93 Difference]: Finished difference Result 922 states and 1296 transitions. [2019-01-01 23:57:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:47,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 922 states and 1296 transitions. [2019-01-01 23:57:47,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2019-01-01 23:57:47,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 922 states to 922 states and 1296 transitions. [2019-01-01 23:57:47,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2019-01-01 23:57:47,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2019-01-01 23:57:47,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 922 states and 1296 transitions. [2019-01-01 23:57:47,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:47,961 INFO L705 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-01 23:57:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states and 1296 transitions. [2019-01-01 23:57:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2019-01-01 23:57:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-01-01 23:57:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1296 transitions. [2019-01-01 23:57:47,982 INFO L728 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-01 23:57:47,982 INFO L608 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2019-01-01 23:57:47,982 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:57:47,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 1296 transitions. [2019-01-01 23:57:47,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2019-01-01 23:57:47,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:47,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:47,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:47,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:47,995 INFO L794 eck$LassoCheckResult]: Stem: 5061#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4929#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4930#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5024#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5025#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 4935#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4936#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4987#L107 assume !(1 == ~P_1_pc~0); 5040#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5039#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5041#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5042#L467 assume !(0 != activate_threads_~tmp~1); 5087#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4903#L175 assume !(1 == ~P_2_pc~0); 4904#L175-2 is_P_2_triggered_~__retres1~1 := 0; 4905#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4906#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4953#L475 assume !(0 != activate_threads_~tmp___0~1); 4907#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4908#L257 assume !(1 == ~C_1_pc~0); 5005#L257-2 assume !(2 == ~C_1_pc~0); 5006#L267-1 is_C_1_triggered_~__retres1~2 := 0; 5059#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5015#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4958#L483 assume !(0 != activate_threads_~tmp___1~1); 4959#L537-1 [2019-01-01 23:57:47,997 INFO L796 eck$LassoCheckResult]: Loop: 4959#L537-1 assume !false; 5308#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5306#L386 assume !false; 5304#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5300#L317 assume !(0 == ~P_1_st~0); 5301#L321 assume !(0 == ~P_2_st~0); 5625#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 5623#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5622#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5621#L351 assume !(0 != eval_~tmp___2~0); 5619#L402 start_simulation_~kernel_st~0 := 2; 5616#L287-1 start_simulation_~kernel_st~0 := 3; 5615#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5611#L107-6 assume 1 == ~P_1_pc~0; 5609#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 5372#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5371#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5368#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5366#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5363#L175-6 assume !(1 == ~P_2_pc~0); 5361#L175-8 is_P_2_triggered_~__retres1~1 := 0; 5359#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5357#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5355#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 5353#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5351#L257-6 assume !(1 == ~C_1_pc~0); 5349#L257-8 assume !(2 == ~C_1_pc~0); 5347#L267-5 is_C_1_triggered_~__retres1~2 := 0; 5345#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5343#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5341#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5339#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5336#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5334#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5330#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 5326#L556 assume !(0 == start_simulation_~tmp~3); 5324#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5318#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5316#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5315#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5314#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5313#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 5312#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 5311#L569 assume !(0 != start_simulation_~tmp___0~2); 4959#L537-1 [2019-01-01 23:57:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2019-01-01 23:57:47,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2068374570, now seen corresponding path program 1 times [2019-01-01 23:57:48,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:48,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:48,173 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:48,174 INFO L87 Difference]: Start difference. First operand 922 states and 1296 transitions. cyclomatic complexity: 375 Second operand 5 states. [2019-01-01 23:57:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:48,745 INFO L93 Difference]: Finished difference Result 2050 states and 2879 transitions. [2019-01-01 23:57:48,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:48,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2879 transitions. [2019-01-01 23:57:48,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2024 [2019-01-01 23:57:48,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2879 transitions. [2019-01-01 23:57:48,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2019-01-01 23:57:48,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2019-01-01 23:57:48,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2879 transitions. [2019-01-01 23:57:48,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:48,785 INFO L705 BuchiCegarLoop]: Abstraction has 2050 states and 2879 transitions. [2019-01-01 23:57:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2879 transitions. [2019-01-01 23:57:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 958. [2019-01-01 23:57:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-01-01 23:57:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1323 transitions. [2019-01-01 23:57:48,819 INFO L728 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2019-01-01 23:57:48,820 INFO L608 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2019-01-01 23:57:48,820 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:57:48,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1323 transitions. [2019-01-01 23:57:48,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 932 [2019-01-01 23:57:48,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:48,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:48,835 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:48,835 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:48,835 INFO L794 eck$LassoCheckResult]: Stem: 8058#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7915#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7916#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 8009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 8010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 7917#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 7918#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7973#L107 assume !(1 == ~P_1_pc~0); 8028#L107-2 is_P_1_triggered_~__retres1~0 := 0; 8027#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8030#L467 assume !(0 != activate_threads_~tmp~1); 8096#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7889#L175 assume !(1 == ~P_2_pc~0); 7890#L175-2 is_P_2_triggered_~__retres1~1 := 0; 7891#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7892#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7936#L475 assume !(0 != activate_threads_~tmp___0~1); 7893#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7894#L257 assume !(1 == ~C_1_pc~0); 7992#L257-2 assume !(2 == ~C_1_pc~0); 7993#L267-1 is_C_1_triggered_~__retres1~2 := 0; 8056#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8003#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7945#L483 assume !(0 != activate_threads_~tmp___1~1); 7946#L537-1 [2019-01-01 23:57:48,836 INFO L796 eck$LassoCheckResult]: Loop: 7946#L537-1 assume !false; 8392#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8389#L386 assume !false; 8388#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8387#L317 assume !(0 == ~P_1_st~0); 7899#L321 assume !(0 == ~P_2_st~0); 7901#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 7975#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 7976#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8815#L351 assume !(0 != eval_~tmp___2~0); 8038#L402 start_simulation_~kernel_st~0 := 2; 7985#L287-1 start_simulation_~kernel_st~0 := 3; 7986#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8037#L107-6 assume 1 == ~P_1_pc~0; 8149#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8150#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8287#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8082#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8084#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8275#L175-6 assume !(1 == ~P_2_pc~0); 8274#L175-8 is_P_2_triggered_~__retres1~1 := 0; 8273#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8272#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8271#L475-6 assume !(0 != activate_threads_~tmp___0~1); 8270#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8269#L257-6 assume !(1 == ~C_1_pc~0); 8268#L257-8 assume !(2 == ~C_1_pc~0); 8254#L267-5 is_C_1_triggered_~__retres1~2 := 0; 8255#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8244#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8245#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8236#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8237#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8409#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8407#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8404#L556 assume !(0 == start_simulation_~tmp~3); 8402#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8401#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8400#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8399#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8398#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8397#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 8396#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8395#L569 assume !(0 != start_simulation_~tmp___0~2); 7946#L537-1 [2019-01-01 23:57:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2019-01-01 23:57:48,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1803890900, now seen corresponding path program 1 times [2019-01-01 23:57:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:49,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:49,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:49,170 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:49,170 INFO L87 Difference]: Start difference. First operand 958 states and 1323 transitions. cyclomatic complexity: 366 Second operand 5 states. [2019-01-01 23:57:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:49,547 INFO L93 Difference]: Finished difference Result 2024 states and 2800 transitions. [2019-01-01 23:57:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:49,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2800 transitions. [2019-01-01 23:57:49,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1998 [2019-01-01 23:57:49,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2024 states and 2800 transitions. [2019-01-01 23:57:49,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2024 [2019-01-01 23:57:49,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2024 [2019-01-01 23:57:49,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2024 states and 2800 transitions. [2019-01-01 23:57:49,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:49,585 INFO L705 BuchiCegarLoop]: Abstraction has 2024 states and 2800 transitions. [2019-01-01 23:57:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states and 2800 transitions. [2019-01-01 23:57:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 988. [2019-01-01 23:57:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-01-01 23:57:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1342 transitions. [2019-01-01 23:57:49,617 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2019-01-01 23:57:49,617 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2019-01-01 23:57:49,617 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:57:49,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1342 transitions. [2019-01-01 23:57:49,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-01 23:57:49,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:49,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:49,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:49,626 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:49,626 INFO L794 eck$LassoCheckResult]: Stem: 11064#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 10912#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 10913#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 11011#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11012#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 10914#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 10915#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 10974#L107 assume !(1 == ~P_1_pc~0); 11029#L107-2 is_P_1_triggered_~__retres1~0 := 0; 11028#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11030#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11031#L467 assume !(0 != activate_threads_~tmp~1); 11102#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 10885#L175 assume !(1 == ~P_2_pc~0); 10886#L175-2 is_P_2_triggered_~__retres1~1 := 0; 10887#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 10888#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10933#L475 assume !(0 != activate_threads_~tmp___0~1); 10889#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10890#L257 assume !(1 == ~C_1_pc~0); 10993#L257-2 assume !(2 == ~C_1_pc~0); 10994#L267-1 is_C_1_triggered_~__retres1~2 := 0; 11061#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11005#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 10942#L483 assume !(0 != activate_threads_~tmp___1~1); 10943#L537-1 [2019-01-01 23:57:49,627 INFO L796 eck$LassoCheckResult]: Loop: 10943#L537-1 assume !false; 11780#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 11676#L386 assume !false; 11778#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11775#L317 assume !(0 == ~P_1_st~0); 10895#L321 assume !(0 == ~P_2_st~0); 10897#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11048#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11774#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11767#L351 assume !(0 != eval_~tmp___2~0); 11044#L402 start_simulation_~kernel_st~0 := 2; 10986#L287-1 start_simulation_~kernel_st~0 := 3; 10987#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11043#L107-6 assume 1 == ~P_1_pc~0; 11398#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 11397#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11396#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11395#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11394#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11393#L175-6 assume !(1 == ~P_2_pc~0); 11392#L175-8 is_P_2_triggered_~__retres1~1 := 0; 11391#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11390#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11389#L475-6 assume !(0 != activate_threads_~tmp___0~1); 11388#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10944#L257-6 assume !(1 == ~C_1_pc~0); 10945#L257-8 assume !(2 == ~C_1_pc~0); 11386#L267-5 is_C_1_triggered_~__retres1~2 := 0; 11384#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11382#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11380#L483-6 assume !(0 != activate_threads_~tmp___1~1); 11378#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11374#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11375#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11370#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11371#L556 assume !(0 == start_simulation_~tmp~3); 11789#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11787#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11786#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11785#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11784#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11783#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 11782#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11781#L569 assume !(0 != start_simulation_~tmp___0~2); 10943#L537-1 [2019-01-01 23:57:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2019-01-01 23:57:49,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1479959146, now seen corresponding path program 1 times [2019-01-01 23:57:49,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:49,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1057551404, now seen corresponding path program 1 times [2019-01-01 23:57:49,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:49,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:49,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:49,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:50,197 WARN L181 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-01-01 23:57:50,319 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:57:50,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:57:50,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:57:50,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:57:50,320 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:57:50,321 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:50,321 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:57:50,321 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:57:50,321 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-01 23:57:50,321 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:57:50,321 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:57:50,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,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-01-01 23:57:50,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,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-01-01 23:57:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,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-01-01 23:57:50,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-01-01 23:57:50,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:50,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:57:50,918 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:50,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:50,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:50,932 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:50,932 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} 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-01-01 23:57:50,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:50,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:50,982 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:50,982 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} 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) [2019-01-01 23:57:51,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,023 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Honda state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,272 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,272 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,298 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,328 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,355 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,355 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,381 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,412 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,439 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,464 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,507 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,507 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-01 23:57:51,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,545 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,550 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Honda state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,584 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:51,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-01 23:57:51,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:51,640 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:57:51,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:51,714 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:57:51,719 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:57:51,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:57:51,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:57:51,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:57:51,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:57:51,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:51,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:57:51,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:57:51,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2019-01-01 23:57:51,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:57:51,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:57:51,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,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-01-01 23:57:51,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:51,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-01-01 23:57:51,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-01-01 23:57:51,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:52,662 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:57:53,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:57:53,104 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:57:53,107 INFO L122 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-01-01 23:57:53,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,119 INFO L122 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-01-01 23:57:53,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,131 INFO L122 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-01-01 23:57:53,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,148 INFO L122 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-01-01 23:57:53,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,152 INFO L122 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-01-01 23:57:53,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,158 INFO L122 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-01-01 23:57:53,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,161 INFO L122 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-01-01 23:57:53,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,163 INFO L122 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-01-01 23:57:53,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,166 INFO L122 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-01-01 23:57:53,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,167 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,169 INFO L122 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-01-01 23:57:53,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,172 INFO L122 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-01-01 23:57:53,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,175 INFO L122 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-01-01 23:57:53,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,178 INFO L122 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-01-01 23:57:53,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,183 INFO L122 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-01-01 23:57:53,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,188 INFO L122 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-01-01 23:57:53,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,196 INFO L122 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-01-01 23:57:53,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,201 INFO L122 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-01-01 23:57:53,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,207 INFO L122 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-01-01 23:57:53,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,208 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,209 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,212 INFO L122 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-01-01 23:57:53,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,213 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,223 INFO L122 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-01-01 23:57:53,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,231 INFO L122 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-01-01 23:57:53,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,236 INFO L122 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-01-01 23:57:53,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,242 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,244 INFO L122 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-01-01 23:57:53,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,247 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,252 INFO L122 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-01-01 23:57:53,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,261 INFO L122 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-01-01 23:57:53,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,267 INFO L122 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-01-01 23:57:53,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,274 INFO L122 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-01-01 23:57:53,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,285 INFO L122 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-01-01 23:57:53,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,290 INFO L122 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-01-01 23:57:53,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,296 INFO L122 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-01-01 23:57:53,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,301 INFO L122 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-01-01 23:57:53,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:53,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:53,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,304 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 23:57:53,310 INFO L122 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-01-01 23:57:53,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,311 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,315 INFO L122 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-01-01 23:57:53,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,322 INFO L122 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-01-01 23:57:53,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,325 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,327 INFO L122 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-01-01 23:57:53,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,331 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,332 INFO L122 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-01-01 23:57:53,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,337 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,353 INFO L122 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-01-01 23:57:53,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,360 INFO L122 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-01-01 23:57:53,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,361 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,361 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,366 INFO L122 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-01-01 23:57:53,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,367 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,376 INFO L122 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-01-01 23:57:53,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,377 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:53,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,381 INFO L122 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-01-01 23:57:53,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,382 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,385 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,386 INFO L122 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-01-01 23:57:53,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,391 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,392 INFO L122 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-01-01 23:57:53,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,397 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,398 INFO L122 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-01-01 23:57:53,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,399 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,404 INFO L122 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-01-01 23:57:53,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,405 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,409 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,410 INFO L122 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-01-01 23:57:53,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,411 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,411 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,416 INFO L122 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-01-01 23:57:53,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,422 INFO L122 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-01-01 23:57:53,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,427 INFO L122 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-01-01 23:57:53,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,428 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:53,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,434 INFO L122 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-01-01 23:57:53,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:53,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,444 INFO L122 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-01-01 23:57:53,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,447 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,448 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,449 INFO L122 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-01-01 23:57:53,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,454 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,454 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,458 INFO L122 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-01-01 23:57:53,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:53,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,461 INFO L122 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-01-01 23:57:53,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,462 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:53,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,469 INFO L122 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-01-01 23:57:53,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,470 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,471 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,476 INFO L122 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-01-01 23:57:53,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,480 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,481 INFO L122 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-01-01 23:57:53,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,493 INFO L122 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-01-01 23:57:53,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,494 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,498 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,500 INFO L122 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-01-01 23:57:53,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,501 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,502 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,508 INFO L122 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-01-01 23:57:53,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,509 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,510 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,514 INFO L122 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-01-01 23:57:53,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,518 INFO L122 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-01-01 23:57:53,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,519 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:53,519 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:53,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,526 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 23:57:53,527 INFO L122 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-01-01 23:57:53,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,528 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,528 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,531 INFO L122 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-01-01 23:57:53,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,542 INFO L122 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-01-01 23:57:53,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,543 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,545 INFO L122 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-01-01 23:57:53,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,546 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,550 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,555 INFO L122 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-01-01 23:57:53,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,568 INFO L122 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-01-01 23:57:53,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,571 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,572 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,573 INFO L122 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-01-01 23:57:53,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,583 INFO L122 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-01-01 23:57:53,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,584 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,584 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,588 INFO L122 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-01-01 23:57:53,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,593 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:53,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,597 INFO L122 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-01-01 23:57:53,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,603 INFO L122 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-01-01 23:57:53,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,611 INFO L122 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-01-01 23:57:53,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,617 INFO L122 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-01-01 23:57:53,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,622 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,622 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,624 INFO L122 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-01-01 23:57:53,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,630 INFO L122 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-01-01 23:57:53,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,636 INFO L122 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-01-01 23:57:53,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,643 INFO L122 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-01-01 23:57:53,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,647 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,652 INFO L122 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-01-01 23:57:53,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,653 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:53,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,656 INFO L122 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-01-01 23:57:53,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:53,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,672 INFO L122 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-01-01 23:57:53,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,677 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,679 INFO L122 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-01-01 23:57:53,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,685 INFO L122 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-01-01 23:57:53,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,686 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,687 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:53,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,691 INFO L122 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-01-01 23:57:53,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,692 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,696 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,696 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:53,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,700 INFO L122 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-01-01 23:57:53,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,705 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,711 INFO L122 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-01-01 23:57:53,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,713 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,718 INFO L122 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-01-01 23:57:53,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,731 INFO L122 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-01-01 23:57:53,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,732 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,738 INFO L122 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-01-01 23:57:53,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,743 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,745 INFO L122 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-01-01 23:57:53,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,749 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,753 INFO L122 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-01-01 23:57:53,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,758 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,764 INFO L122 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-01-01 23:57:53,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:53,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:53,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,767 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 23:57:53,767 INFO L122 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-01-01 23:57:53,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,772 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,773 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,775 INFO L122 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-01-01 23:57:53,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,778 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,778 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,787 INFO L122 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-01-01 23:57:53,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,788 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,789 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,794 INFO L122 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-01-01 23:57:53,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,803 INFO L122 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-01-01 23:57:53,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,809 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,820 INFO L122 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-01-01 23:57:53,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,826 INFO L122 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-01-01 23:57:53,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,830 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,830 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,832 INFO L122 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-01-01 23:57:53,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,837 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,837 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,842 INFO L122 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-01-01 23:57:53,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,843 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,847 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:53,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,849 INFO L122 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-01-01 23:57:53,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,850 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,850 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,851 INFO L122 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-01-01 23:57:53,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,856 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,857 INFO L122 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-01-01 23:57:53,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,863 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,865 INFO L122 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-01-01 23:57:53,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,871 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,872 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,874 INFO L122 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-01-01 23:57:53,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,882 INFO L122 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-01-01 23:57:53,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,883 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,885 INFO L122 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-01-01 23:57:53,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,886 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,886 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,893 INFO L122 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-01-01 23:57:53,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,897 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,899 INFO L122 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-01-01 23:57:53,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,904 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:53,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,909 INFO L122 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-01-01 23:57:53,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,910 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,914 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:53,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,925 INFO L122 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-01-01 23:57:53,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,926 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,932 INFO L122 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-01-01 23:57:53,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,937 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,939 INFO L122 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-01-01 23:57:53,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,943 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,944 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:53,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,948 INFO L122 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-01-01 23:57:53,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,950 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:53,950 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,951 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:53,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,953 INFO L122 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-01-01 23:57:53,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,965 INFO L122 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-01-01 23:57:53,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,966 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,969 INFO L122 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-01-01 23:57:53,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,972 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,985 INFO L122 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-01-01 23:57:53,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,986 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:53,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:53,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:53,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:53,998 INFO L122 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-01-01 23:57:53,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:53,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:53,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:53,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:53,999 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,007 INFO L122 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-01-01 23:57:54,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:54,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,008 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,077 INFO L122 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-01-01 23:57:54,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:54,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,084 INFO L122 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-01-01 23:57:54,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:54,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,085 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,094 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 23:57:54,095 INFO L122 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-01-01 23:57:54,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,095 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,096 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,096 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,098 INFO L122 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-01-01 23:57:54,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,098 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,104 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,113 INFO L122 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-01-01 23:57:54,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,113 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,114 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,121 INFO L122 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-01-01 23:57:54,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,128 INFO L122 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-01-01 23:57:54,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,129 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,129 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,130 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,150 INFO L122 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-01-01 23:57:54,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,150 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,159 INFO L122 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-01-01 23:57:54,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,161 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,165 INFO L122 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-01-01 23:57:54,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,167 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,171 INFO L122 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-01-01 23:57:54,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,172 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,172 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:54,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,177 INFO L122 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-01-01 23:57:54,178 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,178 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,178 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,179 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,180 INFO L122 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-01-01 23:57:54,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,181 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,183 INFO L122 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-01-01 23:57:54,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,185 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,187 INFO L122 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-01-01 23:57:54,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,188 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,190 INFO L122 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-01-01 23:57:54,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,191 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,191 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,193 INFO L122 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-01-01 23:57:54,193 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,193 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,193 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,194 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,195 INFO L122 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-01-01 23:57:54,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,196 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,198 INFO L122 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-01-01 23:57:54,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,199 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,199 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,200 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,201 INFO L122 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-01-01 23:57:54,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,227 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,228 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:54,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,233 INFO L122 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-01-01 23:57:54,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,234 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:54,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,252 INFO L122 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-01-01 23:57:54,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,253 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,253 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,263 INFO L122 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-01-01 23:57:54,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,267 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,267 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,268 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,272 INFO L122 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-01-01 23:57:54,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,272 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,273 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:54,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,284 INFO L122 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-01-01 23:57:54,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:54,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,297 INFO L122 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-01-01 23:57:54,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,303 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,304 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,304 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,310 INFO L122 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-01-01 23:57:54,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,311 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,311 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,315 INFO L122 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-01-01 23:57:54,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,316 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,338 INFO L122 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-01-01 23:57:54,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,339 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,340 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,343 INFO L122 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-01-01 23:57:54,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,343 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,344 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,345 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,346 INFO L122 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-01-01 23:57:54,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,347 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,347 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,349 INFO L122 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-01-01 23:57:54,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,366 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,367 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,370 INFO L122 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-01-01 23:57:54,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,371 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:54,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,371 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:54,374 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:54,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,375 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 23:57:54,375 INFO L122 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-01-01 23:57:54,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,376 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,384 INFO L122 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-01-01 23:57:54,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,392 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,402 INFO L122 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-01-01 23:57:54,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,403 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,403 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,404 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,406 INFO L122 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-01-01 23:57:54,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,407 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,408 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,411 INFO L122 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-01-01 23:57:54,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,424 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,442 INFO L122 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-01-01 23:57:54,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,443 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,451 INFO L122 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-01-01 23:57:54,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,452 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,455 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,460 INFO L122 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-01-01 23:57:54,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,460 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,462 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,464 INFO L122 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-01-01 23:57:54,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,465 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,465 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,467 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:54,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,480 INFO L122 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-01-01 23:57:54,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,480 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,484 INFO L122 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-01-01 23:57:54,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,494 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,495 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,497 INFO L122 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-01-01 23:57:54,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,498 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,506 INFO L122 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-01-01 23:57:54,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,507 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,507 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,512 INFO L122 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-01-01 23:57:54,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,522 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,525 INFO L122 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-01-01 23:57:54,526 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,526 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,531 INFO L122 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-01-01 23:57:54,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,531 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,536 INFO L122 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-01-01 23:57:54,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,554 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,558 INFO L122 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-01-01 23:57:54,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,558 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,561 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,562 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:54,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,579 INFO L122 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-01-01 23:57:54,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,591 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,595 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:54,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,614 INFO L122 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-01-01 23:57:54,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,624 INFO L122 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-01-01 23:57:54,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,624 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,633 INFO L122 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-01-01 23:57:54,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,634 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,634 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:54,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,648 INFO L122 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-01-01 23:57:54,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,652 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,653 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:54,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,666 INFO L122 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-01-01 23:57:54,666 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,666 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,678 INFO L122 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-01-01 23:57:54,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,679 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,682 INFO L122 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-01-01 23:57:54,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,710 INFO L122 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-01-01 23:57:54,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,715 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,723 INFO L122 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-01-01 23:57:54,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,727 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,734 INFO L122 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-01-01 23:57:54,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,753 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,755 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,757 INFO L122 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-01-01 23:57:54,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,758 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,769 INFO L122 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-01-01 23:57:54,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:57:54,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:54,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:54,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,776 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 23:57:54,777 INFO L122 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-01-01 23:57:54,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,802 INFO L122 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-01-01 23:57:54,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,803 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,804 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,820 INFO L122 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-01-01 23:57:54,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,821 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,828 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,829 INFO L122 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-01-01 23:57:54,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,847 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,848 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,849 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,851 INFO L122 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-01-01 23:57:54,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,852 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,852 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,858 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,874 INFO L122 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-01-01 23:57:54,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,878 INFO L122 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-01-01 23:57:54,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,901 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,902 INFO L122 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-01-01 23:57:54,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,904 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,909 INFO L122 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-01-01 23:57:54,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:54,910 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,914 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:54,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,923 INFO L122 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-01-01 23:57:54,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,953 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,955 INFO L122 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-01-01 23:57:54,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,955 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,957 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,958 INFO L122 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-01-01 23:57:54,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,963 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,971 INFO L122 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-01-01 23:57:54,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,993 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,994 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:54,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:54,996 INFO L122 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-01-01 23:57:54,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:54,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:54,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:54,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:54,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:54,997 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:54,998 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:54,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,003 INFO L122 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-01-01 23:57:55,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,004 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,005 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,010 INFO L122 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-01-01 23:57:55,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,037 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,041 INFO L122 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-01-01 23:57:55,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,041 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,047 INFO L122 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-01-01 23:57:55,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,054 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:55,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,071 INFO L122 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-01-01 23:57:55,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,092 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,092 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,095 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:55,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,122 INFO L122 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-01-01 23:57:55,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,123 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,128 INFO L122 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-01-01 23:57:55,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,131 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,132 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,137 INFO L122 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-01-01 23:57:55,146 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,146 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,147 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,147 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,149 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:55,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,163 INFO L122 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-01-01 23:57:55,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,166 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,166 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,166 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,168 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:55,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,176 INFO L122 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-01-01 23:57:55,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,183 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,184 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,190 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,207 INFO L122 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-01-01 23:57:55,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,222 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,223 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,226 INFO L122 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-01-01 23:57:55,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,228 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,252 INFO L122 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-01-01 23:57:55,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,255 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,266 INFO L122 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-01-01 23:57:55,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,278 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,279 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,281 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,283 INFO L122 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-01-01 23:57:55,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,283 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,284 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,288 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,290 INFO L122 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-01-01 23:57:55,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,292 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,308 INFO L122 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-01-01 23:57:55,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,330 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,331 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:55,332 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:55,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,333 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 23:57:55,334 INFO L122 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-01-01 23:57:55,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,334 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,338 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,339 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,344 INFO L122 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-01-01 23:57:55,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,346 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,346 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,354 INFO L122 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-01-01 23:57:55,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,379 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,380 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,383 INFO L122 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-01-01 23:57:55,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,383 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,384 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,391 INFO L122 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-01-01 23:57:55,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,411 INFO L122 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-01-01 23:57:55,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,435 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,439 INFO L122 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-01-01 23:57:55,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,446 INFO L122 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-01-01 23:57:55,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,448 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,450 INFO L122 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-01-01 23:57:55,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,484 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,484 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,485 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:55,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,488 INFO L122 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-01-01 23:57:55,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,492 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,498 INFO L122 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-01-01 23:57:55,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,498 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,506 INFO L122 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-01-01 23:57:55,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,535 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,535 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,543 INFO L122 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-01-01 23:57:55,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,543 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,544 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,551 INFO L122 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-01-01 23:57:55,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,551 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,552 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,557 INFO L122 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-01-01 23:57:55,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,589 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,592 INFO L122 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-01-01 23:57:55,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,592 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,595 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,601 INFO L122 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-01-01 23:57:55,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,601 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,602 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,610 INFO L122 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-01-01 23:57:55,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,638 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,643 INFO L122 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-01-01 23:57:55,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,644 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,648 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:55,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,663 INFO L122 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-01-01 23:57:55,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,664 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,665 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,672 INFO L122 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-01-01 23:57:55,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,702 INFO L122 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-01-01 23:57:55,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,703 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,706 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:55,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,713 INFO L122 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-01-01 23:57:55,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,717 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:55,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,717 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:55,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,724 INFO L122 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-01-01 23:57:55,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,758 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,766 INFO L122 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-01-01 23:57:55,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,766 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,776 INFO L122 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-01-01 23:57:55,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,793 INFO L122 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-01-01 23:57:55,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,799 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,806 INFO L122 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-01-01 23:57:55,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,816 INFO L122 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-01-01 23:57:55,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,830 INFO L122 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-01-01 23:57:55,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,855 INFO L122 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-01-01 23:57:55,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,856 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:55,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:55,857 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:55,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,862 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 23:57:55,862 INFO L122 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-01-01 23:57:55,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,863 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,864 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:55,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:55,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,872 INFO L122 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-01-01 23:57:55,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,907 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:55,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:55,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,922 INFO L122 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-01-01 23:57:55,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,923 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:55,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:55,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,930 INFO L122 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-01-01 23:57:55,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,934 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:55,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:55,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:55,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:55,948 INFO L122 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-01-01 23:57:55,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:55,974 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:55,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:55,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:55,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:55,975 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:55,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:55,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,005 INFO L122 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-01-01 23:57:56,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,006 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,006 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,016 INFO L122 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-01-01 23:57:56,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,017 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,017 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,028 INFO L122 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-01-01 23:57:56,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,040 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,041 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,045 INFO L122 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-01-01 23:57:56,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,049 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:56,049 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,053 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:57:56,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,061 INFO L122 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-01-01 23:57:56,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,068 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,076 INFO L122 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-01-01 23:57:56,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,107 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,112 INFO L122 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-01-01 23:57:56,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,112 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,116 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,130 INFO L122 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-01-01 23:57:56,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,131 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,135 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,146 INFO L122 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-01-01 23:57:56,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,172 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,173 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,181 INFO L122 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-01-01 23:57:56,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,185 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,186 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,197 INFO L122 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-01-01 23:57:56,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,198 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,198 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,206 INFO L122 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-01-01 23:57:56,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,240 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,241 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,248 INFO L122 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-01-01 23:57:56,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,248 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,249 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:56,249 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,250 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:57:56,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,262 INFO L122 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-01-01 23:57:56,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,263 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:56,264 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,268 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:57:56,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,292 INFO L122 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-01-01 23:57:56,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,313 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,314 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,319 INFO L122 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-01-01 23:57:56,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,323 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,323 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,335 INFO L122 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-01-01 23:57:56,335 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,335 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,336 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:56,338 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,339 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:57:56,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,349 INFO L122 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-01-01 23:57:56,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,372 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:56,373 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,374 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:57:56,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,379 INFO L122 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-01-01 23:57:56,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,383 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,397 INFO L122 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-01-01 23:57:56,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,397 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,398 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,411 INFO L122 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-01-01 23:57:56,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,439 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,440 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,471 INFO L122 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-01-01 23:57:56,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,475 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,482 INFO L122 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-01-01 23:57:56,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,482 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,486 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,499 INFO L122 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-01-01 23:57:56,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,513 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,517 INFO L122 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-01-01 23:57:56,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,517 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,518 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,529 INFO L122 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-01-01 23:57:56,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:56,529 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:57:56,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:56,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:56,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:56,533 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:57:56,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:56,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:56,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:56,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:56,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:56,576 INFO L87 Difference]: Start difference. First operand 988 states and 1342 transitions. cyclomatic complexity: 355 Second operand 3 states. [2019-01-01 23:57:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:57,029 INFO L93 Difference]: Finished difference Result 988 states and 1326 transitions. [2019-01-01 23:57:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:57,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1326 transitions. [2019-01-01 23:57:57,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-01 23:57:57,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1326 transitions. [2019-01-01 23:57:57,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 988 [2019-01-01 23:57:57,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 988 [2019-01-01 23:57:57,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1326 transitions. [2019-01-01 23:57:57,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:57,059 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-01 23:57:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1326 transitions. [2019-01-01 23:57:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2019-01-01 23:57:57,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-01-01 23:57:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1326 transitions. [2019-01-01 23:57:57,106 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-01 23:57:57,106 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2019-01-01 23:57:57,106 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:57:57,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1326 transitions. [2019-01-01 23:57:57,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2019-01-01 23:57:57,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:57,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:57,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:57,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:57,125 INFO L794 eck$LassoCheckResult]: Stem: 13041#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 12895#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 12896#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 12992#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12993#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12899#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 12900#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 12953#L107 assume !(1 == ~P_1_pc~0); 13011#L107-2 is_P_1_triggered_~__retres1~0 := 0; 13010#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13012#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13013#L467 assume !(0 != activate_threads_~tmp~1); 13080#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12869#L175 assume !(1 == ~P_2_pc~0); 12870#L175-2 is_P_2_triggered_~__retres1~1 := 0; 12871#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12872#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12919#L475 assume !(0 != activate_threads_~tmp___0~1); 12873#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 12874#L257 assume !(1 == ~C_1_pc~0); 12974#L257-2 assume !(2 == ~C_1_pc~0); 12975#L267-1 is_C_1_triggered_~__retres1~2 := 0; 13039#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 12986#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12924#L483 assume !(0 != activate_threads_~tmp___1~1); 12925#L537-1 [2019-01-01 23:57:57,125 INFO L796 eck$LassoCheckResult]: Loop: 12925#L537-1 assume !false; 12951#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 12952#L386 assume !false; 12988#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13024#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13099#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13097#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13095#L351 assume 0 != eval_~tmp___2~0; 13092#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13057#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 12990#L72 assume 0 == ~P_1_pc~0; 12911#L76 assume !(~i~0 < ~max_loop~0); 12912#L95 ~P_1_st~0 := 2; 12902#L356 assume !(0 == ~P_2_st~0); 13052#L371 assume !(0 == ~C_1_st~0); 13053#L386 assume !false; 13744#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13008#L317 assume !(0 == ~P_1_st~0); 12879#L321 assume !(0 == ~P_2_st~0); 12881#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 13025#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13808#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13807#L351 assume !(0 != eval_~tmp___2~0); 13021#L402 start_simulation_~kernel_st~0 := 2; 12967#L287-1 start_simulation_~kernel_st~0 := 3; 12968#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13020#L107-6 assume 1 == ~P_1_pc~0; 12996#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 12997#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13001#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13002#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 13066#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13070#L175-6 assume !(1 == ~P_2_pc~0); 13069#L175-8 is_P_2_triggered_~__retres1~1 := 0; 12916#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12917#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12886#L475-6 assume !(0 != activate_threads_~tmp___0~1); 12887#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13843#L257-6 assume !(1 == ~C_1_pc~0); 13842#L257-8 assume !(2 == ~C_1_pc~0); 13841#L267-5 is_C_1_triggered_~__retres1~2 := 0; 13840#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13839#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12906#L483-6 assume !(0 != activate_threads_~tmp___1~1); 12907#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 12918#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12960#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12961#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 13029#L556 assume !(0 == start_simulation_~tmp~3); 12987#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13015#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12962#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12963#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 12891#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12892#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 12909#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 12910#L569 assume !(0 != start_simulation_~tmp___0~2); 12925#L537-1 [2019-01-01 23:57:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2019-01-01 23:57:57,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:57,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:57,164 INFO L82 PathProgramCache]: Analyzing trace with hash 779870938, now seen corresponding path program 1 times [2019-01-01 23:57:57,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:57,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:57,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:57,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:57,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:57,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:57,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:57,351 INFO L87 Difference]: Start difference. First operand 988 states and 1326 transitions. cyclomatic complexity: 339 Second operand 3 states. [2019-01-01 23:57:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:57,675 INFO L93 Difference]: Finished difference Result 1925 states and 2547 transitions. [2019-01-01 23:57:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:57,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2547 transitions. [2019-01-01 23:57:57,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1900 [2019-01-01 23:57:57,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2547 transitions. [2019-01-01 23:57:57,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2019-01-01 23:57:57,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2019-01-01 23:57:57,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2547 transitions. [2019-01-01 23:57:57,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:57,714 INFO L705 BuchiCegarLoop]: Abstraction has 1925 states and 2547 transitions. [2019-01-01 23:57:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2547 transitions. [2019-01-01 23:57:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1909. [2019-01-01 23:57:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2019-01-01 23:57:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2527 transitions. [2019-01-01 23:57:57,754 INFO L728 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2019-01-01 23:57:57,754 INFO L608 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2019-01-01 23:57:57,754 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:57:57,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 2527 transitions. [2019-01-01 23:57:57,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1884 [2019-01-01 23:57:57,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:57,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:57,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:57,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:57,775 INFO L794 eck$LassoCheckResult]: Stem: 15958#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 15814#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 15815#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 15906#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 15907#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 15816#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 15817#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15870#L107 assume !(1 == ~P_1_pc~0); 15950#L107-2 is_P_1_triggered_~__retres1~0 := 0; 15951#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15924#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15925#L467 assume !(0 != activate_threads_~tmp~1); 15990#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15788#L175 assume !(1 == ~P_2_pc~0); 15789#L175-2 is_P_2_triggered_~__retres1~1 := 0; 15790#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15791#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15835#L475 assume !(0 != activate_threads_~tmp___0~1); 15792#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15793#L257 assume !(1 == ~C_1_pc~0); 15890#L257-2 assume !(2 == ~C_1_pc~0); 15891#L267-1 is_C_1_triggered_~__retres1~2 := 0; 15955#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15901#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15843#L483 assume !(0 != activate_threads_~tmp___1~1); 15844#L537-1 [2019-01-01 23:57:57,776 INFO L796 eck$LassoCheckResult]: Loop: 15844#L537-1 assume !false; 17251#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 17248#L386 assume !false; 17246#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17243#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17241#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17238#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17234#L351 assume 0 != eval_~tmp___2~0; 17232#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17230#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 15905#L72 assume 0 == ~P_1_pc~0; 15828#L76 assume !(~i~0 < ~max_loop~0); 15829#L95 ~P_1_st~0 := 2; 15859#L356 assume !(0 == ~P_2_st~0); 17387#L371 assume !(0 == ~C_1_st~0); 17408#L386 assume !false; 17402#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17398#L317 assume !(0 == ~P_1_st~0); 17395#L321 assume !(0 == ~P_2_st~0); 17390#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 17384#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17383#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17381#L351 assume !(0 != eval_~tmp___2~0); 17379#L402 start_simulation_~kernel_st~0 := 2; 17378#L287-1 start_simulation_~kernel_st~0 := 3; 17377#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17376#L107-6 assume !(1 == ~P_1_pc~0); 17372#L107-8 is_P_1_triggered_~__retres1~0 := 0; 17370#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17368#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17365#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17362#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17360#L175-6 assume !(1 == ~P_2_pc~0); 17358#L175-8 is_P_2_triggered_~__retres1~1 := 0; 17356#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17354#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17352#L475-6 assume !(0 != activate_threads_~tmp___0~1); 17350#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17348#L257-6 assume !(1 == ~C_1_pc~0); 17346#L257-8 assume !(2 == ~C_1_pc~0); 17344#L267-5 is_C_1_triggered_~__retres1~2 := 0; 17343#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17340#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17338#L483-6 assume !(0 != activate_threads_~tmp___1~1); 17336#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17333#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17331#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17329#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17327#L556 assume !(0 == start_simulation_~tmp~3); 17324#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17322#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17321#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17320#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 17318#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17316#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 17314#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17312#L569 assume !(0 != start_simulation_~tmp___0~2); 15844#L537-1 [2019-01-01 23:57:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2019-01-01 23:57:57,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash -991600037, now seen corresponding path program 1 times [2019-01-01 23:57:57,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-01 23:57:58,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:58,063 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:58,064 INFO L87 Difference]: Start difference. First operand 1909 states and 2527 transitions. cyclomatic complexity: 619 Second operand 5 states. [2019-01-01 23:57:58,430 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:57:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:58,817 INFO L93 Difference]: Finished difference Result 3270 states and 4376 transitions. [2019-01-01 23:57:58,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:58,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3270 states and 4376 transitions. [2019-01-01 23:57:58,846 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 3203 [2019-01-01 23:57:58,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3270 states to 3270 states and 4376 transitions. [2019-01-01 23:57:58,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3270 [2019-01-01 23:57:58,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3270 [2019-01-01 23:57:58,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3270 states and 4376 transitions. [2019-01-01 23:57:58,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:58,887 INFO L705 BuchiCegarLoop]: Abstraction has 3270 states and 4376 transitions. [2019-01-01 23:57:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states and 4376 transitions. [2019-01-01 23:57:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 1735. [2019-01-01 23:57:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-01-01 23:57:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2280 transitions. [2019-01-01 23:57:58,934 INFO L728 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2019-01-01 23:57:58,934 INFO L608 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2019-01-01 23:57:58,934 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 23:57:58,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2280 transitions. [2019-01-01 23:57:58,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1700 [2019-01-01 23:57:58,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:58,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:58,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:58,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:58,951 INFO L794 eck$LassoCheckResult]: Stem: 21160#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 21006#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 21007#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 21101#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 21102#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 21008#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 21009#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 21064#L107 assume !(1 == ~P_1_pc~0); 21151#L107-2 is_P_1_triggered_~__retres1~0 := 0; 21152#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 21120#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 21121#L467 assume !(0 != activate_threads_~tmp~1); 21202#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20980#L175 assume !(1 == ~P_2_pc~0); 20981#L175-2 is_P_2_triggered_~__retres1~1 := 0; 20982#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20983#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 21027#L475 assume !(0 != activate_threads_~tmp___0~1); 20984#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20985#L257 assume !(1 == ~C_1_pc~0); 21083#L257-2 assume !(2 == ~C_1_pc~0); 21084#L267-1 is_C_1_triggered_~__retres1~2 := 0; 21156#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 21096#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21036#L483 assume !(0 != activate_threads_~tmp___1~1); 21037#L537-1 assume !false; 21472#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 21440#L386 [2019-01-01 23:57:58,951 INFO L796 eck$LassoCheckResult]: Loop: 21440#L386 assume !false; 21471#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21470#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21465#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21462#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 21460#L351 assume 0 != eval_~tmp___2~0; 21457#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 21453#L360 assume !(0 != eval_~tmp~0); 21447#L356 assume !(0 == ~P_2_st~0); 21444#L371 assume !(0 == ~C_1_st~0); 21440#L386 [2019-01-01 23:57:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2019-01-01 23:57:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:58,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2019-01-01 23:57:59,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:59,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2019-01-01 23:57:59,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:59,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:59,355 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 23:57:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:59,371 INFO L87 Difference]: Start difference. First operand 1735 states and 2280 transitions. cyclomatic complexity: 548 Second operand 3 states. [2019-01-01 23:57:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:59,411 INFO L93 Difference]: Finished difference Result 2774 states and 3602 transitions. [2019-01-01 23:57:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:59,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2774 states and 3602 transitions. [2019-01-01 23:57:59,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2709 [2019-01-01 23:57:59,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2774 states to 2774 states and 3602 transitions. [2019-01-01 23:57:59,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2774 [2019-01-01 23:57:59,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2774 [2019-01-01 23:57:59,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2774 states and 3602 transitions. [2019-01-01 23:57:59,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:59,447 INFO L705 BuchiCegarLoop]: Abstraction has 2774 states and 3602 transitions. [2019-01-01 23:57:59,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states and 3602 transitions. [2019-01-01 23:57:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2682. [2019-01-01 23:57:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-01 23:57:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3490 transitions. [2019-01-01 23:57:59,489 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2019-01-01 23:57:59,489 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2019-01-01 23:57:59,489 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 23:57:59,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3490 transitions. [2019-01-01 23:57:59,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-01 23:57:59,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:59,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:59,498 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:59,498 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:59,498 INFO L794 eck$LassoCheckResult]: Stem: 25680#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 25520#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 25521#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 25624#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 25625#L294-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25689#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 25581#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 25582#L107 assume !(1 == ~P_1_pc~0); 25672#L107-2 is_P_1_triggered_~__retres1~0 := 0; 25673#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 25640#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 25641#L467 assume !(0 != activate_threads_~tmp~1); 25719#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 25720#L175 assume !(1 == ~P_2_pc~0); 27487#L175-2 is_P_2_triggered_~__retres1~1 := 0; 27486#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 27485#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 25541#L475 assume !(0 != activate_threads_~tmp___0~1); 25542#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 25612#L257 assume !(1 == ~C_1_pc~0); 25613#L257-2 assume !(2 == ~C_1_pc~0); 27454#L267-1 is_C_1_triggered_~__retres1~2 := 0; 27452#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 27450#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 27448#L483 assume !(0 != activate_threads_~tmp___1~1); 27446#L537-1 assume !false; 27437#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 27432#L386 [2019-01-01 23:57:59,498 INFO L796 eck$LassoCheckResult]: Loop: 27432#L386 assume !false; 27430#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27428#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 27426#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27424#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 27422#L351 assume 0 != eval_~tmp___2~0; 27420#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 27417#L360 assume !(0 != eval_~tmp~0); 27418#L356 assume !(0 == ~P_2_st~0); 27435#L371 assume !(0 == ~C_1_st~0); 27432#L386 [2019-01-01 23:57:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2019-01-01 23:57:59,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:59,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:57:59,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:59,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:59,558 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2019-01-01 23:57:59,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,824 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 23:57:59,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:59,840 INFO L87 Difference]: Start difference. First operand 2682 states and 3490 transitions. cyclomatic complexity: 811 Second operand 3 states. [2019-01-01 23:57:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:59,859 INFO L93 Difference]: Finished difference Result 2660 states and 3467 transitions. [2019-01-01 23:57:59,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:59,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 3467 transitions. [2019-01-01 23:57:59,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-01 23:57:59,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2660 states and 3467 transitions. [2019-01-01 23:57:59,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2660 [2019-01-01 23:57:59,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2660 [2019-01-01 23:57:59,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2660 states and 3467 transitions. [2019-01-01 23:57:59,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:59,893 INFO L705 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-01 23:57:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states and 3467 transitions. [2019-01-01 23:57:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2660. [2019-01-01 23:57:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-01-01 23:57:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3467 transitions. [2019-01-01 23:57:59,931 INFO L728 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-01 23:57:59,931 INFO L608 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2019-01-01 23:57:59,932 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 23:57:59,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2660 states and 3467 transitions. [2019-01-01 23:57:59,939 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2019-01-01 23:57:59,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:59,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:59,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:59,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:57:59,940 INFO L794 eck$LassoCheckResult]: Stem: 31021#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 30868#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 30869#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 30966#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 30967#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 30874#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 30875#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 30926#L107 assume !(1 == ~P_1_pc~0); 31012#L107-2 is_P_1_triggered_~__retres1~0 := 0; 31013#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 30982#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 30983#L467 assume !(0 != activate_threads_~tmp~1); 31054#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 30845#L175 assume !(1 == ~P_2_pc~0); 30846#L175-2 is_P_2_triggered_~__retres1~1 := 0; 30847#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 30848#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 30892#L475 assume !(0 != activate_threads_~tmp___0~1); 30849#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 30850#L257 assume !(1 == ~C_1_pc~0); 30945#L257-2 assume !(2 == ~C_1_pc~0); 30946#L267-1 is_C_1_triggered_~__retres1~2 := 0; 31016#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 30957#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 30897#L483 assume !(0 != activate_threads_~tmp___1~1); 30898#L537-1 assume !false; 30924#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 30925#L386 [2019-01-01 23:57:59,940 INFO L796 eck$LassoCheckResult]: Loop: 30925#L386 assume !false; 30959#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 30979#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 30928#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 30929#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 30912#L351 assume 0 != eval_~tmp___2~0; 30876#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 30877#L360 assume !(0 != eval_~tmp~0); 31033#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32102#L375 assume !(0 != eval_~tmp___0~0); 32103#L371 assume !(0 == ~C_1_st~0); 30925#L386 [2019-01-01 23:57:59,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2019-01-01 23:57:59,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2019-01-01 23:57:59,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2019-01-01 23:57:59,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:58:00,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:00,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:58:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:00,149 INFO L87 Difference]: Start difference. First operand 2660 states and 3467 transitions. cyclomatic complexity: 810 Second operand 3 states. [2019-01-01 23:58:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:00,189 INFO L93 Difference]: Finished difference Result 4373 states and 5643 transitions. [2019-01-01 23:58:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:00,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 5643 transitions. [2019-01-01 23:58:00,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2019-01-01 23:58:00,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4373 states and 5643 transitions. [2019-01-01 23:58:00,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2019-01-01 23:58:00,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2019-01-01 23:58:00,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4373 states and 5643 transitions. [2019-01-01 23:58:00,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:00,233 INFO L705 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-01 23:58:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states and 5643 transitions. [2019-01-01 23:58:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2019-01-01 23:58:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2019-01-01 23:58:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5643 transitions. [2019-01-01 23:58:00,299 INFO L728 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-01 23:58:00,299 INFO L608 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2019-01-01 23:58:00,299 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 23:58:00,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4373 states and 5643 transitions. [2019-01-01 23:58:00,313 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2019-01-01 23:58:00,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:00,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:00,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:00,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:00,315 INFO L794 eck$LassoCheckResult]: Stem: 38077#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 37909#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 37910#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 38009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 38010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 37911#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 37912#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 37968#L107 assume !(1 == ~P_1_pc~0); 38067#L107-2 is_P_1_triggered_~__retres1~0 := 0; 38068#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38030#L467 assume !(0 != activate_threads_~tmp~1); 38116#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 37886#L175 assume !(1 == ~P_2_pc~0); 37887#L175-2 is_P_2_triggered_~__retres1~1 := 0; 37888#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 37889#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 37931#L475 assume !(0 != activate_threads_~tmp___0~1); 37890#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 37891#L257 assume !(1 == ~C_1_pc~0); 37987#L257-2 assume !(2 == ~C_1_pc~0); 37988#L267-1 is_C_1_triggered_~__retres1~2 := 0; 38074#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38001#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 37939#L483 assume !(0 != activate_threads_~tmp___1~1); 37940#L537-1 assume !false; 39076#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 38562#L386 [2019-01-01 23:58:00,315 INFO L796 eck$LassoCheckResult]: Loop: 38562#L386 assume !false; 39073#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 39071#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 39069#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 39067#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 39065#L351 assume 0 != eval_~tmp___2~0; 39064#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 39062#L360 assume !(0 != eval_~tmp~0); 38569#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 38566#L375 assume !(0 != eval_~tmp___0~0); 38564#L371 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 38547#L390 assume !(0 != eval_~tmp___1~0); 38562#L386 [2019-01-01 23:58:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2019-01-01 23:58:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2019-01-01 23:58:00,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2019-01-01 23:58:00,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:00,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:00,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:00,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:00,689 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-01 23:58:01,068 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-01-01 23:58:01,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:58:01 BoogieIcfgContainer [2019-01-01 23:58:01,199 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:58:01,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:58:01,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:58:01,200 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:58:01,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:57:44" (3/4) ... [2019-01-01 23:58:01,205 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:58:01,295 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:58:01,299 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:58:01,300 INFO L168 Benchmark]: Toolchain (without parser) took 18593.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -65.7 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,303 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:58:01,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.02 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,304 INFO L168 Benchmark]: Boogie Preprocessor took 133.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,305 INFO L168 Benchmark]: RCFGBuilder took 1353.44 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,305 INFO L168 Benchmark]: BuchiAutomizer took 16535.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.2 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:01,305 INFO L168 Benchmark]: Witness Printer took 99.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:58:01,308 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.93 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.02 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1353.44 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16535.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.2 MB). Peak memory consumption was 227.8 MB. Max. memory is 11.5 GB. * Witness Printer took 99.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.4s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 10.9s. Construction of modules took 3.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 4182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 4373 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3501 SDtfs, 4366 SDslu, 4736 SDs, 0 SdLazy, 305 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc3 concLT0 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 14ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 346]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {count=0, \result=0, P_1_pc=0, C_1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bdca8d4=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ea0e052=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e0206d3=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@140ee119=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, __retres1=0, tmp___0=0, num=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ad71b1c=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@136ca95c=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f0bdf18=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c1e405b=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@34d4f3ee=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 346]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; Loop: [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...