./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 375118f5e6b201fc35ff4858369e05c815397841 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:04:43,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:04:43,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:04:43,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:04:43,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:04:43,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:04:43,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:04:43,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:04:43,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:04:43,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:04:43,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:04:43,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:04:43,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:04:43,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:04:43,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:04:43,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:04:43,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:04:43,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:04:43,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:04:43,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:04:43,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:04:43,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:04:43,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:04:43,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:04:43,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:04:43,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:04:43,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:04:43,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:04:43,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:04:43,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:04:43,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:04:43,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:04:43,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:04:43,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:04:43,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:04:43,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:04:43,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:04:43,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:04:43,390 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:04:43,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:04:43,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:04:43,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:04:43,391 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:04:43,392 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:04:43,392 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:04:43,392 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:04:43,392 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:04:43,392 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:04:43,393 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:04:43,393 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:04:43,393 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:04:43,393 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:04:43,393 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:04:43,393 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:04:43,394 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:04:43,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:04:43,394 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:04:43,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:04:43,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:04:43,397 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:04:43,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:04:43,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:04:43,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:04:43,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:04:43,398 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:04:43,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:04:43,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:04:43,400 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:04:43,402 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:04:43,403 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375118f5e6b201fc35ff4858369e05c815397841 [2018-11-29 00:04:43,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:04:43,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:04:43,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:04:43,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:04:43,495 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:04:43,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:43,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c5b61d0/e16ddf531fd041bca08a58a81524fc0f/FLAGa81b46488 [2018-11-29 00:04:44,066 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:04:44,068 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:44,079 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c5b61d0/e16ddf531fd041bca08a58a81524fc0f/FLAGa81b46488 [2018-11-29 00:04:44,375 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0c5b61d0/e16ddf531fd041bca08a58a81524fc0f [2018-11-29 00:04:44,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:04:44,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:04:44,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:44,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:04:44,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:04:44,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef7e597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44, skipping insertion in model container [2018-11-29 00:04:44,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:04:44,454 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:04:44,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:44,769 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:04:44,840 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:44,861 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:04:44,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44 WrapperNode [2018-11-29 00:04:44,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:44,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:44,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:04:44,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:04:44,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:45,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:04:45,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:04:45,008 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:04:45,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:45,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:04:45,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:04:45,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:04:45,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:04:45,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:04:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:04:46,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:04:46,501 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-11-29 00:04:46,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:46 BoogieIcfgContainer [2018-11-29 00:04:46,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:04:46,503 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:04:46,503 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:04:46,507 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:04:46,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:46,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:04:44" (1/3) ... [2018-11-29 00:04:46,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de4eb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:46, skipping insertion in model container [2018-11-29 00:04:46,510 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:46,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (2/3) ... [2018-11-29 00:04:46,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de4eb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:46, skipping insertion in model container [2018-11-29 00:04:46,510 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:46,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:46" (3/3) ... [2018-11-29 00:04:46,513 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:46,576 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:04:46,577 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:04:46,577 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:04:46,577 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:04:46,578 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:04:46,578 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:04:46,578 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:04:46,578 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:04:46,578 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:04:46,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-11-29 00:04:46,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-29 00:04:46,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,653 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-11-29 00:04:46,653 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-11-29 00:04:46,653 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:04:46,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 177 states. [2018-11-29 00:04:46,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-29 00:04:46,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,668 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-11-29 00:04:46,668 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-11-29 00:04:46,679 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-11-29 00:04:46,680 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-11-29 00:04:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-11-29 00:04:46,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:46,892 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:46,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash 369732879, now seen corresponding path program 1 times [2018-11-29 00:04:46,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:46,927 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:46,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:46,953 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2018-11-29 00:04:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:47,006 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2018-11-29 00:04:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:47,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2018-11-29 00:04:47,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-29 00:04:47,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2018-11-29 00:04:47,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-29 00:04:47,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-29 00:04:47,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2018-11-29 00:04:47,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:47,029 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-29 00:04:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2018-11-29 00:04:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-29 00:04:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-29 00:04:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2018-11-29 00:04:47,075 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-29 00:04:47,075 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2018-11-29 00:04:47,075 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:04:47,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2018-11-29 00:04:47,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-29 00:04:47,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:47,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:47,081 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-11-29 00:04:47,082 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-11-29 00:04:47,083 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-11-29 00:04:47,083 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-11-29 00:04:47,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-11-29 00:04:47,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:47,178 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:47,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 1 times [2018-11-29 00:04:47,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:47,473 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:47,474 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-29 00:04:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:47,529 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2018-11-29 00:04:47,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:47,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2018-11-29 00:04:47,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-29 00:04:47,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2018-11-29 00:04:47,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2018-11-29 00:04:47,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2018-11-29 00:04:47,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2018-11-29 00:04:47,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:47,539 INFO L705 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-29 00:04:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2018-11-29 00:04:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-11-29 00:04:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-29 00:04:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2018-11-29 00:04:47,550 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-29 00:04:47,550 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2018-11-29 00:04:47,550 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:04:47,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2018-11-29 00:04:47,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-29 00:04:47,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:47,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:47,554 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-11-29 00:04:47,554 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-11-29 00:04:47,555 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-11-29 00:04:47,555 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-11-29 00:04:47,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-11-29 00:04:47,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:47,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:47,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144407, now seen corresponding path program 2 times [2018-11-29 00:04:47,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:47,753 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:47,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:47,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:47,754 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-29 00:04:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:47,893 INFO L93 Difference]: Finished difference Result 303 states and 446 transitions. [2018-11-29 00:04:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:47,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 446 transitions. [2018-11-29 00:04:47,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 275 [2018-11-29 00:04:47,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 303 states and 446 transitions. [2018-11-29 00:04:47,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 303 [2018-11-29 00:04:47,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2018-11-29 00:04:47,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 446 transitions. [2018-11-29 00:04:47,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:47,905 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 446 transitions. [2018-11-29 00:04:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 446 transitions. [2018-11-29 00:04:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2018-11-29 00:04:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-29 00:04:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2018-11-29 00:04:47,923 INFO L728 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-11-29 00:04:47,923 INFO L608 BuchiCegarLoop]: Abstraction has 288 states and 425 transitions. [2018-11-29 00:04:47,923 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:04:47,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 425 transitions. [2018-11-29 00:04:47,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 260 [2018-11-29 00:04:47,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:47,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:47,928 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-11-29 00:04:47,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:47,928 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-11-29 00:04:47,929 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-11-29 00:04:47,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-11-29 00:04:47,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:47,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:47,982 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:47,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1301427912, now seen corresponding path program 1 times [2018-11-29 00:04:47,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:48,071 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:48,074 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. cyclomatic complexity: 138 Second operand 3 states. [2018-11-29 00:04:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:48,543 INFO L93 Difference]: Finished difference Result 536 states and 772 transitions. [2018-11-29 00:04:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:48,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 772 transitions. [2018-11-29 00:04:48,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 510 [2018-11-29 00:04:48,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 772 transitions. [2018-11-29 00:04:48,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2018-11-29 00:04:48,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2018-11-29 00:04:48,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 772 transitions. [2018-11-29 00:04:48,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:48,572 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 772 transitions. [2018-11-29 00:04:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 772 transitions. [2018-11-29 00:04:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 520. [2018-11-29 00:04:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-29 00:04:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 752 transitions. [2018-11-29 00:04:48,616 INFO L728 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-11-29 00:04:48,616 INFO L608 BuchiCegarLoop]: Abstraction has 520 states and 752 transitions. [2018-11-29 00:04:48,616 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:04:48,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 752 transitions. [2018-11-29 00:04:48,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 494 [2018-11-29 00:04:48,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:48,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:48,622 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-11-29 00:04:48,622 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-11-29 00:04:48,622 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-11-29 00:04:48,623 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-11-29 00:04:48,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-11-29 00:04:48,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:48,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1109961593, now seen corresponding path program 1 times [2018-11-29 00:04:48,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:48,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:48,751 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:48,752 INFO L87 Difference]: Start difference. First operand 520 states and 752 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-29 00:04:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:49,434 INFO L93 Difference]: Finished difference Result 916 states and 1314 transitions. [2018-11-29 00:04:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:04:49,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1314 transitions. [2018-11-29 00:04:49,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 890 [2018-11-29 00:04:49,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 916 states and 1314 transitions. [2018-11-29 00:04:49,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2018-11-29 00:04:49,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 916 [2018-11-29 00:04:49,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 916 states and 1314 transitions. [2018-11-29 00:04:49,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:49,457 INFO L705 BuchiCegarLoop]: Abstraction has 916 states and 1314 transitions. [2018-11-29 00:04:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states and 1314 transitions. [2018-11-29 00:04:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 532. [2018-11-29 00:04:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-29 00:04:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 764 transitions. [2018-11-29 00:04:49,479 INFO L728 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-29 00:04:49,479 INFO L608 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-29 00:04:49,480 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:04:49,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 532 states and 764 transitions. [2018-11-29 00:04:49,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-11-29 00:04:49,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:49,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:49,488 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-11-29 00:04:49,493 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-11-29 00:04:49,493 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-11-29 00:04:49,496 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-11-29 00:04:49,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-11-29 00:04:49,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1255144909, now seen corresponding path program 1 times [2018-11-29 00:04:49,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:49,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:49,615 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:49,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:49,616 INFO L87 Difference]: Start difference. First operand 532 states and 764 transitions. cyclomatic complexity: 233 Second operand 3 states. [2018-11-29 00:04:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:49,803 INFO L93 Difference]: Finished difference Result 930 states and 1312 transitions. [2018-11-29 00:04:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:49,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 930 states and 1312 transitions. [2018-11-29 00:04:49,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-11-29 00:04:49,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 930 states to 930 states and 1312 transitions. [2018-11-29 00:04:49,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 930 [2018-11-29 00:04:49,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 930 [2018-11-29 00:04:49,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 930 states and 1312 transitions. [2018-11-29 00:04:49,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:49,829 INFO L705 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-29 00:04:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states and 1312 transitions. [2018-11-29 00:04:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2018-11-29 00:04:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-29 00:04:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1312 transitions. [2018-11-29 00:04:49,851 INFO L728 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-29 00:04:49,851 INFO L608 BuchiCegarLoop]: Abstraction has 930 states and 1312 transitions. [2018-11-29 00:04:49,851 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:04:49,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 930 states and 1312 transitions. [2018-11-29 00:04:49,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 904 [2018-11-29 00:04:49,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:49,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:49,862 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-11-29 00:04:49,862 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-11-29 00:04:49,862 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-11-29 00:04:49,863 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-11-29 00:04:49,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-11-29 00:04:49,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1406901968, now seen corresponding path program 1 times [2018-11-29 00:04:49,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:49,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:50,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:50,042 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:50,042 INFO L87 Difference]: Start difference. First operand 930 states and 1312 transitions. cyclomatic complexity: 383 Second operand 5 states. [2018-11-29 00:04:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:50,668 INFO L93 Difference]: Finished difference Result 2066 states and 2911 transitions. [2018-11-29 00:04:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:50,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 2911 transitions. [2018-11-29 00:04:50,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2040 [2018-11-29 00:04:50,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 2066 states and 2911 transitions. [2018-11-29 00:04:50,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2066 [2018-11-29 00:04:50,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2066 [2018-11-29 00:04:50,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2066 states and 2911 transitions. [2018-11-29 00:04:50,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:50,719 INFO L705 BuchiCegarLoop]: Abstraction has 2066 states and 2911 transitions. [2018-11-29 00:04:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states and 2911 transitions. [2018-11-29 00:04:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 966. [2018-11-29 00:04:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-11-29 00:04:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1339 transitions. [2018-11-29 00:04:50,756 INFO L728 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-11-29 00:04:50,756 INFO L608 BuchiCegarLoop]: Abstraction has 966 states and 1339 transitions. [2018-11-29 00:04:50,756 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:04:50,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 966 states and 1339 transitions. [2018-11-29 00:04:50,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 940 [2018-11-29 00:04:50,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:50,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:50,767 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-11-29 00:04:50,767 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-11-29 00:04:50,768 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-11-29 00:04:50,770 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-11-29 00:04:50,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-11-29 00:04:50,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:50,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:50,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -984200142, now seen corresponding path program 1 times [2018-11-29 00:04:50,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:50,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:51,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:51,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:51,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:51,095 INFO L87 Difference]: Start difference. First operand 966 states and 1339 transitions. cyclomatic complexity: 374 Second operand 5 states. [2018-11-29 00:04:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:51,411 INFO L93 Difference]: Finished difference Result 2040 states and 2832 transitions. [2018-11-29 00:04:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:51,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2040 states and 2832 transitions. [2018-11-29 00:04:51,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2014 [2018-11-29 00:04:51,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2040 states to 2040 states and 2832 transitions. [2018-11-29 00:04:51,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2040 [2018-11-29 00:04:51,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2040 [2018-11-29 00:04:51,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2040 states and 2832 transitions. [2018-11-29 00:04:51,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:51,452 INFO L705 BuchiCegarLoop]: Abstraction has 2040 states and 2832 transitions. [2018-11-29 00:04:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states and 2832 transitions. [2018-11-29 00:04:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 996. [2018-11-29 00:04:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2018-11-29 00:04:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1358 transitions. [2018-11-29 00:04:51,483 INFO L728 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-11-29 00:04:51,483 INFO L608 BuchiCegarLoop]: Abstraction has 996 states and 1358 transitions. [2018-11-29 00:04:51,483 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:04:51,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 996 states and 1358 transitions. [2018-11-29 00:04:51,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 970 [2018-11-29 00:04:51,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:51,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:51,492 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-11-29 00:04:51,492 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-11-29 00:04:51,492 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-11-29 00:04:51,493 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-11-29 00:04:51,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-11-29 00:04:51,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:51,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:51,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:51,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:51,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:51,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash 528178929, now seen corresponding path program 1 times [2018-11-29 00:04:51,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:51,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:51,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:51,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:51,695 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:51,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:51,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:51,696 INFO L87 Difference]: Start difference. First operand 996 states and 1358 transitions. cyclomatic complexity: 363 Second operand 5 states. [2018-11-29 00:04:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:52,067 INFO L93 Difference]: Finished difference Result 2384 states and 3231 transitions. [2018-11-29 00:04:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:52,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2384 states and 3231 transitions. [2018-11-29 00:04:52,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2329 [2018-11-29 00:04:52,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2384 states to 2384 states and 3231 transitions. [2018-11-29 00:04:52,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2384 [2018-11-29 00:04:52,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2384 [2018-11-29 00:04:52,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2384 states and 3231 transitions. [2018-11-29 00:04:52,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:52,111 INFO L705 BuchiCegarLoop]: Abstraction has 2384 states and 3231 transitions. [2018-11-29 00:04:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states and 3231 transitions. [2018-11-29 00:04:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1059. [2018-11-29 00:04:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-29 00:04:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1421 transitions. [2018-11-29 00:04:52,145 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-11-29 00:04:52,145 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1421 transitions. [2018-11-29 00:04:52,146 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:04:52,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1421 transitions. [2018-11-29 00:04:52,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-29 00:04:52,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:52,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:52,175 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-11-29 00:04:52,175 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-11-29 00:04:52,175 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-11-29 00:04:52,179 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-11-29 00:04:52,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-11-29 00:04:52,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:52,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1995317392, now seen corresponding path program 1 times [2018-11-29 00:04:52,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:52,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:52,221 INFO L82 PathProgramCache]: Analyzing trace with hash -237860646, now seen corresponding path program 1 times [2018-11-29 00:04:52,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:52,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:52,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:52,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:52,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:52,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:52,675 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-29 00:04:52,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:52,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:52,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:52,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:52,782 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:04:52,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:52,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:52,783 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-29 00:04:52,783 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:52,783 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:52,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,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-11-29 00:04:52,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:53,317 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,352 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,372 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:04:53,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,425 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,502 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,502 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,536 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Honda state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,579 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,630 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:04:53,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,663 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,670 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,725 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,725 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,749 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,749 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,752 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,752 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,778 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,778 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,822 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-29 00:04:53,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,864 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,869 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,894 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,894 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,937 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Honda state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:53,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:53,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:53,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:53,991 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:54,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:54,015 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:54,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:04:54,044 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:54,102 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:04:54,105 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:54,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:54,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:54,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:54,105 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:04:54,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:54,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:54,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:54,106 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-29 00:04:54,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:54,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:54,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,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-11-29 00:04:54,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,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-11-29 00:04:54,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-11-29 00:04:54,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-11-29 00:04:54,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-11-29 00:04:54,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,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-11-29 00:04:54,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:54,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:55,006 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-29 00:04:55,198 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:04:55,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:55,530 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:04:55,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,613 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,614 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,671 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,678 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,698 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:55,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:55,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,729 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-29 00:04:55,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-11-29 00:04:55,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,731 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,738 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,740 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,741 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,744 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,745 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,759 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,759 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,784 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,784 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,790 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,798 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,803 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,829 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,835 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,836 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,840 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,840 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,847 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,847 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,853 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,856 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,865 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,873 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,883 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,883 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,892 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,892 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,906 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,917 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,918 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-29 00:04:55,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-11-29 00:04:55,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,920 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,929 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,938 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,945 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,950 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,978 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,991 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,045 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,046 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,049 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,085 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,090 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,098 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,099 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,112 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,121 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,123 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,139 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,140 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,146 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,147 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,153 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,167 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,167 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,170 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,171 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,185 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,188 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-29 00:04:56,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,190 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,190 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,193 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,193 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,197 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,197 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,199 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,200 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,203 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,205 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,210 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,211 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,213 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,213 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,216 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,218 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,219 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,221 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,221 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,228 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,229 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,235 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,236 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,239 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,239 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,241 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,242 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,244 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,247 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,247 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,250 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,252 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,252 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,253 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,258 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,259 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,262 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,262 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,264 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,264 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,265 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,267 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,267 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,268 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,271 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,271 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,275 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,278 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,289 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,293 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,293 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,296 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,296 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,299 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:56,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,302 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,302 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,305 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-29 00:04:56,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,306 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,336 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,340 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,344 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,378 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,385 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,391 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,392 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,397 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,398 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,398 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,400 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,400 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,400 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,401 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:56,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,406 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,409 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,410 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,427 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,428 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,432 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,438 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,440 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,445 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,450 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,450 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,451 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,454 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,455 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,463 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,464 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:56,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,487 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,491 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:56,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,516 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,534 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,535 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,535 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,537 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,537 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:56,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,548 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:56,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,579 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,583 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,584 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,584 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,591 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,592 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,636 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,645 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,645 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,651 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,681 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,682 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,686 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,686 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,686 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:56,687 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:56,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,691 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-29 00:04:56,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,692 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,692 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,720 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,724 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,742 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,758 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,769 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,770 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,776 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,783 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,799 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,801 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,812 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,816 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,830 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,831 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,845 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,849 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,855 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,882 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,886 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,890 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,914 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,914 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,918 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,941 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,941 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,945 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,956 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,965 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,965 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,980 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,981 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,982 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,997 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,013 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,023 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,053 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,066 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,067 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,072 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,087 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:57,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,093 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-29 00:04:57,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,104 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,108 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,128 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,140 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,141 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,144 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,176 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,182 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,204 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,205 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,206 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,213 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,214 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,224 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,226 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:57,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,257 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,258 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,259 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,262 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,266 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,302 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,303 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,304 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,311 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,312 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,315 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,315 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,318 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,352 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,353 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,356 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,359 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,365 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,365 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,370 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:57,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,407 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,407 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,408 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,408 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,410 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:57,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,437 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,444 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,467 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,468 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,470 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:57,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,486 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,492 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:57,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,512 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,513 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,535 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,537 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,566 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,566 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,604 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,605 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,612 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,612 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,613 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,619 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,624 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,657 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:57,658 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:57,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,659 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-29 00:04:57,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,660 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,712 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,713 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,717 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,717 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,729 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,775 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,788 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,831 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:57,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,843 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,882 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,891 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,902 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,943 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,948 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,951 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,999 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,999 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,000 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:58,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,011 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,012 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:58,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,035 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,081 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:58,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,094 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,094 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:58,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,136 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,138 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,143 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,144 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,147 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,148 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,149 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,190 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,195 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,202 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,249 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:58,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:58,256 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:58,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,262 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-29 00:04:58,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-11-29 00:04:58,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,265 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,304 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,305 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,318 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,319 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,330 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,330 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,362 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,397 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,405 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,409 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,432 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,437 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,441 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,441 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,442 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:58,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,450 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,450 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,496 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,507 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,507 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,527 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,528 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,577 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,578 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,583 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,583 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,597 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,598 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,627 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,628 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,636 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,636 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,637 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:58,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,647 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,647 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,647 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,649 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:58,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,690 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,691 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,697 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,697 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,712 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,712 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,712 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,713 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:58,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:58,760 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,761 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:58,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,772 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,773 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,790 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,813 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,814 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,850 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,850 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,857 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,881 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,882 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:58,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,891 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,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-11-29 00:04:58,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:58,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:58,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:58,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:58,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:58,910 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:58,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:58,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:58,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:58,942 INFO L87 Difference]: Start difference. First operand 1059 states and 1421 transitions. cyclomatic complexity: 363 Second operand 3 states. [2018-11-29 00:04:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:59,267 INFO L93 Difference]: Finished difference Result 1059 states and 1405 transitions. [2018-11-29 00:04:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:59,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1059 states and 1405 transitions. [2018-11-29 00:04:59,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-29 00:04:59,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-11-29 00:04:59,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1059 [2018-11-29 00:04:59,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1059 [2018-11-29 00:04:59,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1059 states and 1405 transitions. [2018-11-29 00:04:59,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:59,307 INFO L705 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-29 00:04:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states and 1405 transitions. [2018-11-29 00:04:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2018-11-29 00:04:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-29 00:04:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1405 transitions. [2018-11-29 00:04:59,362 INFO L728 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-29 00:04:59,363 INFO L608 BuchiCegarLoop]: Abstraction has 1059 states and 1405 transitions. [2018-11-29 00:04:59,365 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:04:59,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1059 states and 1405 transitions. [2018-11-29 00:04:59,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1030 [2018-11-29 00:04:59,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:59,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:59,382 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-11-29 00:04:59,382 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-11-29 00:04:59,383 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-11-29 00:04:59,383 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-11-29 00:04:59,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-11-29 00:04:59,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1599561696, now seen corresponding path program 1 times [2018-11-29 00:04:59,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:59,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:59,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:59,531 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:59,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:59,531 INFO L87 Difference]: Start difference. First operand 1059 states and 1405 transitions. cyclomatic complexity: 347 Second operand 3 states. [2018-11-29 00:05:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:00,031 INFO L93 Difference]: Finished difference Result 1763 states and 2324 transitions. [2018-11-29 00:05:00,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:00,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 2324 transitions. [2018-11-29 00:05:00,052 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1728 [2018-11-29 00:05:00,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1763 states and 2324 transitions. [2018-11-29 00:05:00,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1763 [2018-11-29 00:05:00,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1763 [2018-11-29 00:05:00,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1763 states and 2324 transitions. [2018-11-29 00:05:00,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:00,205 INFO L705 BuchiCegarLoop]: Abstraction has 1763 states and 2324 transitions. [2018-11-29 00:05:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states and 2324 transitions. [2018-11-29 00:05:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1747. [2018-11-29 00:05:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2018-11-29 00:05:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2304 transitions. [2018-11-29 00:05:00,242 INFO L728 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-11-29 00:05:00,242 INFO L608 BuchiCegarLoop]: Abstraction has 1747 states and 2304 transitions. [2018-11-29 00:05:00,242 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:05:00,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1747 states and 2304 transitions. [2018-11-29 00:05:00,254 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1712 [2018-11-29 00:05:00,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:00,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:00,255 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-11-29 00:05:00,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:00,255 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-11-29 00:05:00,255 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-11-29 00:05:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-11-29 00:05:00,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-11-29 00:05:00,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-11-29 00:05:00,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:00,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:00,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:00,859 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-29 00:05:01,093 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-29 00:05:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:01,107 INFO L87 Difference]: Start difference. First operand 1747 states and 2304 transitions. cyclomatic complexity: 560 Second operand 3 states. [2018-11-29 00:05:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:01,443 INFO L93 Difference]: Finished difference Result 2796 states and 3646 transitions. [2018-11-29 00:05:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:01,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2796 states and 3646 transitions. [2018-11-29 00:05:01,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2731 [2018-11-29 00:05:01,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2796 states to 2796 states and 3646 transitions. [2018-11-29 00:05:01,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2796 [2018-11-29 00:05:01,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2796 [2018-11-29 00:05:01,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2796 states and 3646 transitions. [2018-11-29 00:05:01,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:01,492 INFO L705 BuchiCegarLoop]: Abstraction has 2796 states and 3646 transitions. [2018-11-29 00:05:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states and 3646 transitions. [2018-11-29 00:05:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2704. [2018-11-29 00:05:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2704 states. [2018-11-29 00:05:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3534 transitions. [2018-11-29 00:05:01,550 INFO L728 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-11-29 00:05:01,550 INFO L608 BuchiCegarLoop]: Abstraction has 2704 states and 3534 transitions. [2018-11-29 00:05:01,550 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:05:01,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 3534 transitions. [2018-11-29 00:05:01,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-29 00:05:01,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:01,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:01,563 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-11-29 00:05:01,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,563 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-11-29 00:05:01,564 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-11-29 00:05:01,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,571 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-11-29 00:05:01,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:01,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:01,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:01,638 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:01,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-11-29 00:05:01,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,109 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-29 00:05:02,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:02,211 INFO L87 Difference]: Start difference. First operand 2704 states and 3534 transitions. cyclomatic complexity: 833 Second operand 3 states. [2018-11-29 00:05:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:02,221 INFO L93 Difference]: Finished difference Result 2682 states and 3511 transitions. [2018-11-29 00:05:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:02,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2682 states and 3511 transitions. [2018-11-29 00:05:02,232 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-29 00:05:02,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-11-29 00:05:02,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2682 [2018-11-29 00:05:02,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2682 [2018-11-29 00:05:02,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2682 states and 3511 transitions. [2018-11-29 00:05:02,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:02,253 INFO L705 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-29 00:05:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states and 3511 transitions. [2018-11-29 00:05:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2682. [2018-11-29 00:05:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-11-29 00:05:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3511 transitions. [2018-11-29 00:05:02,295 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-29 00:05:02,296 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3511 transitions. [2018-11-29 00:05:02,296 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:05:02,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3511 transitions. [2018-11-29 00:05:02,303 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2639 [2018-11-29 00:05:02,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:02,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:02,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, 1, 1] [2018-11-29 00:05:02,304 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:02,305 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-11-29 00:05:02,305 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-11-29 00:05:02,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:02,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-11-29 00:05:02,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:02,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:02,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-11-29 00:05:02,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:02,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:02,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:02,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-11-29 00:05:02,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:02,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:02,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:05:02,808 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-29 00:05:02,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:02,846 INFO L87 Difference]: Start difference. First operand 2682 states and 3511 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-29 00:05:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:02,895 INFO L93 Difference]: Finished difference Result 4410 states and 5717 transitions. [2018-11-29 00:05:02,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:02,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4410 states and 5717 transitions. [2018-11-29 00:05:02,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-11-29 00:05:02,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-11-29 00:05:02,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4410 [2018-11-29 00:05:02,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4410 [2018-11-29 00:05:02,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4410 states and 5717 transitions. [2018-11-29 00:05:02,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:02,944 INFO L705 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-29 00:05:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states and 5717 transitions. [2018-11-29 00:05:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2018-11-29 00:05:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2018-11-29 00:05:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 5717 transitions. [2018-11-29 00:05:03,006 INFO L728 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-29 00:05:03,006 INFO L608 BuchiCegarLoop]: Abstraction has 4410 states and 5717 transitions. [2018-11-29 00:05:03,006 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:05:03,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4410 states and 5717 transitions. [2018-11-29 00:05:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4351 [2018-11-29 00:05:03,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:03,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:03,020 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-11-29 00:05:03,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:03,021 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-11-29 00:05:03,021 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-11-29 00:05:03,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-11-29 00:05:03,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:03,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:03,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-11-29 00:05:03,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:03,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-11-29 00:05:03,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:03,203 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-29 00:05:03,607 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-29 00:05:03,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:05:03 BoogieIcfgContainer [2018-11-29 00:05:03,737 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:05:03,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:05:03,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:05:03,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:05:03,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:46" (3/4) ... [2018-11-29 00:05:03,742 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:05:03,834 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:05:03,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:05:03,835 INFO L168 Benchmark]: Toolchain (without parser) took 19455.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.8 MB). Free memory was 951.4 MB in the beginning and 974.6 MB in the end (delta: -23.3 MB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,839 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:05:03,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,840 INFO L168 Benchmark]: Boogie Preprocessor took 44.20 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,841 INFO L168 Benchmark]: RCFGBuilder took 1449.24 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.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,847 INFO L168 Benchmark]: BuchiAutomizer took 17234.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 974.6 MB in the end (delta: 79.3 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:03,847 INFO L168 Benchmark]: Witness Printer took 96.87 ms. Allocated memory is still 1.3 GB. Free memory is still 974.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:05:03,854 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.50 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 145.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.20 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1449.24 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.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17234.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 974.6 MB in the end (delta: 79.3 MB). Peak memory consumption was 266.5 MB. Max. memory is 11.5 GB. * Witness Printer took 96.87 ms. Allocated memory is still 1.3 GB. Free memory is still 974.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4410 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 11.5s. Construction of modules took 3.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 3992 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 4410 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3601 SDtfs, 4398 SDslu, 4843 SDs, 0 SdLazy, 314 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.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: 11ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 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@303e1c27=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e75f032=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@93ff908=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@109ec50f=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@42def266=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@7e4af2fe=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@488c61e0=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@a2549d8=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b05cf60=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...