./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/kundu_true-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/kundu_true-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 375118f5e6b201fc35ff4858369e05c815397841 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:43,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:57:43,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:57:43,813 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:57:43,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:57:43,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:57:43,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:57:43,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:57:43,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:57:43,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:57:43,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:57:43,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:57:43,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:57:43,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:57:43,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:57:43,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:57:43,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:57:43,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:57:43,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:57:43,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:57:43,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:57:43,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:57:43,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:57:43,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:57:43,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:57:43,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:57:43,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:57:43,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:57:43,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:57:43,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:57:43,857 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:57:43,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:57:43,858 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:57:43,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:57:43,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:57:43,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:57:43,862 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:43,883 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:57:43,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:57:43,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:57:43,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:57:43,886 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:57:43,886 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:57:43,886 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:57:43,886 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:57:43,886 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:57:43,886 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:57:43,888 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:57:43,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:57:43,888 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:57:43,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:57:43,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:57:43,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:57:43,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:57:43,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:57:43,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:57:43,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:57:43,890 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:57:43,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:57:43,891 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:57:43,891 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:57:43,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:57:43,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:57:43,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:57:43,891 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:57:43,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:57:43,894 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:57:43,894 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:57:43,896 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:57:43,896 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 -> 375118f5e6b201fc35ff4858369e05c815397841 [2019-01-01 23:57:43,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:57:43,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:57:43,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:57:43,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:57:43,967 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:57:43,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2019-01-01 23:57:44,058 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5eb3a68f/92e3eae1d3fd4256ba96ca7d16664938/FLAGf2ef22e00 [2019-01-01 23:57:44,791 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:57:44,792 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2019-01-01 23:57:44,806 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5eb3a68f/92e3eae1d3fd4256ba96ca7d16664938/FLAGf2ef22e00 [2019-01-01 23:57:45,015 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5eb3a68f/92e3eae1d3fd4256ba96ca7d16664938 [2019-01-01 23:57:45,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:57:45,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:57:45,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:57:45,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:57:45,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:57:45,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:57:45" (1/1) ... [2019-01-01 23:57:45,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ccf8dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:45, skipping insertion in model container [2019-01-01 23:57:45,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:57:45" (1/1) ... [2019-01-01 23:57:45,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:57:45,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:57:45,514 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:57:45,529 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:57:45,642 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:57:45,697 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:57:45,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:45 WrapperNode [2019-01-01 23:57:45,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:57:45,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:57:45,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:57:45,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:57:45,717 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:45" (1/1) ... [2019-01-01 23:57:45,736 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:45" (1/1) ... [2019-01-01 23:57:45,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:57:45,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:57:45,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:57:45,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:57:45,942 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:45" (1/1) ... [2019-01-01 23:57:45,943 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:45" (1/1) ... [2019-01-01 23:57:45,957 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:45" (1/1) ... [2019-01-01 23:57:45,957 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:45" (1/1) ... [2019-01-01 23:57:45,976 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:45" (1/1) ... [2019-01-01 23:57:46,012 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:45" (1/1) ... [2019-01-01 23:57:46,018 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:45" (1/1) ... [2019-01-01 23:57:46,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:57:46,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:57:46,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:57:46,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:57:46,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:45" (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:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:57:46,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:57:47,611 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:57:47,612 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2019-01-01 23:57:47,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:57:47 BoogieIcfgContainer [2019-01-01 23:57:47,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:57:47,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:57:47,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:57:47,618 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:57:47,619 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:47,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:57:45" (1/3) ... [2019-01-01 23:57:47,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60c96585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:57:47, skipping insertion in model container [2019-01-01 23:57:47,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:47,625 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:57:45" (2/3) ... [2019-01-01 23:57:47,626 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60c96585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:57:47, skipping insertion in model container [2019-01-01 23:57:47,626 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:57:47,626 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:57:47" (3/3) ... [2019-01-01 23:57:47,629 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2019-01-01 23:57:47,745 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:57:47,746 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:57:47,746 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:57:47,746 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:57:47,746 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:57:47,747 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:57:47,747 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:57:47,747 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:57:47,747 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:57:47,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2019-01-01 23:57:47,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2019-01-01 23:57:47,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:47,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:47,870 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:47,870 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:47,870 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:57:47,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2019-01-01 23:57:47,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2019-01-01 23:57:47,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:47,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:47,895 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:47,895 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:47,904 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~clk~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; 12#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;~clk~0 := 0;~max_loop~0 := 8;~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; 101#L603true 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; 18#L288true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 76#L295-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 117#L300-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 143#L305-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; 86#L108true assume !(1 == ~P_1_pc~0); 80#L108-2true is_P_1_triggered_~__retres1~0 := 0; 87#L119true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 31#L120true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 154#L481true assume !(0 != activate_threads_~tmp~1); 159#L481-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 109#L176true assume 1 == ~P_2_pc~0; 53#L177true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 110#L187true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 54#L188true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 161#L489true assume !(0 != activate_threads_~tmp___0~1); 170#L489-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 173#L258true assume 1 == ~C_1_pc~0; 102#L259true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 68#L279true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 177#L280true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 29#L497true assume !(0 != activate_threads_~tmp___1~1); 88#L551-1true [2019-01-01 23:57:47,906 INFO L796 eck$LassoCheckResult]: Loop: 88#L551-1true assume !false; 20#L552true 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; 5#L387true assume !true; 42#L403true start_simulation_~kernel_st~0 := 2; 13#L288-1true start_simulation_~kernel_st~0 := 3; 41#L414true 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; 51#L108-6true assume 1 == ~P_1_pc~0; 21#L109-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 83#L119-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 23#L120-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 142#L481-6true assume !(0 != activate_threads_~tmp~1); 124#L481-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 115#L176-6true assume 1 == ~P_2_pc~0; 47#L177-2true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 123#L187-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 48#L188-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 149#L489-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 155#L489-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 127#L258-6true assume 1 == ~C_1_pc~0; 97#L259-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 63#L279-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 169#L280-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 9#L497-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 162#L497-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 24#L318-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 148#L335-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 106#L336-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 105#L570true assume !(0 == start_simulation_~tmp~3); 90#L570-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; 28#L318-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 151#L335-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 91#L336-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 152#L525true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 62#L532true stop_simulation_#res := stop_simulation_~__retres2~0; 10#L533true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 139#L583true assume !(0 != start_simulation_~tmp___0~2); 88#L551-1true [2019-01-01 23:57:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2019-01-01 23:57:47,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:47,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,119 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,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:48,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 369732879, now seen corresponding path program 1 times [2019-01-01 23:57:48,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,146 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,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:57:48,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:48,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:48,172 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2019-01-01 23:57:48,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:48,215 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2019-01-01 23:57:48,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:48,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2019-01-01 23:57:48,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-01-01 23:57:48,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2019-01-01 23:57:48,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2019-01-01 23:57:48,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2019-01-01 23:57:48,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2019-01-01 23:57:48,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:48,241 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-01-01 23:57:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2019-01-01 23:57:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-01-01 23:57:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-01 23:57:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-01-01 23:57:48,295 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-01-01 23:57:48,296 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-01-01 23:57:48,296 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:57:48,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2019-01-01 23:57:48,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-01-01 23:57:48,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:48,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:48,302 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:48,302 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:48,303 INFO L794 eck$LassoCheckResult]: Stem: 503#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 381#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;~clk~0 := 0;~max_loop~0 := 8;~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; 382#L603 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; 397#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 398#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 477#L300-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 504#L305-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; 483#L108 assume !(1 == ~P_1_pc~0); 421#L108-2 is_P_1_triggered_~__retres1~0 := 0; 420#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 422#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 423#L481 assume !(0 != activate_threads_~tmp~1); 523#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 501#L176 assume 1 == ~P_2_pc~0; 453#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 454#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 456#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 457#L489 assume !(0 != activate_threads_~tmp___0~1); 525#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 529#L258 assume 1 == ~C_1_pc~0; 495#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 464#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 467#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 417#L497 assume !(0 != activate_threads_~tmp___1~1); 418#L551-1 [2019-01-01 23:57:48,303 INFO L796 eck$LassoCheckResult]: Loop: 418#L551-1 assume !false; 400#L552 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; 366#L387 assume !false; 367#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 392#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 393#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 497#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 498#L352 assume !(0 != eval_~tmp___2~0); 438#L403 start_simulation_~kernel_st~0 := 2; 383#L288-1 start_simulation_~kernel_st~0 := 3; 384#L414 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; 437#L108-6 assume 1 == ~P_1_pc~0; 401#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 402#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 404#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 405#L481-6 assume !(0 != activate_threads_~tmp~1); 508#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 502#L176-6 assume 1 == ~P_2_pc~0; 443#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 444#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 446#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 447#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 522#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 511#L258-6 assume 1 == ~C_1_pc~0; 490#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 432#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 462#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 374#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 375#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 406#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 407#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 500#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 499#L570 assume !(0 == start_simulation_~tmp~3); 436#L570-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; 414#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 415#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 484#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 485#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 461#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 376#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 377#L583 assume !(0 != start_simulation_~tmp___0~2); 418#L551-1 [2019-01-01 23:57:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2019-01-01 23:57:48,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,364 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,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:48,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 1 times [2019-01-01 23:57:48,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,583 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,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:48,584 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:48,585 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-01-01 23:57:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:48,639 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-01-01 23:57:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:48,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2019-01-01 23:57:48,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-01-01 23:57:48,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2019-01-01 23:57:48,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2019-01-01 23:57:48,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2019-01-01 23:57:48,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2019-01-01 23:57:48,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:48,658 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-01-01 23:57:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2019-01-01 23:57:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-01-01 23:57:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-01 23:57:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-01-01 23:57:48,672 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-01-01 23:57:48,672 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-01-01 23:57:48,672 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:57:48,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2019-01-01 23:57:48,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-01-01 23:57:48,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:48,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:48,677 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:48,677 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:48,677 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 726#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;~clk~0 := 0;~max_loop~0 := 8;~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; 727#L603 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; 740#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 741#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 822#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 849#L305-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; 828#L108 assume !(1 == ~P_1_pc~0); 766#L108-2 is_P_1_triggered_~__retres1~0 := 0; 765#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 767#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 768#L481 assume !(0 != activate_threads_~tmp~1); 868#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 846#L176 assume 1 == ~P_2_pc~0; 798#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 799#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 801#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 802#L489 assume !(0 != activate_threads_~tmp___0~1); 870#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 874#L258 assume 1 == ~C_1_pc~0; 840#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 809#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 812#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 762#L497 assume !(0 != activate_threads_~tmp___1~1); 763#L551-1 [2019-01-01 23:57:48,678 INFO L796 eck$LassoCheckResult]: Loop: 763#L551-1 assume !false; 744#L552 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; 711#L387 assume !false; 712#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 735#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 736#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 842#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 843#L352 assume !(0 != eval_~tmp___2~0); 783#L403 start_simulation_~kernel_st~0 := 2; 728#L288-1 start_simulation_~kernel_st~0 := 3; 729#L414 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; 782#L108-6 assume 1 == ~P_1_pc~0; 745#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 746#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 749#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 750#L481-6 assume !(0 != activate_threads_~tmp~1); 853#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 847#L176-6 assume 1 == ~P_2_pc~0; 788#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 789#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 791#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 792#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 867#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 856#L258-6 assume 1 == ~C_1_pc~0; 835#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 777#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 807#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 719#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 720#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 751#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 752#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 845#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 844#L570 assume !(0 == start_simulation_~tmp~3); 781#L570-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; 759#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 760#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 829#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 830#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 806#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 721#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 722#L583 assume !(0 != start_simulation_~tmp___0~2); 763#L551-1 [2019-01-01 23:57:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,678 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2019-01-01 23:57:48,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,797 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,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:48,799 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 2 times [2019-01-01 23:57:48,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:48,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:48,948 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,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:48,950 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:48,952 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 Second operand 3 states. [2019-01-01 23:57:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:49,092 INFO L93 Difference]: Finished difference Result 303 states and 446 transitions. [2019-01-01 23:57:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:49,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 446 transitions. [2019-01-01 23:57:49,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 275 [2019-01-01 23:57:49,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 446 transitions. [2019-01-01 23:57:49,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2019-01-01 23:57:49,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2019-01-01 23:57:49,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 446 transitions. [2019-01-01 23:57:49,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:49,105 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 446 transitions. [2019-01-01 23:57:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 446 transitions. [2019-01-01 23:57:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2019-01-01 23:57:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-01 23:57:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2019-01-01 23:57:49,126 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2019-01-01 23:57:49,127 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2019-01-01 23:57:49,127 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:57:49,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 425 transitions. [2019-01-01 23:57:49,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260 [2019-01-01 23:57:49,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:49,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:49,132 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:49,132 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:49,133 INFO L794 eck$LassoCheckResult]: Stem: 1331#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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;~clk~0 := 0;~max_loop~0 := 8;~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#L603 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; 1220#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1221#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1299#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1332#L305-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; 1305#L108 assume !(1 == ~P_1_pc~0); 1246#L108-2 is_P_1_triggered_~__retres1~0 := 0; 1245#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1247#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1248#L481 assume !(0 != activate_threads_~tmp~1); 1352#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1327#L176 assume !(1 == ~P_2_pc~0); 1328#L176-2 is_P_2_triggered_~__retres1~1 := 0; 1329#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1278#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1279#L489 assume !(0 != activate_threads_~tmp___0~1); 1354#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1358#L258 assume 1 == ~C_1_pc~0; 1321#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1286#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1289#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1242#L497 assume !(0 != activate_threads_~tmp___1~1); 1243#L551-1 [2019-01-01 23:57:49,133 INFO L796 eck$LassoCheckResult]: Loop: 1243#L551-1 assume !false; 1228#L552 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; 1191#L387 assume !false; 1192#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1217#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1218#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1323#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1324#L352 assume !(0 != eval_~tmp___2~0); 1263#L403 start_simulation_~kernel_st~0 := 2; 1208#L288-1 start_simulation_~kernel_st~0 := 3; 1209#L414 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; 1262#L108-6 assume 1 == ~P_1_pc~0; 1225#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1226#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1232#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1233#L481-6 assume !(0 != activate_threads_~tmp~1); 1336#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1330#L176-6 assume !(1 == ~P_2_pc~0); 1312#L176-8 is_P_2_triggered_~__retres1~1 := 0; 1313#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1271#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1272#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1351#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1339#L258-6 assume 1 == ~C_1_pc~0; 1316#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1257#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1284#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1199#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1200#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1229#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1230#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1326#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1325#L570 assume !(0 == start_simulation_~tmp~3); 1261#L570-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; 1237#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1238#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1306#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1307#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1283#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 1201#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1202#L583 assume !(0 != start_simulation_~tmp___0~2); 1243#L551-1 [2019-01-01 23:57:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2019-01-01 23:57:49,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:49,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:49,205 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,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:49,206 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:57:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1301427912, now seen corresponding path program 1 times [2019-01-01 23:57:49,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:49,320 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,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:49,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:49,321 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:49,324 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. cyclomatic complexity: 138 Second operand 3 states. [2019-01-01 23:57:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:49,824 INFO L93 Difference]: Finished difference Result 536 states and 772 transitions. [2019-01-01 23:57:49,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:49,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 772 transitions. [2019-01-01 23:57:49,835 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 510 [2019-01-01 23:57:49,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 772 transitions. [2019-01-01 23:57:49,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2019-01-01 23:57:49,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2019-01-01 23:57:49,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 772 transitions. [2019-01-01 23:57:49,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:49,860 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 772 transitions. [2019-01-01 23:57:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 772 transitions. [2019-01-01 23:57:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 520. [2019-01-01 23:57:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-01-01 23:57:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 752 transitions. [2019-01-01 23:57:49,904 INFO L728 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2019-01-01 23:57:49,904 INFO L608 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2019-01-01 23:57:49,904 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:57:49,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 752 transitions. [2019-01-01 23:57:49,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 494 [2019-01-01 23:57:49,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:49,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:49,916 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,917 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:49,917 INFO L794 eck$LassoCheckResult]: Stem: 2167#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 2039#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;~clk~0 := 0;~max_loop~0 := 8;~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; 2040#L603 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; 2053#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2054#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2132#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2168#L305-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; 2141#L108 assume !(1 == ~P_1_pc~0); 2079#L108-2 is_P_1_triggered_~__retres1~0 := 0; 2078#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2080#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2081#L481 assume !(0 != activate_threads_~tmp~1); 2193#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2162#L176 assume !(1 == ~P_2_pc~0); 2163#L176-2 is_P_2_triggered_~__retres1~1 := 0; 2164#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2111#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2112#L489 assume !(0 != activate_threads_~tmp___0~1); 2199#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2206#L258 assume !(1 == ~C_1_pc~0); 2202#L258-2 assume !(2 == ~C_1_pc~0); 2118#L268-1 is_C_1_triggered_~__retres1~2 := 0; 2119#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2122#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2075#L497 assume !(0 != activate_threads_~tmp___1~1); 2076#L551-1 [2019-01-01 23:57:49,918 INFO L796 eck$LassoCheckResult]: Loop: 2076#L551-1 assume !false; 2307#L552 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; 2303#L387 assume !false; 2298#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2295#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2292#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2287#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2281#L352 assume !(0 != eval_~tmp___2~0); 2096#L403 start_simulation_~kernel_st~0 := 2; 2041#L288-1 start_simulation_~kernel_st~0 := 3; 2042#L414 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; 2095#L108-6 assume 1 == ~P_1_pc~0; 2058#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2059#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2062#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2063#L481-6 assume !(0 != activate_threads_~tmp~1); 2172#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2165#L176-6 assume !(1 == ~P_2_pc~0); 2166#L176-8 is_P_2_triggered_~__retres1~1 := 0; 2436#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2434#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2432#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2429#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2427#L258-6 assume !(1 == ~C_1_pc~0); 2425#L258-8 assume !(2 == ~C_1_pc~0); 2423#L268-5 is_C_1_triggered_~__retres1~2 := 0; 2421#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2419#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2416#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2414#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2410#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2406#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2404#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2389#L570 assume !(0 == start_simulation_~tmp~3); 2382#L570-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; 2340#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2335#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2334#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2329#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2327#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 2323#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2320#L583 assume !(0 != start_simulation_~tmp___0~2); 2076#L551-1 [2019-01-01 23:57:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2019-01-01 23:57:49,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:49,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1109961593, now seen corresponding path program 1 times [2019-01-01 23:57:50,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:50,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:50,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:50,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:50,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:50,135 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:50,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:50,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:50,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:50,138 INFO L87 Difference]: Start difference. First operand 520 states and 752 transitions. cyclomatic complexity: 233 Second operand 5 states. [2019-01-01 23:57:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:50,844 INFO L93 Difference]: Finished difference Result 916 states and 1314 transitions. [2019-01-01 23:57:50,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:57:50,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1314 transitions. [2019-01-01 23:57:50,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 890 [2019-01-01 23:57:50,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 916 states and 1314 transitions. [2019-01-01 23:57:50,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2019-01-01 23:57:50,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 916 [2019-01-01 23:57:50,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1314 transitions. [2019-01-01 23:57:50,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:50,881 INFO L705 BuchiCegarLoop]: Abstraction has 916 states and 1314 transitions. [2019-01-01 23:57:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1314 transitions. [2019-01-01 23:57:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 532. [2019-01-01 23:57:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-01-01 23:57:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2019-01-01 23:57:50,911 INFO L728 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2019-01-01 23:57:50,911 INFO L608 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2019-01-01 23:57:50,911 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:57:50,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 532 states and 764 transitions. [2019-01-01 23:57:50,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2019-01-01 23:57:50,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:50,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:50,922 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:50,928 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:50,930 INFO L794 eck$LassoCheckResult]: Stem: 3623#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 3491#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;~clk~0 := 0;~max_loop~0 := 8;~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; 3492#L603 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; 3505#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3506#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 3589#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3624#L305-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; 3596#L108 assume !(1 == ~P_1_pc~0); 3532#L108-2 is_P_1_triggered_~__retres1~0 := 0; 3531#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3533#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3534#L481 assume !(0 != activate_threads_~tmp~1); 3653#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3618#L176 assume !(1 == ~P_2_pc~0); 3619#L176-2 is_P_2_triggered_~__retres1~1 := 0; 3620#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3568#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3569#L489 assume !(0 != activate_threads_~tmp___0~1); 3656#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3666#L258 assume !(1 == ~C_1_pc~0); 3661#L258-2 assume !(2 == ~C_1_pc~0); 3575#L268-1 is_C_1_triggered_~__retres1~2 := 0; 3576#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3579#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3528#L497 assume !(0 != activate_threads_~tmp___1~1); 3529#L551-1 [2019-01-01 23:57:50,930 INFO L796 eck$LassoCheckResult]: Loop: 3529#L551-1 assume !false; 3509#L552 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; 3476#L387 assume !false; 3477#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3500#L318 assume !(0 == ~P_1_st~0); 3502#L322 assume !(0 == ~P_2_st~0); 3551#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 3552#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3953#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3952#L352 assume !(0 != eval_~tmp___2~0); 3550#L403 start_simulation_~kernel_st~0 := 2; 3493#L288-1 start_simulation_~kernel_st~0 := 3; 3494#L414 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; 3549#L108-6 assume !(1 == ~P_1_pc~0); 3566#L108-8 is_P_1_triggered_~__retres1~0 := 0; 3595#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3515#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3516#L481-6 assume !(0 != activate_threads_~tmp~1); 3720#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3719#L176-6 assume !(1 == ~P_2_pc~0); 3706#L176-8 is_P_2_triggered_~__retres1~1 := 0; 3707#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4003#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3969#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3654#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3633#L258-6 assume !(1 == ~C_1_pc~0); 3630#L258-8 assume !(2 == ~C_1_pc~0); 3631#L268-5 is_C_1_triggered_~__retres1~2 := 0; 3965#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3966#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3987#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3657#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3517#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3518#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3617#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3615#L570 assume !(0 == start_simulation_~tmp~3); 3548#L570-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; 3525#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3526#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3597#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3598#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3573#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 3486#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3487#L583 assume !(0 != start_simulation_~tmp___0~2); 3529#L551-1 [2019-01-01 23:57:50,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2019-01-01 23:57:50,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1255144909, now seen corresponding path program 1 times [2019-01-01 23:57:50,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:51,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:51,100 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:51,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:51,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:51,104 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:57:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:57:51,105 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. cyclomatic complexity: 233 Second operand 3 states. [2019-01-01 23:57:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:51,358 INFO L93 Difference]: Finished difference Result 930 states and 1312 transitions. [2019-01-01 23:57:51,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:57:51,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 1312 transitions. [2019-01-01 23:57:51,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2019-01-01 23:57:51,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 930 states and 1312 transitions. [2019-01-01 23:57:51,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2019-01-01 23:57:51,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 930 [2019-01-01 23:57:51,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 930 states and 1312 transitions. [2019-01-01 23:57:51,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:51,388 INFO L705 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2019-01-01 23:57:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states and 1312 transitions. [2019-01-01 23:57:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2019-01-01 23:57:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-01 23:57:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2019-01-01 23:57:51,416 INFO L728 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2019-01-01 23:57:51,416 INFO L608 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2019-01-01 23:57:51,416 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:57:51,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 930 states and 1312 transitions. [2019-01-01 23:57:51,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2019-01-01 23:57:51,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:51,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:51,431 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:51,431 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:51,431 INFO L794 eck$LassoCheckResult]: Stem: 5092#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 4961#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;~clk~0 := 0;~max_loop~0 := 8;~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; 4962#L603 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; 4974#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 4975#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5058#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5093#L305-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; 5066#L108 assume !(1 == ~P_1_pc~0); 4997#L108-2 is_P_1_triggered_~__retres1~0 := 0; 4996#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4998#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4999#L481 assume !(0 != activate_threads_~tmp~1); 5125#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5088#L176 assume !(1 == ~P_2_pc~0); 5089#L176-2 is_P_2_triggered_~__retres1~1 := 0; 5090#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5035#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5036#L489 assume !(0 != activate_threads_~tmp___0~1); 5130#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5141#L258 assume !(1 == ~C_1_pc~0); 5133#L258-2 assume !(2 == ~C_1_pc~0); 5043#L268-1 is_C_1_triggered_~__retres1~2 := 0; 5044#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5047#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4993#L497 assume !(0 != activate_threads_~tmp___1~1); 4994#L551-1 [2019-01-01 23:57:51,437 INFO L796 eck$LassoCheckResult]: Loop: 4994#L551-1 assume !false; 5342#L552 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; 5321#L387 assume !false; 5339#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5337#L318 assume !(0 == ~P_1_st~0); 5338#L322 assume !(0 == ~P_2_st~0); 5539#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 5537#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5535#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5533#L352 assume !(0 != eval_~tmp___2~0); 5526#L403 start_simulation_~kernel_st~0 := 2; 5524#L288-1 start_simulation_~kernel_st~0 := 3; 5522#L414 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; 5520#L108-6 assume 1 == ~P_1_pc~0; 5508#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 5506#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5503#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5500#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5498#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5492#L176-6 assume !(1 == ~P_2_pc~0); 5487#L176-8 is_P_2_triggered_~__retres1~1 := 0; 5466#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5463#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5461#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 5445#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5441#L258-6 assume !(1 == ~C_1_pc~0); 5437#L258-8 assume !(2 == ~C_1_pc~0); 5429#L268-5 is_C_1_triggered_~__retres1~2 := 0; 5421#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5416#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5411#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5406#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5400#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5399#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5398#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 5383#L570 assume !(0 == start_simulation_~tmp~3); 5379#L570-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; 5376#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5352#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5351#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5349#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5348#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 5347#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 5344#L583 assume !(0 != start_simulation_~tmp___0~2); 4994#L551-1 [2019-01-01 23:57:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2019-01-01 23:57:51,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:51,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1406901968, now seen corresponding path program 1 times [2019-01-01 23:57:51,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:51,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:51,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:51,632 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:51,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:51,633 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:51,634 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. cyclomatic complexity: 383 Second operand 5 states. [2019-01-01 23:57:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:52,344 INFO L93 Difference]: Finished difference Result 2066 states and 2911 transitions. [2019-01-01 23:57:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:52,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 2911 transitions. [2019-01-01 23:57:52,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2040 [2019-01-01 23:57:52,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 2066 states and 2911 transitions. [2019-01-01 23:57:52,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2066 [2019-01-01 23:57:52,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2019-01-01 23:57:52,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2066 states and 2911 transitions. [2019-01-01 23:57:52,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:52,404 INFO L705 BuchiCegarLoop]: Abstraction has 2066 states and 2911 transitions. [2019-01-01 23:57:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states and 2911 transitions. [2019-01-01 23:57:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 966. [2019-01-01 23:57:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-01-01 23:57:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1339 transitions. [2019-01-01 23:57:52,446 INFO L728 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2019-01-01 23:57:52,446 INFO L608 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2019-01-01 23:57:52,446 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:57:52,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 966 states and 1339 transitions. [2019-01-01 23:57:52,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 940 [2019-01-01 23:57:52,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:52,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:52,458 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:52,460 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:52,461 INFO L794 eck$LassoCheckResult]: Stem: 8109#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 7969#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;~clk~0 := 0;~max_loop~0 := 8;~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; 7970#L603 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; 7982#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 7983#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 8068#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 8110#L305-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; 8077#L108 assume !(1 == ~P_1_pc~0); 8007#L108-2 is_P_1_triggered_~__retres1~0 := 0; 8006#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8008#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8009#L481 assume !(0 != activate_threads_~tmp~1); 8145#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8104#L176 assume !(1 == ~P_2_pc~0); 8105#L176-2 is_P_2_triggered_~__retres1~1 := 0; 8106#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8045#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8046#L489 assume !(0 != activate_threads_~tmp___0~1); 8149#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8158#L258 assume !(1 == ~C_1_pc~0); 8153#L258-2 assume !(2 == ~C_1_pc~0); 8052#L268-1 is_C_1_triggered_~__retres1~2 := 0; 8053#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8057#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8003#L497 assume !(0 != activate_threads_~tmp___1~1); 8004#L551-1 [2019-01-01 23:57:52,461 INFO L796 eck$LassoCheckResult]: Loop: 8004#L551-1 assume !false; 8338#L552 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; 8335#L387 assume !false; 8334#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8333#L318 assume !(0 == ~P_1_st~0); 7979#L322 assume !(0 == ~P_2_st~0); 8027#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 8028#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8879#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8878#L352 assume !(0 != eval_~tmp___2~0); 8026#L403 start_simulation_~kernel_st~0 := 2; 7971#L288-1 start_simulation_~kernel_st~0 := 3; 7972#L414 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; 8025#L108-6 assume 1 == ~P_1_pc~0; 8424#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8423#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8422#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8421#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8387#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8384#L176-6 assume !(1 == ~P_2_pc~0); 8382#L176-8 is_P_2_triggered_~__retres1~1 := 0; 8380#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8378#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8376#L489-6 assume !(0 != activate_threads_~tmp___0~1); 8374#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8372#L258-6 assume !(1 == ~C_1_pc~0); 8370#L258-8 assume !(2 == ~C_1_pc~0); 8368#L268-5 is_C_1_triggered_~__retres1~2 := 0; 8366#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8364#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8362#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8360#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8357#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8355#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8353#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8350#L570 assume !(0 == start_simulation_~tmp~3); 8349#L570-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; 8347#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8346#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8345#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8344#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8343#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 8342#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8341#L583 assume !(0 != start_simulation_~tmp___0~2); 8004#L551-1 [2019-01-01 23:57:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2019-01-01 23:57:52,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:52,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:52,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:52,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:52,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash -984200142, now seen corresponding path program 1 times [2019-01-01 23:57:52,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:52,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:52,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:52,918 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:52,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:52,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:52,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:52,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:52,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:52,920 INFO L87 Difference]: Start difference. First operand 966 states and 1339 transitions. cyclomatic complexity: 374 Second operand 5 states. [2019-01-01 23:57:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:53,287 INFO L93 Difference]: Finished difference Result 2040 states and 2832 transitions. [2019-01-01 23:57:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:53,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2040 states and 2832 transitions. [2019-01-01 23:57:53,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2014 [2019-01-01 23:57:53,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2040 states to 2040 states and 2832 transitions. [2019-01-01 23:57:53,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2040 [2019-01-01 23:57:53,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2040 [2019-01-01 23:57:53,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2040 states and 2832 transitions. [2019-01-01 23:57:53,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:53,338 INFO L705 BuchiCegarLoop]: Abstraction has 2040 states and 2832 transitions. [2019-01-01 23:57:53,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states and 2832 transitions. [2019-01-01 23:57:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 996. [2019-01-01 23:57:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-01-01 23:57:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1358 transitions. [2019-01-01 23:57:53,378 INFO L728 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2019-01-01 23:57:53,378 INFO L608 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2019-01-01 23:57:53,378 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:57:53,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 1358 transitions. [2019-01-01 23:57:53,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 970 [2019-01-01 23:57:53,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:53,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:53,388 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:53,388 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:53,388 INFO L794 eck$LassoCheckResult]: Stem: 11132#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 10989#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;~clk~0 := 0;~max_loop~0 := 8;~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; 10990#L603 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; 11002#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11003#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 11093#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 11133#L305-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; 11103#L108 assume !(1 == ~P_1_pc~0); 11026#L108-2 is_P_1_triggered_~__retres1~0 := 0; 11025#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11027#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11028#L481 assume !(0 != activate_threads_~tmp~1); 11166#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11128#L176 assume !(1 == ~P_2_pc~0); 11129#L176-2 is_P_2_triggered_~__retres1~1 := 0; 11130#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11068#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11069#L489 assume !(0 != activate_threads_~tmp___0~1); 11173#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11184#L258 assume !(1 == ~C_1_pc~0); 11177#L258-2 assume !(2 == ~C_1_pc~0); 11076#L268-1 is_C_1_triggered_~__retres1~2 := 0; 11077#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11080#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11022#L497 assume !(0 != activate_threads_~tmp___1~1); 11023#L551-1 [2019-01-01 23:57:53,389 INFO L796 eck$LassoCheckResult]: Loop: 11023#L551-1 assume !false; 11506#L552 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; 11503#L387 assume !false; 11502#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11500#L318 assume !(0 == ~P_1_st~0); 11501#L322 assume !(0 == ~P_2_st~0); 11588#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11587#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11584#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11582#L352 assume !(0 != eval_~tmp___2~0); 11579#L403 start_simulation_~kernel_st~0 := 2; 11578#L288-1 start_simulation_~kernel_st~0 := 3; 11045#L414 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; 11046#L108-6 assume !(1 == ~P_1_pc~0); 11009#L108-8 is_P_1_triggered_~__retres1~0 := 0; 11008#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11011#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11012#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11577#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11733#L176-6 assume !(1 == ~P_2_pc~0); 11731#L176-8 is_P_2_triggered_~__retres1~1 := 0; 11729#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11727#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11163#L489-6 assume !(0 != activate_threads_~tmp___0~1); 11164#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11143#L258-6 assume !(1 == ~C_1_pc~0); 11144#L258-8 assume !(2 == ~C_1_pc~0); 11536#L268-5 is_C_1_triggered_~__retres1~2 := 0; 11534#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11532#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11530#L497-6 assume !(0 != activate_threads_~tmp___1~1); 11528#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11525#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11523#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11521#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11518#L570 assume !(0 == start_simulation_~tmp~3); 11517#L570-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; 11515#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11514#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11513#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11512#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11511#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 11510#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11509#L583 assume !(0 != start_simulation_~tmp___0~2); 11023#L551-1 [2019-01-01 23:57:53,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2019-01-01 23:57:53,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:53,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:53,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash 528178929, now seen corresponding path program 1 times [2019-01-01 23:57:53,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:53,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:53,636 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:53,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:53,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:57:53,637 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:57:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:57:53,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:57:53,640 INFO L87 Difference]: Start difference. First operand 996 states and 1358 transitions. cyclomatic complexity: 363 Second operand 5 states. [2019-01-01 23:57:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:57:53,978 INFO L93 Difference]: Finished difference Result 2384 states and 3231 transitions. [2019-01-01 23:57:53,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:57:53,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2384 states and 3231 transitions. [2019-01-01 23:57:53,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2329 [2019-01-01 23:57:54,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2384 states to 2384 states and 3231 transitions. [2019-01-01 23:57:54,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2384 [2019-01-01 23:57:54,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2384 [2019-01-01 23:57:54,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2384 states and 3231 transitions. [2019-01-01 23:57:54,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:57:54,028 INFO L705 BuchiCegarLoop]: Abstraction has 2384 states and 3231 transitions. [2019-01-01 23:57:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states and 3231 transitions. [2019-01-01 23:57:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1059. [2019-01-01 23:57:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-01-01 23:57:54,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1421 transitions. [2019-01-01 23:57:54,067 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2019-01-01 23:57:54,067 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2019-01-01 23:57:54,067 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:57:54,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1421 transitions. [2019-01-01 23:57:54,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2019-01-01 23:57:54,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:57:54,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:57:54,075 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:54,075 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:54,076 INFO L794 eck$LassoCheckResult]: Stem: 14544#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 14385#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;~clk~0 := 0;~max_loop~0 := 8;~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; 14386#L603 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; 14398#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 14399#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 14498#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 14545#L305-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; 14508#L108 assume !(1 == ~P_1_pc~0); 14421#L108-2 is_P_1_triggered_~__retres1~0 := 0; 14506#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14509#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14573#L481 assume !(0 != activate_threads_~tmp~1); 14574#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14539#L176 assume !(1 == ~P_2_pc~0); 14540#L176-2 is_P_2_triggered_~__retres1~1 := 0; 14541#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14463#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14464#L489 assume !(0 != activate_threads_~tmp___0~1); 14578#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 14585#L258 assume !(1 == ~C_1_pc~0); 14580#L258-2 assume !(2 == ~C_1_pc~0); 14477#L268-1 is_C_1_triggered_~__retres1~2 := 0; 14478#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14482#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14417#L497 assume !(0 != activate_threads_~tmp___1~1); 14418#L551-1 [2019-01-01 23:57:54,076 INFO L796 eck$LassoCheckResult]: Loop: 14418#L551-1 assume !false; 15245#L552 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; 15242#L387 assume !false; 15240#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15238#L318 assume !(0 == ~P_1_st~0); 14393#L322 assume !(0 == ~P_2_st~0); 14443#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 14444#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 14992#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 14985#L352 assume !(0 != eval_~tmp___2~0); 14442#L403 start_simulation_~kernel_st~0 := 2; 14383#L288-1 start_simulation_~kernel_st~0 := 3; 14384#L414 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; 14441#L108-6 assume 1 == ~P_1_pc~0; 14402#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 14403#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14747#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14748#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 15269#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15348#L176-6 assume !(1 == ~P_2_pc~0); 15347#L176-8 is_P_2_triggered_~__retres1~1 := 0; 15346#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15345#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15344#L489-6 assume !(0 != activate_threads_~tmp___0~1); 15343#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15342#L258-6 assume !(1 == ~C_1_pc~0); 15341#L258-8 assume !(2 == ~C_1_pc~0); 15340#L268-5 is_C_1_triggered_~__retres1~2 := 0; 15339#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15338#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15337#L497-6 assume !(0 != activate_threads_~tmp___1~1); 15336#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15335#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15334#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15333#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 15332#L570 assume !(0 == start_simulation_~tmp~3); 14440#L570-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; 15282#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15281#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15280#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 15279#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15271#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 14378#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 14379#L583 assume !(0 != start_simulation_~tmp___0~2); 14418#L551-1 [2019-01-01 23:57:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2019-01-01 23:57:54,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1995317392, now seen corresponding path program 1 times [2019-01-01 23:57:54,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:54,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:57:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:57:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:57:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash -237860646, now seen corresponding path program 1 times [2019-01-01 23:57:54,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:57:54,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:57:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:57:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:57:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:57:54,259 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:54,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:57:54,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:57:54,795 WARN L181 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-01-01 23:57:54,901 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:57:54,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:57:54,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:57:54,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:57:54,903 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:57:54,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:54,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:57:54,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:57:54,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-01 23:57:54,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:57:54,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:57:54,932 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:54,948 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:54,961 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:54,966 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:54,981 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:54,985 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:54,990 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:54,993 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:54,996 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:55,000 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:55,010 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:55,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:55,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:55,018 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:55,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:55,032 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:55,038 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:55,047 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:55,050 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:55,058 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:55,061 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:55,067 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:55,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:55,077 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:55,084 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:55,089 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:55,098 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:55,104 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:55,108 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:55,117 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:55,123 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:55,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:57:55,471 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:55,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:55,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,501 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:55,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,531 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:55,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,561 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:55,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,618 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:55,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,636 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:55,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:55,708 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,709 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) [2019-01-01 23:57:55,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,751 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:55,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,765 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:55,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:55,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,799 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) [2019-01-01 23:57:55,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,843 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:55,860 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,860 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) [2019-01-01 23:57:55,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,904 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:55,919 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,920 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:55,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:55,958 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:55,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:55,979 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:56,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,010 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,023 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:56,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,053 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,053 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:56,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,084 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:56,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,130 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) [2019-01-01 23:57:56,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,177 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:56,192 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,192 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:56,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,221 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:56,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,250 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:56,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,282 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,283 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:56,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,313 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:57:56,313 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:56,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:57:56,340 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:56,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:57:56,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:57:56,421 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:57:56,424 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:57:56,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:57:56,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:57:56,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:57:56,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:57:56,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:57:56,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:57:56,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:57:56,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-01 23:57:56,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:57:56,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:57:56,429 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:56,456 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:56,462 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:56,469 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:56,479 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:56,493 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:56,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:56,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:56,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:56,515 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:56,521 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:56,525 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:56,536 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:56,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:56,546 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:56,548 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:56,577 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:56,607 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:56,646 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:56,738 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:56,778 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:56,820 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:56,863 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:56,952 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:56,992 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:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:57:57,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:57,102 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:57,112 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:57,114 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:57,120 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:57,505 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:57:57,694 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:57:58,104 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:57:58,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:57:58,218 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:57:58,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,320 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,321 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,394 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,395 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,403 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,404 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,444 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,448 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,457 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,463 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:57:58,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:57:58,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,564 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 23:57:58,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,568 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,576 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,576 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,584 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,602 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,604 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,610 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,621 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:58,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,634 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,638 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,639 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,643 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,644 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,648 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,648 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,666 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,667 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,677 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:58,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,704 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:58,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,722 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,736 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,741 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:58,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,748 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:58,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,760 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,773 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,814 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,825 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:58,831 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:58,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,833 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 23:57:58,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,875 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,876 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,884 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,898 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:58,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,910 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,924 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,933 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,943 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,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:58,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:58,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:58,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:58,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:58,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:58,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:58,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:58,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:58,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:58,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:58,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:58,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,001 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,001 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,002 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:59,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,050 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,051 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:59,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,061 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,062 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:57:59,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,094 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,100 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,105 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,113 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:57:59,138 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:57:59,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,146 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 23:57:59,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:59,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,148 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,152 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,159 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,175 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,180 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,191 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,194 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,209 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,241 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,244 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,251 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,257 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,262 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,262 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,263 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:59,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,291 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,413 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,427 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,427 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,435 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,441 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,441 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,454 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,454 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,465 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,465 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,475 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,475 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,486 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:59,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,497 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,498 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:59,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,517 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,521 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,528 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,528 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,535 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,535 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,536 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:59,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,545 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,546 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,546 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:57:59,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,561 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,561 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,584 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,585 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,601 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,603 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,609 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,610 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,613 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,614 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,626 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:57:59,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:57:59,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:57:59,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,650 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 23:57:59,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,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:59,652 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,652 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,683 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,684 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,684 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,685 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,703 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,703 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,704 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,712 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,713 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,738 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,739 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,781 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,789 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,790 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,836 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,838 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,843 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:57:59,844 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:57:59,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,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:59,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,853 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,854 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,928 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,982 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,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:59,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,987 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,991 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:57:59,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:57:59,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:57:59,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:57:59,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:57:59,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:57:59,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:57:59,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:57:59,995 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:57:59,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:57:59,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,045 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,049 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,049 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,049 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,050 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:00,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,076 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:00,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,120 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,131 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,131 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,148 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,148 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:00,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,170 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:00,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,199 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,200 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,201 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,220 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,220 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,221 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,257 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,258 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,286 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,300 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,302 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,308 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,350 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,351 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,352 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,355 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,356 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,359 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:00,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 23:58:00,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 23:58:00,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,383 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 23:58:00,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:58:00,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,439 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,449 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,450 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,455 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,480 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,487 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,519 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,529 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,530 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,564 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,566 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,598 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,605 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,617 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,621 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:00,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,669 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,678 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,678 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,690 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,740 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,750 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,755 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,760 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,760 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,804 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,811 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,824 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,825 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:00,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,873 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,875 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:00,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,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:58:00,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,903 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,918 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,951 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,952 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,952 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,953 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:00,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,963 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,965 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:00,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,966 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:00,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:00,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:00,984 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:00,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:00,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:00,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:00,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:00,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:00,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:00,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:00,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,033 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,033 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,034 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,043 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,049 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,120 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,122 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,131 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,135 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,153 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,154 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,209 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 23:58:01,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:01,211 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:01,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,214 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 23:58:01,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,218 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,219 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,237 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,305 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,315 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,325 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,328 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,330 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,393 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,395 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,401 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,407 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,408 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,418 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,423 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,476 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,476 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,477 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:01,477 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,479 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:58:01,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,515 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,519 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,559 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,559 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,561 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,570 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,581 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,582 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,583 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,618 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,622 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,622 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,623 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,628 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,629 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,681 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:01,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,684 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:58:01,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,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:58:01,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,713 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,713 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:01,713 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,717 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:58:01,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,761 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,781 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,794 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:01,794 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,798 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:58:01,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,826 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,831 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:01,831 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,833 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 23:58:01,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,862 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,868 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,890 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,912 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,916 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,968 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:01,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:01,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:01,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:01,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:01,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:01,990 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:01,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:01,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:01,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:01,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:02,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:02,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,008 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,009 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:02,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:02,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:02,033 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:02,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 23:58:02,058 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 23:58:02,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,063 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 23:58:02,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,067 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,071 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,079 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,112 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,128 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,153 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,157 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,158 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,167 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,217 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,219 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,224 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:02,229 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:02,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,240 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,297 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,297 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,298 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,299 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,304 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,305 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,309 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,320 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,325 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,389 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,396 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,401 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,416 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,466 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,467 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,472 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,473 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:02,473 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,473 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:02,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,479 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,480 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:02,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:02,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,543 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,553 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,565 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:02,566 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:02,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,640 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:02,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,642 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:58:02,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,678 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,728 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,748 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,752 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,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:58:02,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,811 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,831 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 23:58:02,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 23:58:02,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:58:02,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,843 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 23:58:02,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,904 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:02,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:02,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:02,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:02,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,936 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:02,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:02,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:02,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:02,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:02,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:02,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:02,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:02,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:02,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:02,996 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:02,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:02,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,016 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,057 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,096 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,096 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,113 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:03,130 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,133 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:58:03,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,197 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,199 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,209 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,231 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,295 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,296 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,315 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,326 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,326 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,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:58:03,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,390 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,390 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,400 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,400 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,401 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,413 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:03,413 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,419 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:58:03,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,485 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:03,486 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,488 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:58:03,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,525 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,525 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,545 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,545 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,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:58:03,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,577 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:03,577 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,578 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:58:03,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,595 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:58:03,595 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,596 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:58:03,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,617 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,678 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,690 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,693 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,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:58:03,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,747 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,747 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,765 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,766 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,789 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,790 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,797 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,798 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:58:03,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 23:58:03,836 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 23:58:03,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:58:03,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:58:03,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:58:03,836 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 23:58:03,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:58:03,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:58:03,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:58:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:03,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:03,848 INFO L87 Difference]: Start difference. First operand 1059 states and 1421 transitions. cyclomatic complexity: 363 Second operand 3 states. [2019-01-01 23:58:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:04,353 INFO L93 Difference]: Finished difference Result 1059 states and 1405 transitions. [2019-01-01 23:58:04,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:04,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1059 states and 1405 transitions. [2019-01-01 23:58:04,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2019-01-01 23:58:04,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1059 states to 1059 states and 1405 transitions. [2019-01-01 23:58:04,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1059 [2019-01-01 23:58:04,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1059 [2019-01-01 23:58:04,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1059 states and 1405 transitions. [2019-01-01 23:58:04,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:04,410 INFO L705 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2019-01-01 23:58:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states and 1405 transitions. [2019-01-01 23:58:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2019-01-01 23:58:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-01-01 23:58:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1405 transitions. [2019-01-01 23:58:04,475 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2019-01-01 23:58:04,475 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2019-01-01 23:58:04,476 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:58:04,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1405 transitions. [2019-01-01 23:58:04,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2019-01-01 23:58:04,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:04,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:04,494 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:58:04,500 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:58:04,501 INFO L794 eck$LassoCheckResult]: Stem: 16652#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 16508#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;~clk~0 := 0;~max_loop~0 := 8;~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; 16509#L603 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; 16521#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 16522#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16609#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 16653#L305-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; 16620#L108 assume !(1 == ~P_1_pc~0); 16546#L108-2 is_P_1_triggered_~__retres1~0 := 0; 16614#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 16696#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 16678#L481 assume !(0 != activate_threads_~tmp~1); 16679#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 16646#L176 assume !(1 == ~P_2_pc~0); 16647#L176-2 is_P_2_triggered_~__retres1~1 := 0; 16648#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 16582#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 16583#L489 assume !(0 != activate_threads_~tmp___0~1); 16684#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 16691#L258 assume !(1 == ~C_1_pc~0); 16687#L258-2 assume !(2 == ~C_1_pc~0); 16592#L268-1 is_C_1_triggered_~__retres1~2 := 0; 16593#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 16597#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 16542#L497 assume !(0 != activate_threads_~tmp___1~1); 16543#L551-1 [2019-01-01 23:58:04,501 INFO L796 eck$LassoCheckResult]: Loop: 16543#L551-1 assume !false; 17152#L552 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; 17148#L387 assume !false; 17146#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17144#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17142#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17140#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17138#L352 assume 0 != eval_~tmp___2~0; 17137#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 16615#L361 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 16616#L73 assume 0 == ~P_1_pc~0; 17403#L77 assume !(~i~0 < ~max_loop~0); 17402#L96 ~P_1_st~0 := 2; 17394#L357 assume !(0 == ~P_2_st~0); 17392#L372 assume !(0 == ~C_1_st~0); 17391#L387 assume !false; 17420#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17418#L318 assume !(0 == ~P_1_st~0); 17416#L322 assume !(0 == ~P_2_st~0); 16565#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 16566#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17412#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17408#L352 assume !(0 != eval_~tmp___2~0); 17409#L403 start_simulation_~kernel_st~0 := 2; 17446#L288-1 start_simulation_~kernel_st~0 := 3; 17444#L414 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; 17441#L108-6 assume 1 == ~P_1_pc~0; 17438#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 17434#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17430#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17426#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17423#L481-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17323#L176-6 assume !(1 == ~P_2_pc~0); 17322#L176-8 is_P_2_triggered_~__retres1~1 := 0; 17321#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17318#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17315#L489-6 assume !(0 != activate_threads_~tmp___0~1); 17311#L489-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17302#L258-6 assume !(1 == ~C_1_pc~0); 17288#L258-8 assume !(2 == ~C_1_pc~0); 17285#L268-5 is_C_1_triggered_~__retres1~2 := 0; 17283#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17281#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17279#L497-6 assume !(0 != activate_threads_~tmp___1~1); 17275#L497-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17271#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17267#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17261#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17168#L570 assume !(0 == start_simulation_~tmp~3); 17167#L570-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; 17166#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17165#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17164#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 17162#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17160#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 17159#L533 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17155#L583 assume !(0 != start_simulation_~tmp___0~2); 16543#L551-1 [2019-01-01 23:58:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2019-01-01 23:58:04,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:04,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:04,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1599561696, now seen corresponding path program 1 times [2019-01-01 23:58:04,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:04,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:04,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:04,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:04,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:04,762 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:58:04,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:04,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:04,764 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:58:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:04,767 INFO L87 Difference]: Start difference. First operand 1059 states and 1405 transitions. cyclomatic complexity: 347 Second operand 3 states. [2019-01-01 23:58:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:05,380 INFO L93 Difference]: Finished difference Result 1763 states and 2324 transitions. [2019-01-01 23:58:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:05,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2324 transitions. [2019-01-01 23:58:05,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1728 [2019-01-01 23:58:05,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1763 states and 2324 transitions. [2019-01-01 23:58:05,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1763 [2019-01-01 23:58:05,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1763 [2019-01-01 23:58:05,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1763 states and 2324 transitions. [2019-01-01 23:58:05,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:05,439 INFO L705 BuchiCegarLoop]: Abstraction has 1763 states and 2324 transitions. [2019-01-01 23:58:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states and 2324 transitions. [2019-01-01 23:58:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1747. [2019-01-01 23:58:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-01-01 23:58:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2304 transitions. [2019-01-01 23:58:05,498 INFO L728 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2019-01-01 23:58:05,498 INFO L608 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2019-01-01 23:58:05,499 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 23:58:05,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1747 states and 2304 transitions. [2019-01-01 23:58:05,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1712 [2019-01-01 23:58:05,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:05,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:05,517 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:05,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:05,523 INFO L794 eck$LassoCheckResult]: Stem: 19483#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 19335#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;~clk~0 := 0;~max_loop~0 := 8;~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; 19336#L603 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; 19348#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 19349#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 19439#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 19484#L305-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; 19452#L108 assume !(1 == ~P_1_pc~0); 19446#L108-2 is_P_1_triggered_~__retres1~0 := 0; 19447#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19373#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 19374#L481 assume !(0 != activate_threads_~tmp~1); 19515#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 19478#L176 assume !(1 == ~P_2_pc~0); 19479#L176-2 is_P_2_triggered_~__retres1~1 := 0; 19480#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 19411#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 19412#L489 assume !(0 != activate_threads_~tmp___0~1); 19520#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 19531#L258 assume !(1 == ~C_1_pc~0); 19524#L258-2 assume !(2 == ~C_1_pc~0); 19420#L268-1 is_C_1_triggered_~__retres1~2 := 0; 19421#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 19427#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 19371#L497 assume !(0 != activate_threads_~tmp___1~1); 19372#L551-1 assume !false; 21026#L552 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; 19444#L387 [2019-01-01 23:58:05,523 INFO L796 eck$LassoCheckResult]: Loop: 19444#L387 assume !false; 21025#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21024#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21023#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21022#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 19496#L352 assume 0 != eval_~tmp___2~0; 19497#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 19448#L361 assume !(0 != eval_~tmp~0); 19450#L357 assume !(0 == ~P_2_st~0); 19325#L372 assume !(0 == ~C_1_st~0); 19444#L387 [2019-01-01 23:58:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2019-01-01 23:58:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:05,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:05,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2019-01-01 23:58:05,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:05,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2019-01-01 23:58:05,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:05,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:05,682 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:05,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:06,176 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 23:58:06,399 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:58:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:06,418 INFO L87 Difference]: Start difference. First operand 1747 states and 2304 transitions. cyclomatic complexity: 560 Second operand 3 states. [2019-01-01 23:58:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:06,896 INFO L93 Difference]: Finished difference Result 2796 states and 3646 transitions. [2019-01-01 23:58:06,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:06,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2796 states and 3646 transitions. [2019-01-01 23:58:06,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2731 [2019-01-01 23:58:06,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2796 states to 2796 states and 3646 transitions. [2019-01-01 23:58:06,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2796 [2019-01-01 23:58:06,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2796 [2019-01-01 23:58:06,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2796 states and 3646 transitions. [2019-01-01 23:58:06,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:06,973 INFO L705 BuchiCegarLoop]: Abstraction has 2796 states and 3646 transitions. [2019-01-01 23:58:06,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states and 3646 transitions. [2019-01-01 23:58:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2704. [2019-01-01 23:58:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2019-01-01 23:58:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3534 transitions. [2019-01-01 23:58:07,042 INFO L728 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2019-01-01 23:58:07,042 INFO L608 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2019-01-01 23:58:07,042 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 23:58:07,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 3534 transitions. [2019-01-01 23:58:07,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2019-01-01 23:58:07,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:07,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:07,064 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:07,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:07,065 INFO L794 eck$LassoCheckResult]: Stem: 24042#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 23886#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;~clk~0 := 0;~max_loop~0 := 8;~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; 23887#L603 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; 23899#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 23900#L295-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 23990#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 26133#L305-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; 26132#L108 assume !(1 == ~P_1_pc~0); 26130#L108-2 is_P_1_triggered_~__retres1~0 := 0; 26128#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 26126#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 26125#L481 assume !(0 != activate_threads_~tmp~1); 26123#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 26121#L176 assume !(1 == ~P_2_pc~0); 26119#L176-2 is_P_2_triggered_~__retres1~1 := 0; 26117#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 26115#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 26113#L489 assume !(0 != activate_threads_~tmp___0~1); 26111#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 26109#L258 assume !(1 == ~C_1_pc~0); 26107#L258-2 assume !(2 == ~C_1_pc~0); 26105#L268-1 is_C_1_triggered_~__retres1~2 := 0; 26103#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 26101#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 26099#L497 assume !(0 != activate_threads_~tmp___1~1); 26097#L551-1 assume !false; 26093#L552 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; 26091#L387 [2019-01-01 23:58:07,065 INFO L796 eck$LassoCheckResult]: Loop: 26091#L387 assume !false; 26090#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 26089#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 26087#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 26085#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 26083#L352 assume 0 != eval_~tmp___2~0; 26082#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 26079#L361 assume !(0 != eval_~tmp~0); 26080#L357 assume !(0 == ~P_2_st~0); 23929#L372 assume !(0 == ~C_1_st~0); 26091#L387 [2019-01-01 23:58:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2019-01-01 23:58:07,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:07,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:07,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:07,147 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:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:07,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:58:07,148 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:58:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2019-01-01 23:58:07,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:07,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,322 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 23:58:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:07,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:07,341 INFO L87 Difference]: Start difference. First operand 2704 states and 3534 transitions. cyclomatic complexity: 833 Second operand 3 states. [2019-01-01 23:58:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:07,359 INFO L93 Difference]: Finished difference Result 2682 states and 3511 transitions. [2019-01-01 23:58:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:07,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2682 states and 3511 transitions. [2019-01-01 23:58:07,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2019-01-01 23:58:07,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2682 states to 2682 states and 3511 transitions. [2019-01-01 23:58:07,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2682 [2019-01-01 23:58:07,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2682 [2019-01-01 23:58:07,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2682 states and 3511 transitions. [2019-01-01 23:58:07,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:07,412 INFO L705 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2019-01-01 23:58:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states and 3511 transitions. [2019-01-01 23:58:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682. [2019-01-01 23:58:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-01-01 23:58:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3511 transitions. [2019-01-01 23:58:07,480 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2019-01-01 23:58:07,480 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2019-01-01 23:58:07,480 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 23:58:07,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3511 transitions. [2019-01-01 23:58:07,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2019-01-01 23:58:07,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:07,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:07,505 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:07,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:07,505 INFO L794 eck$LassoCheckResult]: Stem: 29437#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 29278#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;~clk~0 := 0;~max_loop~0 := 8;~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; 29279#L603 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; 29293#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 29294#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 29384#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 29438#L305-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; 29398#L108 assume !(1 == ~P_1_pc~0); 29395#L108-2 is_P_1_triggered_~__retres1~0 := 0; 29396#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 29316#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 29317#L481 assume !(0 != activate_threads_~tmp~1); 29469#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 29427#L176 assume !(1 == ~P_2_pc~0); 29428#L176-2 is_P_2_triggered_~__retres1~1 := 0; 29429#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 29355#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 29356#L489 assume !(0 != activate_threads_~tmp___0~1); 29475#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 29483#L258 assume !(1 == ~C_1_pc~0); 29478#L258-2 assume !(2 == ~C_1_pc~0); 29366#L268-1 is_C_1_triggered_~__retres1~2 := 0; 29367#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 29371#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 29314#L497 assume !(0 != activate_threads_~tmp___1~1); 29315#L551-1 assume !false; 31076#L552 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; 31073#L387 [2019-01-01 23:58:07,505 INFO L796 eck$LassoCheckResult]: Loop: 31073#L387 assume !false; 31071#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 31069#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 31068#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 31067#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 31066#L352 assume 0 != eval_~tmp___2~0; 31065#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 31064#L361 assume !(0 != eval_~tmp~0); 29487#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 29266#L376 assume !(0 != eval_~tmp___0~0); 29268#L372 assume !(0 == ~C_1_st~0); 31073#L387 [2019-01-01 23:58:07,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2019-01-01 23:58:07,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2019-01-01 23:58:07,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:07,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:07,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2019-01-01 23:58:07,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:07,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:07,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:07,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:58:07,648 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:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:58:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:58:08,131 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-01 23:58:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:58:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:58:08,153 INFO L87 Difference]: Start difference. First operand 2682 states and 3511 transitions. cyclomatic complexity: 832 Second operand 3 states. [2019-01-01 23:58:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:58:08,199 INFO L93 Difference]: Finished difference Result 4410 states and 5717 transitions. [2019-01-01 23:58:08,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:58:08,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4410 states and 5717 transitions. [2019-01-01 23:58:08,228 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2019-01-01 23:58:08,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4410 states to 4410 states and 5717 transitions. [2019-01-01 23:58:08,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4410 [2019-01-01 23:58:08,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4410 [2019-01-01 23:58:08,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4410 states and 5717 transitions. [2019-01-01 23:58:08,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:58:08,282 INFO L705 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2019-01-01 23:58:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states and 5717 transitions. [2019-01-01 23:58:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2019-01-01 23:58:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2019-01-01 23:58:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 5717 transitions. [2019-01-01 23:58:08,383 INFO L728 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2019-01-01 23:58:08,384 INFO L608 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2019-01-01 23:58:08,384 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 23:58:08,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4410 states and 5717 transitions. [2019-01-01 23:58:08,415 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2019-01-01 23:58:08,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:58:08,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:58:08,416 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:08,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:58:08,416 INFO L794 eck$LassoCheckResult]: Stem: 36536#ULTIMATE.startENTRY ~max_loop~0 := 0;~clk~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; 36380#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;~clk~0 := 0;~max_loop~0 := 8;~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; 36381#L603 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; 36393#L288 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 36394#L295-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 36485#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 36537#L305-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; 36497#L108 assume !(1 == ~P_1_pc~0); 36494#L108-2 is_P_1_triggered_~__retres1~0 := 0; 36495#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 36416#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 36417#L481 assume !(0 != activate_threads_~tmp~1); 36574#L481-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 36527#L176 assume !(1 == ~P_2_pc~0); 36528#L176-2 is_P_2_triggered_~__retres1~1 := 0; 36529#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 36455#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 36456#L489 assume !(0 != activate_threads_~tmp___0~1); 36583#L489-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 36590#L258 assume !(1 == ~C_1_pc~0); 36585#L258-2 assume !(2 == ~C_1_pc~0); 36467#L268-1 is_C_1_triggered_~__retres1~2 := 0; 36468#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 36473#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 36414#L497 assume !(0 != activate_threads_~tmp___1~1); 36415#L551-1 assume !false; 37534#L552 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; 37533#L387 [2019-01-01 23:58:08,416 INFO L796 eck$LassoCheckResult]: Loop: 37533#L387 assume !false; 37532#L348 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 37530#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 37528#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 37526#L336 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 37524#L352 assume 0 != eval_~tmp___2~0; 37522#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 37519#L361 assume !(0 != eval_~tmp~0); 37520#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 39118#L376 assume !(0 != eval_~tmp___0~0); 37538#L372 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 37535#L391 assume !(0 != eval_~tmp___1~0); 37533#L387 [2019-01-01 23:58:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2019-01-01 23:58:08,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:08,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2019-01-01 23:58:08,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:08,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:58:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:58:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2019-01-01 23:58:08,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:58:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:58:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:58:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:58:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:58:08,780 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-01 23:58:09,278 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-01-01 23:58:09,496 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-01 23:58:09,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:58:09 BoogieIcfgContainer [2019-01-01 23:58:09,543 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:58:09,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:58:09,544 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:58:09,544 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:58:09,545 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:47" (3/4) ... [2019-01-01 23:58:09,551 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:58:09,664 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:58:09,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:58:09,666 INFO L168 Benchmark]: Toolchain (without parser) took 24643.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.5 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -60.8 MB). Peak memory consumption was 230.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:09,667 INFO L168 Benchmark]: CDTParser took 0.24 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:09,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.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:09,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.89 ms. Allocated memory is still 1.0 GB. Free memory was 927.2 MB in the beginning and 921.8 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:09,668 INFO L168 Benchmark]: Boogie Preprocessor took 201.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:09,669 INFO L168 Benchmark]: RCFGBuilder took 1584.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:09,669 INFO L168 Benchmark]: BuchiAutomizer took 21929.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 228.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:58:09,670 INFO L168 Benchmark]: Witness Printer took 120.70 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:09,673 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.24 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 674.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.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 124.89 ms. Allocated memory is still 1.0 GB. Free memory was 927.2 MB in the beginning and 921.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 201.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 921.8 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1584.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21929.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 228.6 MB. Max. memory is 11.5 GB. * Witness Printer took 120.70 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 4410 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.8s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 15.2s. Construction of modules took 3.7s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 3992 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 4410 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3601 SDtfs, 4398 SDslu, 4843 SDs, 0 SdLazy, 314 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s 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: 23ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 347]: 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@5a7cc92c=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bdca8d4=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ea0e052=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54d37ba0=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, clk=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@2cd71615=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4edfa64a=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1af48d17=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bcf5e21=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11d4ff3a=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 347]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] C_1_i = 1 [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] C_1_st = 0 [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] return (__retres1); [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] return (__retres1); [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] return (__retres1); [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE !(\read(tmp___1)) [L551] COND TRUE 1 [L554] kernel_st = 1 [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; Loop: [L347] COND TRUE 1 [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] return (__retres1); [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...