./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer --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.23-635dfa2 [2018-12-02 14:13:10,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:13:10,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:13:10,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:13:10,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:13:10,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:13:10,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:13:10,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:13:10,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:13:10,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:13:10,403 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:13:10,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:13:10,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:13:10,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:13:10,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:13:10,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:13:10,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:13:10,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:13:10,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:13:10,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:13:10,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:13:10,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:13:10,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:13:10,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:13:10,410 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:13:10,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:13:10,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:13:10,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:13:10,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:13:10,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:13:10,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:13:10,412 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:13:10,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:13:10,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:13:10,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:13:10,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:13:10,414 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 14:13:10,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:13:10,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:13:10,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:13:10,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:13:10,422 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:13:10,423 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 14:13:10,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:13:10,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 14:13:10,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:13:10,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:13:10,425 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 14:13:10,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:13:10,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:13:10,425 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 14:13:10,425 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 14:13:10,426 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer 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 [2018-12-02 14:13:10,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:13:10,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:13:10,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:13:10,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:13:10,453 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:13:10,453 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-12-02 14:13:10,489 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/data/3f8bd4c9e/0e3218ce371441168b55b898b2def932/FLAGef2e29441 [2018-12-02 14:13:10,797 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:13:10,798 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-12-02 14:13:10,803 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/data/3f8bd4c9e/0e3218ce371441168b55b898b2def932/FLAGef2e29441 [2018-12-02 14:13:10,812 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/data/3f8bd4c9e/0e3218ce371441168b55b898b2def932 [2018-12-02 14:13:10,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:13:10,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:13:10,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:13:10,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:13:10,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:13:10,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:13:10" (1/1) ... [2018-12-02 14:13:10,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8209d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:10, skipping insertion in model container [2018-12-02 14:13:10,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:13:10" (1/1) ... [2018-12-02 14:13:10,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:13:10,851 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:13:10,968 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:13:10,971 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:13:10,996 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:13:11,006 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:13:11,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11 WrapperNode [2018-12-02 14:13:11,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:13:11,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:13:11,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:13:11,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:13:11,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:13:11,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:13:11,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:13:11,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:13:11,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... [2018-12-02 14:13:11,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:13:11,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:13:11,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:13:11,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:13:11,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:11,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:13:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:13:11,423 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:13:11,423 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-12-02 14:13:11,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:11 BoogieIcfgContainer [2018-12-02 14:13:11,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:13:11,424 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 14:13:11,424 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 14:13:11,426 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 14:13:11,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:13:11,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 02:13:10" (1/3) ... [2018-12-02 14:13:11,427 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7d60b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:13:11, skipping insertion in model container [2018-12-02 14:13:11,427 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:13:11,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:13:11" (2/3) ... [2018-12-02 14:13:11,428 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d7d60b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 02:13:11, skipping insertion in model container [2018-12-02 14:13:11,428 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 14:13:11,428 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:11" (3/3) ... [2018-12-02 14:13:11,429 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2018-12-02 14:13:11,462 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:13:11,462 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 14:13:11,462 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 14:13:11,462 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 14:13:11,462 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:13:11,462 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:13:11,463 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 14:13:11,463 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:13:11,463 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 14:13:11,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-12-02 14:13:11,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-12-02 14:13:11,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,497 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] [2018-12-02 14:13:11,497 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] [2018-12-02 14:13:11,497 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 14:13:11,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-12-02 14:13:11,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-12-02 14:13:11,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,502 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] [2018-12-02 14:13:11,502 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] [2018-12-02 14:13:11,507 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 [2018-12-02 14:13:11,507 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 [2018-12-02 14:13:11,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-12-02 14:13:11,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:11,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:13:11,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 369732879, now seen corresponding path program 1 times [2018-12-02 14:13:11,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:13:11,611 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:11,621 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2018-12-02 14:13:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:11,640 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2018-12-02 14:13:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:11,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2018-12-02 14:13:11,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-12-02 14:13:11,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2018-12-02 14:13:11,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-12-02 14:13:11,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-12-02 14:13:11,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2018-12-02 14:13:11,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:11,649 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-12-02 14:13:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2018-12-02 14:13:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-02 14:13:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-02 14:13:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2018-12-02 14:13:11,670 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-12-02 14:13:11,670 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-12-02 14:13:11,670 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 14:13:11,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2018-12-02 14:13:11,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-12-02 14:13:11,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,672 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] [2018-12-02 14:13:11,672 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] [2018-12-02 14:13:11,673 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 [2018-12-02 14:13:11,673 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 [2018-12-02 14:13:11,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-12-02 14:13:11,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:11,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:13:11,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 1 times [2018-12-02 14:13:11,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:11,733 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:11,733 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-12-02 14:13:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:11,740 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2018-12-02 14:13:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:11,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2018-12-02 14:13:11,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-12-02 14:13:11,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2018-12-02 14:13:11,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-12-02 14:13:11,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-12-02 14:13:11,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2018-12-02 14:13:11,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:11,744 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-12-02 14:13:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2018-12-02 14:13:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-02 14:13:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-02 14:13:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2018-12-02 14:13:11,748 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-12-02 14:13:11,748 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-12-02 14:13:11,748 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 14:13:11,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2018-12-02 14:13:11,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-12-02 14:13:11,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,750 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] [2018-12-02 14:13:11,750 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] [2018-12-02 14:13:11,750 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 [2018-12-02 14:13:11,750 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 [2018-12-02 14:13:11,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,751 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-12-02 14:13:11,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:11,771 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:13:11,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 2 times [2018-12-02 14:13:11,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:11,794 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:11,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:11,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:11,794 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-12-02 14:13:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:11,819 INFO L93 Difference]: Finished difference Result 303 states and 446 transitions. [2018-12-02 14:13:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:11,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 446 transitions. [2018-12-02 14:13:11,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 275 [2018-12-02 14:13:11,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 446 transitions. [2018-12-02 14:13:11,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2018-12-02 14:13:11,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2018-12-02 14:13:11,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 446 transitions. [2018-12-02 14:13:11,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:11,824 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 446 transitions. [2018-12-02 14:13:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 446 transitions. [2018-12-02 14:13:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2018-12-02 14:13:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-02 14:13:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2018-12-02 14:13:11,830 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-12-02 14:13:11,830 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-12-02 14:13:11,830 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 14:13:11,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 425 transitions. [2018-12-02 14:13:11,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260 [2018-12-02 14:13:11,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,832 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] [2018-12-02 14:13:11,832 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] [2018-12-02 14:13:11,832 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 [2018-12-02 14:13:11,833 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 [2018-12-02 14:13:11,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-12-02 14:13:11,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:11,849 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:13:11,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1301427912, now seen corresponding path program 1 times [2018-12-02 14:13:11,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:11,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:11,875 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. cyclomatic complexity: 138 Second operand 3 states. [2018-12-02 14:13:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:11,908 INFO L93 Difference]: Finished difference Result 536 states and 772 transitions. [2018-12-02 14:13:11,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:11,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 772 transitions. [2018-12-02 14:13:11,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 510 [2018-12-02 14:13:11,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 772 transitions. [2018-12-02 14:13:11,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2018-12-02 14:13:11,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2018-12-02 14:13:11,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 772 transitions. [2018-12-02 14:13:11,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:11,915 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 772 transitions. [2018-12-02 14:13:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 772 transitions. [2018-12-02 14:13:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 520. [2018-12-02 14:13:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-02 14:13:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 752 transitions. [2018-12-02 14:13:11,924 INFO L728 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-12-02 14:13:11,924 INFO L608 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-12-02 14:13:11,924 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 14:13:11,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 752 transitions. [2018-12-02 14:13:11,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 494 [2018-12-02 14:13:11,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:11,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:11,927 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] [2018-12-02 14:13:11,927 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] [2018-12-02 14:13:11,927 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 [2018-12-02 14:13:11,927 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 [2018-12-02 14:13:11,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-12-02 14:13:11,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:11,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1109961593, now seen corresponding path program 1 times [2018-12-02 14:13:11,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:11,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:11,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:11,969 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:11,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:13:11,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:13:11,970 INFO L87 Difference]: Start difference. First operand 520 states and 752 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-12-02 14:13:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:12,037 INFO L93 Difference]: Finished difference Result 916 states and 1314 transitions. [2018-12-02 14:13:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:13:12,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1314 transitions. [2018-12-02 14:13:12,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 890 [2018-12-02 14:13:12,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 916 states and 1314 transitions. [2018-12-02 14:13:12,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2018-12-02 14:13:12,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 916 [2018-12-02 14:13:12,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1314 transitions. [2018-12-02 14:13:12,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:12,045 INFO L705 BuchiCegarLoop]: Abstraction has 916 states and 1314 transitions. [2018-12-02 14:13:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1314 transitions. [2018-12-02 14:13:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 532. [2018-12-02 14:13:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-02 14:13:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2018-12-02 14:13:12,054 INFO L728 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-12-02 14:13:12,054 INFO L608 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-12-02 14:13:12,054 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 14:13:12,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 532 states and 764 transitions. [2018-12-02 14:13:12,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-12-02 14:13:12,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:12,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:12,056 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] [2018-12-02 14:13:12,056 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] [2018-12-02 14:13:12,057 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 [2018-12-02 14:13:12,057 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 [2018-12-02 14:13:12,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-12-02 14:13:12,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1255144909, now seen corresponding path program 1 times [2018-12-02 14:13:12,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:12,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:12,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:12,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:12,085 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. cyclomatic complexity: 233 Second operand 3 states. [2018-12-02 14:13:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:12,117 INFO L93 Difference]: Finished difference Result 930 states and 1312 transitions. [2018-12-02 14:13:12,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:12,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 1312 transitions. [2018-12-02 14:13:12,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-12-02 14:13:12,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 930 states and 1312 transitions. [2018-12-02 14:13:12,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2018-12-02 14:13:12,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 930 [2018-12-02 14:13:12,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 930 states and 1312 transitions. [2018-12-02 14:13:12,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:12,129 INFO L705 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-12-02 14:13:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states and 1312 transitions. [2018-12-02 14:13:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2018-12-02 14:13:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-12-02 14:13:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-12-02 14:13:12,138 INFO L728 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-12-02 14:13:12,139 INFO L608 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-12-02 14:13:12,139 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 14:13:12,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 930 states and 1312 transitions. [2018-12-02 14:13:12,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-12-02 14:13:12,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:12,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:12,142 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] [2018-12-02 14:13:12,142 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] [2018-12-02 14:13:12,142 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 [2018-12-02 14:13:12,143 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 [2018-12-02 14:13:12,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-12-02 14:13:12,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1406901968, now seen corresponding path program 1 times [2018-12-02 14:13:12,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:12,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:12,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:12,193 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:13:12,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:13:12,194 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. cyclomatic complexity: 383 Second operand 5 states. [2018-12-02 14:13:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:12,270 INFO L93 Difference]: Finished difference Result 2066 states and 2911 transitions. [2018-12-02 14:13:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:13:12,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 2911 transitions. [2018-12-02 14:13:12,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2040 [2018-12-02 14:13:12,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 2066 states and 2911 transitions. [2018-12-02 14:13:12,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2066 [2018-12-02 14:13:12,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2018-12-02 14:13:12,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2066 states and 2911 transitions. [2018-12-02 14:13:12,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:12,286 INFO L705 BuchiCegarLoop]: Abstraction has 2066 states and 2911 transitions. [2018-12-02 14:13:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states and 2911 transitions. [2018-12-02 14:13:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 966. [2018-12-02 14:13:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-02 14:13:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1339 transitions. [2018-12-02 14:13:12,301 INFO L728 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-12-02 14:13:12,301 INFO L608 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-12-02 14:13:12,301 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 14:13:12,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 966 states and 1339 transitions. [2018-12-02 14:13:12,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 940 [2018-12-02 14:13:12,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:12,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:12,304 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] [2018-12-02 14:13:12,304 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] [2018-12-02 14:13:12,304 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 [2018-12-02 14:13:12,304 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 [2018-12-02 14:13:12,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-12-02 14:13:12,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash -984200142, now seen corresponding path program 1 times [2018-12-02 14:13:12,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:12,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:12,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:13:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:13:12,347 INFO L87 Difference]: Start difference. First operand 966 states and 1339 transitions. cyclomatic complexity: 374 Second operand 5 states. [2018-12-02 14:13:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:12,422 INFO L93 Difference]: Finished difference Result 2040 states and 2832 transitions. [2018-12-02 14:13:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:13:12,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2040 states and 2832 transitions. [2018-12-02 14:13:12,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2014 [2018-12-02 14:13:12,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2040 states to 2040 states and 2832 transitions. [2018-12-02 14:13:12,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2040 [2018-12-02 14:13:12,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2040 [2018-12-02 14:13:12,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2040 states and 2832 transitions. [2018-12-02 14:13:12,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:12,434 INFO L705 BuchiCegarLoop]: Abstraction has 2040 states and 2832 transitions. [2018-12-02 14:13:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states and 2832 transitions. [2018-12-02 14:13:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 996. [2018-12-02 14:13:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2018-12-02 14:13:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1358 transitions. [2018-12-02 14:13:12,446 INFO L728 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-12-02 14:13:12,446 INFO L608 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-12-02 14:13:12,446 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 14:13:12,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 1358 transitions. [2018-12-02 14:13:12,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 970 [2018-12-02 14:13:12,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:12,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:12,448 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] [2018-12-02 14:13:12,448 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] [2018-12-02 14:13:12,449 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 [2018-12-02 14:13:12,449 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 [2018-12-02 14:13:12,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-12-02 14:13:12,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash 528178929, now seen corresponding path program 1 times [2018-12-02 14:13:12,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:12,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:12,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:13:12,490 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:13:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:13:12,490 INFO L87 Difference]: Start difference. First operand 996 states and 1358 transitions. cyclomatic complexity: 363 Second operand 5 states. [2018-12-02 14:13:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:12,553 INFO L93 Difference]: Finished difference Result 2384 states and 3231 transitions. [2018-12-02 14:13:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:13:12,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2384 states and 3231 transitions. [2018-12-02 14:13:12,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2329 [2018-12-02 14:13:12,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2384 states to 2384 states and 3231 transitions. [2018-12-02 14:13:12,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2384 [2018-12-02 14:13:12,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2384 [2018-12-02 14:13:12,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2384 states and 3231 transitions. [2018-12-02 14:13:12,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:12,567 INFO L705 BuchiCegarLoop]: Abstraction has 2384 states and 3231 transitions. [2018-12-02 14:13:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states and 3231 transitions. [2018-12-02 14:13:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1059. [2018-12-02 14:13:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-12-02 14:13:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1421 transitions. [2018-12-02 14:13:12,581 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-12-02 14:13:12,581 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-12-02 14:13:12,581 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 14:13:12,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1421 transitions. [2018-12-02 14:13:12,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-12-02 14:13:12,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:12,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:12,584 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] [2018-12-02 14:13:12,584 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] [2018-12-02 14:13:12,584 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 [2018-12-02 14:13:12,584 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 [2018-12-02 14:13:12,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-12-02 14:13:12,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1995317392, now seen corresponding path program 1 times [2018-12-02 14:13:12,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:12,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:12,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -237860646, now seen corresponding path program 1 times [2018-12-02 14:13:12,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:12,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:12,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:12,741 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-12-02 14:13:12,796 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:13:12,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:13:12,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:13:12,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:13:12,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 14:13:12,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:12,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:13:12,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:13:12,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-02 14:13:12,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:13:12,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:13:12,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:12,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:13:13,046 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,054 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,054 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,073 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,092 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,092 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,120 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,139 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,166 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,192 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,193 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,219 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,235 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,237 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,237 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,255 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,280 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,297 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,314 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,314 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,329 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,331 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,353 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,354 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,372 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,390 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,390 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 14:13:13,407 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 /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 14:13:13,422 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/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 [2018-12-02 14:13:13,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 14:13:13,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 14:13:13,471 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 14:13:13,474 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 14:13:13,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 14:13:13,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 14:13:13,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 14:13:13,474 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 14:13:13,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 14:13:13,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 14:13:13,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 14:13:13,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-12-02 14:13:13,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 14:13:13,474 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 14:13:13,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 14:13:13,699 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 14:13:13,704 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,750 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,752 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,760 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,762 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 14:13:13,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 14:13:13,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,784 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 14:13:13,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,785 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,787 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,790 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,792 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,792 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,794 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,800 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,802 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,802 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,804 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,804 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:13,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,806 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,807 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,808 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,810 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,810 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,813 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,817 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,817 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,819 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,822 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,823 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:13,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,826 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,826 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:13,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,832 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,832 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:13,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:13,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,839 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,842 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,844 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,844 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,848 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,848 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,850 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,851 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,853 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,853 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,855 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:13,858 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:13,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,858 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 14:13:13,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,859 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,865 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,870 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,875 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,881 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:13,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,887 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,900 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:13,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,902 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:13,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,910 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,911 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:13,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,912 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,913 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:13,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,918 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,928 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,932 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,932 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,935 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:13,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:13,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,936 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,937 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,946 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:13,983 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,983 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:13,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,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 [2018-12-02 14:13:13,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,986 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:13,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:13,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:13,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:13,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:13,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:13,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:13,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:13,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:13,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,000 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,002 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,003 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,005 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,007 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,007 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,017 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,019 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,022 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,031 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,031 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,032 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,037 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,039 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,049 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,051 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,053 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,056 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,056 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,066 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,070 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,073 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,073 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,082 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,082 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 14:13:14,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,087 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,087 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,088 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 14:13:14,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,099 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,102 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,102 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,103 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,109 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,109 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,119 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,120 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,120 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,131 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,132 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,132 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,139 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,139 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,140 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,142 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,142 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,142 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,144 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,144 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,144 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:14,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,161 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,162 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,165 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,177 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,178 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,180 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,180 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,181 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,183 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,194 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,194 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,195 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,199 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,199 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,199 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:14,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,215 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:14,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,221 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,221 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,221 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,224 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,233 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:14,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,238 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,238 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,239 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:14,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,243 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,243 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,243 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,250 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,251 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,251 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,253 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,254 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,260 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,272 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,273 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,275 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,275 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,277 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,278 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,278 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,292 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,292 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 14:13:14,293 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 14:13:14,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,294 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 14:13:14,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,294 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,297 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,297 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,298 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,298 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,311 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,312 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,315 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,317 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,320 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,322 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,332 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,332 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,333 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,336 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,336 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,337 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,340 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,340 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,351 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,353 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,358 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,358 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,359 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,362 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,362 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,372 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,378 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,379 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,383 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,394 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,397 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,399 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,400 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,414 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,414 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,420 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,422 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,430 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,474 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,475 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,477 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,477 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,477 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,478 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,481 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,481 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,484 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,484 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,484 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,488 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,490 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,491 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,495 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,498 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,501 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,503 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,503 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,505 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 14:13:14,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,507 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 14:13:14,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,507 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,507 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,522 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,522 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,523 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,526 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,526 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,527 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,528 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,528 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,529 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,529 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,551 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,564 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,564 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,565 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,566 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,566 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,567 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,571 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,585 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,585 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,586 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,587 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,588 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,588 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,590 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,590 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,590 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,606 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,607 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,609 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,610 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,610 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,610 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,629 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,629 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,631 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,631 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,632 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,637 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,637 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,638 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,651 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,652 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,657 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,658 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,676 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,677 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 14:13:14,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,681 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,682 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,682 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,686 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,698 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,698 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,699 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,707 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,710 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,711 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,712 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,723 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,724 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,726 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,729 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,729 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:14,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,729 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 14:13:14,730 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 14:13:14,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,730 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 14:13:14,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,753 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,754 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,772 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,772 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,775 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,775 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,801 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,821 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,846 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,849 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,852 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,870 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,871 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,874 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,877 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,877 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,877 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,897 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,898 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,903 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,927 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,928 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,931 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,932 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:14,932 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,932 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 14:13:14,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,936 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,952 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,952 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,956 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,962 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:14,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:14,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:14,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:14,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:14,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:14,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:14,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:14,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:14,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:14,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 [2018-12-02 14:13:14,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 14:13:15,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 14:13:15,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 14:13:15,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,014 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 14:13:15,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,014 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,015 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,018 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,039 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,040 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,043 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,049 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,070 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,074 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,078 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,100 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,100 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:15,100 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,101 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 14:13:15,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,105 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,109 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,129 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,134 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,138 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,160 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,160 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,164 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,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 [2018-12-02 14:13:15,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,167 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,168 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:15,190 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,190 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 14:13:15,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,194 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:15,194 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,195 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 14:13:15,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,203 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,203 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,207 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,221 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,222 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,225 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,226 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:15,226 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,226 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 14:13:15,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 14:13:15,230 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,231 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 14:13:15,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,251 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,252 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,257 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,257 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,261 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,285 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,289 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,289 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,294 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,294 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,297 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,318 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 14:13:15,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 14:13:15,321 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 14:13:15,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 14:13:15,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 14:13:15,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 14:13:15,322 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 14:13:15,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 14:13:15,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 14:13:15,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 14:13:15,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:15,325 INFO L87 Difference]: Start difference. First operand 1059 states and 1421 transitions. cyclomatic complexity: 363 Second operand 3 states. [2018-12-02 14:13:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:15,354 INFO L93 Difference]: Finished difference Result 1059 states and 1405 transitions. [2018-12-02 14:13:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:15,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1059 states and 1405 transitions. [2018-12-02 14:13:15,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-12-02 14:13:15,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-12-02 14:13:15,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1059 [2018-12-02 14:13:15,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1059 [2018-12-02 14:13:15,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1059 states and 1405 transitions. [2018-12-02 14:13:15,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:15,367 INFO L705 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-12-02 14:13:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states and 1405 transitions. [2018-12-02 14:13:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2018-12-02 14:13:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-12-02 14:13:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-12-02 14:13:15,381 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-12-02 14:13:15,381 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-12-02 14:13:15,381 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 14:13:15,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1405 transitions. [2018-12-02 14:13:15,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-12-02 14:13:15,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:15,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:15,386 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] [2018-12-02 14:13:15,386 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] [2018-12-02 14:13:15,386 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 [2018-12-02 14:13:15,386 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 [2018-12-02 14:13:15,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-12-02 14:13:15,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1599561696, now seen corresponding path program 1 times [2018-12-02 14:13:15,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:15,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:15,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:15,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 14:13:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:15,478 INFO L87 Difference]: Start difference. First operand 1059 states and 1405 transitions. cyclomatic complexity: 347 Second operand 3 states. [2018-12-02 14:13:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:15,506 INFO L93 Difference]: Finished difference Result 1763 states and 2324 transitions. [2018-12-02 14:13:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:15,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2324 transitions. [2018-12-02 14:13:15,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1728 [2018-12-02 14:13:15,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1763 states and 2324 transitions. [2018-12-02 14:13:15,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1763 [2018-12-02 14:13:15,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1763 [2018-12-02 14:13:15,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1763 states and 2324 transitions. [2018-12-02 14:13:15,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:15,524 INFO L705 BuchiCegarLoop]: Abstraction has 1763 states and 2324 transitions. [2018-12-02 14:13:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states and 2324 transitions. [2018-12-02 14:13:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1747. [2018-12-02 14:13:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2018-12-02 14:13:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2304 transitions. [2018-12-02 14:13:15,599 INFO L728 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-12-02 14:13:15,599 INFO L608 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-12-02 14:13:15,599 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 14:13:15,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1747 states and 2304 transitions. [2018-12-02 14:13:15,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1712 [2018-12-02 14:13:15,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:15,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:15,602 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] [2018-12-02 14:13:15,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:13:15,603 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 [2018-12-02 14:13:15,603 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 [2018-12-02 14:13:15,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-12-02 14:13:15,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-12-02 14:13:15,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-12-02 14:13:15,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:15,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:15,657 INFO L87 Difference]: Start difference. First operand 1747 states and 2304 transitions. cyclomatic complexity: 560 Second operand 3 states. [2018-12-02 14:13:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:15,678 INFO L93 Difference]: Finished difference Result 2796 states and 3646 transitions. [2018-12-02 14:13:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:15,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2796 states and 3646 transitions. [2018-12-02 14:13:15,685 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2731 [2018-12-02 14:13:15,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2796 states to 2796 states and 3646 transitions. [2018-12-02 14:13:15,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2796 [2018-12-02 14:13:15,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2796 [2018-12-02 14:13:15,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2796 states and 3646 transitions. [2018-12-02 14:13:15,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:15,694 INFO L705 BuchiCegarLoop]: Abstraction has 2796 states and 3646 transitions. [2018-12-02 14:13:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states and 3646 transitions. [2018-12-02 14:13:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2704. [2018-12-02 14:13:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-12-02 14:13:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3534 transitions. [2018-12-02 14:13:15,715 INFO L728 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-12-02 14:13:15,715 INFO L608 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-12-02 14:13:15,715 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 14:13:15,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 3534 transitions. [2018-12-02 14:13:15,720 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-12-02 14:13:15,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:15,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:15,720 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] [2018-12-02 14:13:15,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:13:15,721 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 [2018-12-02 14:13:15,721 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 [2018-12-02 14:13:15,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-12-02 14:13:15,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:15,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:13:15,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 14:13:15,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-12-02 14:13:15,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:15,757 INFO L87 Difference]: Start difference. First operand 2704 states and 3534 transitions. cyclomatic complexity: 833 Second operand 3 states. [2018-12-02 14:13:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:15,762 INFO L93 Difference]: Finished difference Result 2682 states and 3511 transitions. [2018-12-02 14:13:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:15,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2682 states and 3511 transitions. [2018-12-02 14:13:15,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-12-02 14:13:15,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-12-02 14:13:15,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2682 [2018-12-02 14:13:15,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2682 [2018-12-02 14:13:15,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2682 states and 3511 transitions. [2018-12-02 14:13:15,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:15,778 INFO L705 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-12-02 14:13:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states and 3511 transitions. [2018-12-02 14:13:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682. [2018-12-02 14:13:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-12-02 14:13:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-12-02 14:13:15,799 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-12-02 14:13:15,799 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-12-02 14:13:15,799 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 14:13:15,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3511 transitions. [2018-12-02 14:13:15,804 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-12-02 14:13:15,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:15,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:15,804 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] [2018-12-02 14:13:15,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:13:15,804 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 [2018-12-02 14:13:15,805 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 [2018-12-02 14:13:15,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-12-02 14:13:15,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:15,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-12-02 14:13:15,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-12-02 14:13:15,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:13:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:13:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:13:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:13:15,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:13:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:13:15,867 INFO L87 Difference]: Start difference. First operand 2682 states and 3511 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-12-02 14:13:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:13:15,888 INFO L93 Difference]: Finished difference Result 4410 states and 5717 transitions. [2018-12-02 14:13:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:13:15,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4410 states and 5717 transitions. [2018-12-02 14:13:15,898 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-12-02 14:13:15,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-12-02 14:13:15,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4410 [2018-12-02 14:13:15,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4410 [2018-12-02 14:13:15,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4410 states and 5717 transitions. [2018-12-02 14:13:15,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 14:13:15,912 INFO L705 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-12-02 14:13:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states and 5717 transitions. [2018-12-02 14:13:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2018-12-02 14:13:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-12-02 14:13:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-12-02 14:13:15,945 INFO L728 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-12-02 14:13:15,945 INFO L608 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-12-02 14:13:15,945 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 14:13:15,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4410 states and 5717 transitions. [2018-12-02 14:13:15,954 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-12-02 14:13:15,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 14:13:15,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 14:13:15,954 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] [2018-12-02 14:13:15,954 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:13:15,954 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 [2018-12-02 14:13:15,954 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 [2018-12-02 14:13:15,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-12-02 14:13:15,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-12-02 14:13:15,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:13:15,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:13:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-12-02 14:13:15,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:13:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:13:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:13:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:13:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:13:16,193 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-12-02 14:13:16,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 02:13:16 BoogieIcfgContainer [2018-12-02 14:13:16,262 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 14:13:16,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:13:16,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:13:16,263 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:13:16,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:13:11" (3/4) ... [2018-12-02 14:13:16,266 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 14:13:16,312 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f6c00e85-b360-4ca5-b7df-7300935e6245/bin-2019/uautomizer/witness.graphml [2018-12-02 14:13:16,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:13:16,313 INFO L168 Benchmark]: Toolchain (without parser) took 5497.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 953.3 MB in the beginning and 955.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,313 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:13:16,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 937.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,314 INFO L168 Benchmark]: Boogie Preprocessor took 23.00 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,314 INFO L168 Benchmark]: RCFGBuilder took 332.34 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.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,315 INFO L168 Benchmark]: BuchiAutomizer took 4838.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 962.6 MB in the end (delta: 100.8 MB). Peak memory consumption was 247.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,315 INFO L168 Benchmark]: Witness Printer took 49.22 ms. Allocated memory is still 1.3 GB. Free memory was 962.6 MB in the beginning and 955.1 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:13:16,317 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 937.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 60.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.00 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 332.34 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.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4838.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 146.8 MB). Free memory was 1.1 GB in the beginning and 962.6 MB in the end (delta: 100.8 MB). Peak memory consumption was 247.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.22 ms. Allocated memory is still 1.3 GB. Free memory was 962.6 MB in the beginning and 955.1 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. 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 4.7s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 3992 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s 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, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc3 concLT0 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 22ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - 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@4e15a814=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52450c75=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7779f2f4=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45d7869f=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@40336856=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@622bbdd1=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d290700=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3da29842=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@381fd193=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...