./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 375118f5e6b201fc35ff4858369e05c815397841 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:25:59,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:25:59,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:25:59,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:25:59,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:25:59,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:25:59,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:25:59,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:25:59,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:25:59,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:25:59,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:25:59,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:25:59,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:25:59,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:25:59,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:25:59,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:25:59,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:25:59,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:25:59,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:25:59,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:25:59,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:25:59,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:25:59,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:25:59,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:25:59,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:25:59,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:25:59,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:25:59,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:25:59,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:25:59,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:25:59,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:25:59,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:25:59,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:25:59,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:25:59,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:25:59,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:25:59,629 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:25:59,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:25:59,637 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:25:59,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:25:59,638 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:25:59,638 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:25:59,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:25:59,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:25:59,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:25:59,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:25:59,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:25:59,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:25:59,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:25:59,643 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:25:59,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:25:59,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:25:59,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:25:59,643 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:25:59,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:25:59,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:25:59,644 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:25:59,644 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:25:59,645 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375118f5e6b201fc35ff4858369e05c815397841 [2018-11-10 12:25:59,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:25:59,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:25:59,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:25:59,680 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:25:59,681 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:25:59,681 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-10 12:25:59,725 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/data/643223c15/9f3aa80c98f34ef59c8037728baece83/FLAGd7bda3231 [2018-11-10 12:26:00,042 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:26:00,043 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-10 12:26:00,049 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/data/643223c15/9f3aa80c98f34ef59c8037728baece83/FLAGd7bda3231 [2018-11-10 12:26:00,061 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/data/643223c15/9f3aa80c98f34ef59c8037728baece83 [2018-11-10 12:26:00,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:26:00,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:26:00,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:26:00,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:26:00,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:26:00,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d841a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00, skipping insertion in model container [2018-11-10 12:26:00,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:26:00,108 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:26:00,262 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:26:00,266 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:26:00,295 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:26:00,307 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:26:00,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00 WrapperNode [2018-11-10 12:26:00,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:26:00,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:26:00,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:26:00,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:26:00,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:26:00,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:26:00,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:26:00,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:26:00,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... [2018-11-10 12:26:00,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:26:00,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:26:00,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:26:00,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:26:00,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:26:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:26:00,962 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:26:00,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:26:00 BoogieIcfgContainer [2018-11-10 12:26:00,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:26:00,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:26:00,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:26:00,965 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:26:00,965 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:26:00,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:26:00" (1/3) ... [2018-11-10 12:26:00,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a56c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:26:00, skipping insertion in model container [2018-11-10 12:26:00,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:26:00,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:26:00" (2/3) ... [2018-11-10 12:26:00,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a56c595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:26:00, skipping insertion in model container [2018-11-10 12:26:00,966 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:26:00,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:26:00" (3/3) ... [2018-11-10 12:26:00,968 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2018-11-10 12:26:01,004 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:26:01,005 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:26:01,005 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:26:01,005 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:26:01,005 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:26:01,005 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:26:01,005 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:26:01,005 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:26:01,005 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:26:01,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states. [2018-11-10 12:26:01,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 159 [2018-11-10 12:26:01,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,042 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, 1] [2018-11-10 12:26:01,042 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] [2018-11-10 12:26:01,042 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:26:01,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states. [2018-11-10 12:26:01,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 159 [2018-11-10 12:26:01,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,048 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, 1] [2018-11-10 12:26:01,048 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] [2018-11-10 12:26:01,053 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 171#L603true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 137#L288true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 52#L295true assume !(~P_1_i~0 == 1);~P_1_st~0 := 2; 50#L295-2true assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 177#L300-1true assume !(~C_1_i~0 == 1);~C_1_st~0 := 2; 187#L305-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 145#L414true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 60#L108true assume !(~P_1_pc~0 == 1); 54#L108-2true is_P_1_triggered_~__retres1~0 := 0; 61#L119true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19#L120true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 193#L481true assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 195#L481-2true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 78#L176true assume ~P_2_pc~0 == 1; 156#L177true assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 79#L187true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 157#L188true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 111#L489true assume !(activate_threads_~tmp___0~1 != 0); 118#L489-2true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 121#L258true assume ~C_1_pc~0 == 1; 72#L259true assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 44#L279true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 124#L280true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 139#L497true assume !(activate_threads_~tmp___1~1 != 0); 141#L497-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 45#L422true assume { :end_inline_reset_delta_events } true; 161#L551-3true [2018-11-10 12:26:01,053 INFO L795 eck$LassoCheckResult]: Loop: 161#L551-3true assume true; 166#L551-1true assume !false; 138#L552true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 128#L387true assume !true; 146#L403true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 136#L288-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 147#L414-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 28#L108-6true assume !(~P_1_pc~0 == 1); 48#L108-8true is_P_1_triggered_~__retres1~0 := 0; 57#L119-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12#L120-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 186#L481-6true assume !(activate_threads_~tmp~1 != 0); 178#L481-8true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 81#L176-6true assume !(~P_2_pc~0 == 1); 66#L176-8true is_P_2_triggered_~__retres1~1 := 0; 88#L187-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 153#L188-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 103#L489-6true assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 106#L489-8true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 90#L258-6true assume ~C_1_pc~0 == 1; 68#L259-2true assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 39#L279-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 117#L280-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 133#L497-6true assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 196#L497-8true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 47#L422-1true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13#L318-1true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 102#L335-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 75#L336-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 173#L570true assume !(start_simulation_~tmp~3 == 0); 167#L570-2true assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17#L318-2true assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 104#L335-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 63#L336-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 191#L525true assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 38#L532true stop_simulation_#res := stop_simulation_~__retres2~0; 3#L533true start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 98#L583true assume !(start_simulation_~tmp___0~2 != 0); 161#L551-3true [2018-11-10 12:26:01,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1332213672, now seen corresponding path program 1 times [2018-11-10 12:26:01,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,159 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-10 12:26:01,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:01,164 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:01,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash 20269596, now seen corresponding path program 1 times [2018-11-10 12:26:01,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,174 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-10 12:26:01,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:26:01,176 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:01,187 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 3 states. [2018-11-10 12:26:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:01,213 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2018-11-10 12:26:01,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:01,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 275 transitions. [2018-11-10 12:26:01,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-10 12:26:01,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 184 states and 267 transitions. [2018-11-10 12:26:01,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-10 12:26:01,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-10 12:26:01,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 267 transitions. [2018-11-10 12:26:01,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:01,228 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-10 12:26:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 267 transitions. [2018-11-10 12:26:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-10 12:26:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 12:26:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2018-11-10 12:26:01,251 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-10 12:26:01,251 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-10 12:26:01,251 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:26:01,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 267 transitions. [2018-11-10 12:26:01,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-10 12:26:01,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,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, 1] [2018-11-10 12:26:01,255 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-10 12:26:01,255 INFO L793 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 419#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 420#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 433#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 434#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 530#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 531#L300-1 assume !(~C_1_i~0 == 1);~C_1_st~0 := 2; 557#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 479#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 480#L108 assume !(~P_1_pc~0 == 1); 458#L108-2 is_P_1_triggered_~__retres1~0 := 0; 457#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 459#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 460#L481 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 574#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 554#L176 assume ~P_2_pc~0 == 1; 500#L177 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 501#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 503#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 504#L489 assume !(activate_threads_~tmp___0~1 != 0); 576#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 580#L258 assume ~C_1_pc~0 == 1; 548#L259 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 512#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 515#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 454#L497 assume !(activate_threads_~tmp___1~1 != 0); 455#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 469#L422 assume { :end_inline_reset_delta_events } true; 516#L551-3 [2018-11-10 12:26:01,255 INFO L795 eck$LassoCheckResult]: Loop: 516#L551-3 assume true; 526#L551-1 assume !false; 440#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 401#L387 assume true; 402#L347-1 assume !false; 483#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 428#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 429#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 550#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 551#L352 assume !(eval_~tmp___2~0 != 0); 481#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 421#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 422#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 482#L108-6 assume ~P_1_pc~0 == 1; 435#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 436#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 441#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 442#L481-6 assume !(activate_threads_~tmp~1 != 0); 559#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 555#L176-6 assume ~P_2_pc~0 == 1; 488#L177-2 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 489#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 491#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 492#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 573#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 562#L258-6 assume ~C_1_pc~0 == 1; 543#L259-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 474#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 510#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 409#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 410#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 517#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 443#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 444#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 553#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 552#L570 assume !(start_simulation_~tmp~3 == 0); 529#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 451#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 452#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 538#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 539#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 509#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 411#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 412#L583 assume !(start_simulation_~tmp___0~2 != 0); 516#L551-3 [2018-11-10 12:26:01,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1466227178, now seen corresponding path program 1 times [2018-11-10 12:26:01,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,294 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-10 12:26:01,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:01,294 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:01,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1288797641, now seen corresponding path program 1 times [2018-11-10 12:26:01,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,340 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-10 12:26:01,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,341 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:01,341 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-10 12:26:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:01,352 INFO L93 Difference]: Finished difference Result 184 states and 266 transitions. [2018-11-10 12:26:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:01,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 266 transitions. [2018-11-10 12:26:01,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-10 12:26:01,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 266 transitions. [2018-11-10 12:26:01,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-10 12:26:01,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-10 12:26:01,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 266 transitions. [2018-11-10 12:26:01,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:01,358 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-10 12:26:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 266 transitions. [2018-11-10 12:26:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-10 12:26:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-10 12:26:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2018-11-10 12:26:01,365 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-10 12:26:01,365 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-10 12:26:01,365 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:26:01,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 266 transitions. [2018-11-10 12:26:01,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-10 12:26:01,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,367 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, 1] [2018-11-10 12:26:01,367 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-10 12:26:01,368 INFO L793 eck$LassoCheckResult]: Stem: 933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 797#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 808#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 809#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 905#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 906#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 934#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 856#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 857#L108 assume !(~P_1_pc~0 == 1); 835#L108-2 is_P_1_triggered_~__retres1~0 := 0; 834#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 836#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 837#L481 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 951#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 931#L176 assume ~P_2_pc~0 == 1; 877#L177 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 878#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 880#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 881#L489 assume !(activate_threads_~tmp___0~1 != 0); 953#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 957#L258 assume ~C_1_pc~0 == 1; 925#L259 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 889#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 892#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 831#L497 assume !(activate_threads_~tmp___1~1 != 0); 832#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 844#L422 assume { :end_inline_reset_delta_events } true; 893#L551-3 [2018-11-10 12:26:01,368 INFO L795 eck$LassoCheckResult]: Loop: 893#L551-3 assume true; 901#L551-1 assume !false; 812#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 778#L387 assume true; 779#L347-1 assume !false; 860#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 803#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 804#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 927#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 928#L352 assume !(eval_~tmp___2~0 != 0); 858#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 798#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 799#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 859#L108-6 assume ~P_1_pc~0 == 1; 813#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 814#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 818#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 819#L481-6 assume !(activate_threads_~tmp~1 != 0); 936#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 932#L176-6 assume ~P_2_pc~0 == 1; 865#L177-2 assume ~P_2_ev~0 == 1;is_P_2_triggered_~__retres1~1 := 1; 866#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 868#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 869#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 950#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 939#L258-6 assume ~C_1_pc~0 == 1; 920#L259-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 851#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 887#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 786#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 787#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 894#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 820#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 821#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 930#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 929#L570 assume !(start_simulation_~tmp~3 == 0); 904#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 828#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 829#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 915#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 916#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 886#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 788#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 789#L583 assume !(start_simulation_~tmp___0~2 != 0); 893#L551-3 [2018-11-10 12:26:01,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1247372460, now seen corresponding path program 1 times [2018-11-10 12:26:01,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,401 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-10 12:26:01,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:01,401 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:01,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1288797641, now seen corresponding path program 2 times [2018-11-10 12:26:01,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,430 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-10 12:26:01,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,431 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:01,431 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-10 12:26:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:01,469 INFO L93 Difference]: Finished difference Result 331 states and 474 transitions. [2018-11-10 12:26:01,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:01,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 474 transitions. [2018-11-10 12:26:01,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 299 [2018-11-10 12:26:01,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 331 states and 474 transitions. [2018-11-10 12:26:01,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331 [2018-11-10 12:26:01,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2018-11-10 12:26:01,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 474 transitions. [2018-11-10 12:26:01,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:01,474 INFO L705 BuchiCegarLoop]: Abstraction has 331 states and 474 transitions. [2018-11-10 12:26:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 474 transitions. [2018-11-10 12:26:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2018-11-10 12:26:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-10 12:26:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 452 transitions. [2018-11-10 12:26:01,482 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 452 transitions. [2018-11-10 12:26:01,482 INFO L608 BuchiCegarLoop]: Abstraction has 315 states and 452 transitions. [2018-11-10 12:26:01,482 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:26:01,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 452 transitions. [2018-11-10 12:26:01,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 283 [2018-11-10 12:26:01,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,484 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, 1] [2018-11-10 12:26:01,484 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-10 12:26:01,485 INFO L793 eck$LassoCheckResult]: Stem: 1459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1323#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 1334#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1335#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 1428#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 1429#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 1460#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1380#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1381#L108 assume !(~P_1_pc~0 == 1); 1359#L108-2 is_P_1_triggered_~__retres1~0 := 0; 1358#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1360#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1361#L481 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 1479#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1454#L176 assume !(~P_2_pc~0 == 1); 1455#L176-2 is_P_2_triggered_~__retres1~1 := 0; 1456#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1401#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1402#L489 assume !(activate_threads_~tmp___0~1 != 0); 1481#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1485#L258 assume ~C_1_pc~0 == 1; 1450#L259 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 1410#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1413#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1355#L497 assume !(activate_threads_~tmp___1~1 != 0); 1356#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1370#L422 assume { :end_inline_reset_delta_events } true; 1414#L551-3 [2018-11-10 12:26:01,485 INFO L795 eck$LassoCheckResult]: Loop: 1414#L551-3 assume true; 1424#L551-1 assume !false; 1341#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 1300#L387 assume true; 1301#L347-1 assume !false; 1384#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1327#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1328#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1448#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1449#L352 assume !(eval_~tmp___2~0 != 0); 1382#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1320#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1321#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1383#L108-6 assume ~P_1_pc~0 == 1; 1336#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 1337#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1342#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1343#L481-6 assume !(activate_threads_~tmp~1 != 0); 1462#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1457#L176-6 assume !(~P_2_pc~0 == 1); 1458#L176-8 is_P_2_triggered_~__retres1~1 := 0; 1612#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1611#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1610#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 1609#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1608#L258-6 assume ~C_1_pc~0 == 1; 1602#L259-2 assume ~e~0 == 1;is_C_1_triggered_~__retres1~2 := 1; 1600#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1598#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1597#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 1592#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1590#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1583#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1581#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1453#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1452#L570 assume !(start_simulation_~tmp~3 == 0); 1427#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1352#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 1353#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1436#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1437#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 1407#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 1312#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1313#L583 assume !(start_simulation_~tmp___0~2 != 0); 1414#L551-3 [2018-11-10 12:26:01,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,485 INFO L82 PathProgramCache]: Analyzing trace with hash -31952275, now seen corresponding path program 1 times [2018-11-10 12:26:01,485 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,519 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-10 12:26:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:01,520 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:01,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash -768806390, now seen corresponding path program 1 times [2018-11-10 12:26:01,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,551 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-10 12:26:01,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,552 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:01,552 INFO L87 Difference]: Start difference. First operand 315 states and 452 transitions. cyclomatic complexity: 138 Second operand 3 states. [2018-11-10 12:26:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:01,619 INFO L93 Difference]: Finished difference Result 586 states and 822 transitions. [2018-11-10 12:26:01,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:01,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 822 transitions. [2018-11-10 12:26:01,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 556 [2018-11-10 12:26:01,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 586 states and 822 transitions. [2018-11-10 12:26:01,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 586 [2018-11-10 12:26:01,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 586 [2018-11-10 12:26:01,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 586 states and 822 transitions. [2018-11-10 12:26:01,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:01,628 INFO L705 BuchiCegarLoop]: Abstraction has 586 states and 822 transitions. [2018-11-10 12:26:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states and 822 transitions. [2018-11-10 12:26:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 570. [2018-11-10 12:26:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-11-10 12:26:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 802 transitions. [2018-11-10 12:26:01,641 INFO L728 BuchiCegarLoop]: Abstraction has 570 states and 802 transitions. [2018-11-10 12:26:01,641 INFO L608 BuchiCegarLoop]: Abstraction has 570 states and 802 transitions. [2018-11-10 12:26:01,642 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:26:01,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 570 states and 802 transitions. [2018-11-10 12:26:01,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2018-11-10 12:26:01,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,645 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, 1, 1] [2018-11-10 12:26:01,646 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, 1] [2018-11-10 12:26:01,646 INFO L793 eck$LassoCheckResult]: Stem: 2378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 2230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2231#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 2242#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2243#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 2339#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 2340#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 2379#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2291#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2292#L108 assume !(~P_1_pc~0 == 1); 2269#L108-2 is_P_1_triggered_~__retres1~0 := 0; 2268#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2270#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2271#L481 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 2406#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2373#L176 assume !(~P_2_pc~0 == 1); 2374#L176-2 is_P_2_triggered_~__retres1~1 := 0; 2375#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2312#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2313#L489 assume !(activate_threads_~tmp___0~1 != 0); 2412#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2418#L258 assume !(~C_1_pc~0 == 1); 2414#L258-2 assume !(~C_1_pc~0 == 2); 2320#L268-1 is_C_1_triggered_~__retres1~2 := 0; 2321#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2326#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2265#L497 assume !(activate_threads_~tmp___1~1 != 0); 2266#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2279#L422 assume { :end_inline_reset_delta_events } true; 2327#L551-3 [2018-11-10 12:26:01,646 INFO L795 eck$LassoCheckResult]: Loop: 2327#L551-3 assume true; 2335#L551-1 assume !false; 2246#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 2212#L387 assume true; 2213#L347-1 assume !false; 2295#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2239#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2240#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2368#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2369#L352 assume !(eval_~tmp___2~0 != 0); 2293#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 2232#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 2233#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2294#L108-6 assume ~P_1_pc~0 == 1; 2247#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 2248#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2255#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2256#L481-6 assume !(activate_threads_~tmp~1 != 0); 2385#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2376#L176-6 assume !(~P_2_pc~0 == 1); 2377#L176-8 is_P_2_triggered_~__retres1~1 := 0; 2381#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2303#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2304#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 2403#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2387#L258-6 assume !(~C_1_pc~0 == 1); 2382#L258-8 assume !(~C_1_pc~0 == 2); 2383#L268-5 is_C_1_triggered_~__retres1~2 := 0; 2755#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2753#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2751#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 2749#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2747#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2743#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2742#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2741#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2740#L570 assume !(start_simulation_~tmp~3 == 0); 2338#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2260#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 2261#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2353#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2354#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 2318#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 2222#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2223#L583 assume !(start_simulation_~tmp___0~2 != 0); 2327#L551-3 [2018-11-10 12:26:01,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1307353874, now seen corresponding path program 1 times [2018-11-10 12:26:01,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:26:01,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,733 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:01,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,734 INFO L82 PathProgramCache]: Analyzing trace with hash 261148921, now seen corresponding path program 1 times [2018-11-10 12:26:01,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,789 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-10 12:26:01,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,790 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:26:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:26:01,790 INFO L87 Difference]: Start difference. First operand 570 states and 802 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-10 12:26:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:01,877 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2018-11-10 12:26:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:26:01,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1575 states and 2191 transitions. [2018-11-10 12:26:01,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1512 [2018-11-10 12:26:01,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1575 states to 1575 states and 2191 transitions. [2018-11-10 12:26:01,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1575 [2018-11-10 12:26:01,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1575 [2018-11-10 12:26:01,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1575 states and 2191 transitions. [2018-11-10 12:26:01,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:01,892 INFO L705 BuchiCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2018-11-10 12:26:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states and 2191 transitions. [2018-11-10 12:26:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 609. [2018-11-10 12:26:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-10 12:26:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 841 transitions. [2018-11-10 12:26:01,904 INFO L728 BuchiCegarLoop]: Abstraction has 609 states and 841 transitions. [2018-11-10 12:26:01,904 INFO L608 BuchiCegarLoop]: Abstraction has 609 states and 841 transitions. [2018-11-10 12:26:01,904 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:26:01,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 609 states and 841 transitions. [2018-11-10 12:26:01,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 576 [2018-11-10 12:26:01,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:01,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:01,907 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, 1, 1] [2018-11-10 12:26:01,907 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, 1] [2018-11-10 12:26:01,908 INFO L793 eck$LassoCheckResult]: Stem: 4552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 4390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4391#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 4402#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4403#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 4515#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 4516#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 4553#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4451#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4452#L108 assume !(~P_1_pc~0 == 1); 4429#L108-2 is_P_1_triggered_~__retres1~0 := 0; 4525#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4529#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4581#L481 assume !(activate_threads_~tmp~1 != 0); 4582#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4547#L176 assume !(~P_2_pc~0 == 1); 4548#L176-2 is_P_2_triggered_~__retres1~1 := 0; 4549#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4475#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4476#L489 assume !(activate_threads_~tmp___0~1 != 0); 4586#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4591#L258 assume !(~C_1_pc~0 == 1); 4588#L258-2 assume !(~C_1_pc~0 == 2); 4488#L268-1 is_C_1_triggered_~__retres1~2 := 0; 4489#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4495#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4425#L497 assume !(activate_threads_~tmp___1~1 != 0); 4426#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4439#L422 assume { :end_inline_reset_delta_events } true; 4496#L551-3 [2018-11-10 12:26:01,908 INFO L795 eck$LassoCheckResult]: Loop: 4496#L551-3 assume true; 4834#L551-1 assume !false; 4827#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 4823#L387 assume true; 4821#L347-1 assume !false; 4818#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4733#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4730#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4719#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4714#L352 assume !(eval_~tmp___2~0 != 0); 4453#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 4392#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 4393#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4454#L108-6 assume ~P_1_pc~0 == 1; 4407#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 4408#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4890#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4891#L481-6 assume !(activate_threads_~tmp~1 != 0); 4556#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4550#L176-6 assume !(~P_2_pc~0 == 1); 4551#L176-8 is_P_2_triggered_~__retres1~1 := 0; 4961#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4959#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4957#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 4955#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4953#L258-6 assume !(~C_1_pc~0 == 1); 4951#L258-8 assume !(~C_1_pc~0 == 2); 4949#L268-5 is_C_1_triggered_~__retres1~2 := 0; 4947#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4945#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4943#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 4941#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4939#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4934#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4933#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4929#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4544#L570 assume !(start_simulation_~tmp~3 == 0); 4514#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4420#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 4421#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4851#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4850#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 4485#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 4486#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 4840#L583 assume !(start_simulation_~tmp___0~2 != 0); 4496#L551-3 [2018-11-10 12:26:01,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 1 times [2018-11-10 12:26:01,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:01,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 261148921, now seen corresponding path program 2 times [2018-11-10 12:26:01,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:01,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:01,975 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-10 12:26:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:01,975 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:26:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:26:01,976 INFO L87 Difference]: Start difference. First operand 609 states and 841 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-10 12:26:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:02,045 INFO L93 Difference]: Finished difference Result 1075 states and 1473 transitions. [2018-11-10 12:26:02,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:26:02,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1075 states and 1473 transitions. [2018-11-10 12:26:02,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1042 [2018-11-10 12:26:02,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1075 states to 1075 states and 1473 transitions. [2018-11-10 12:26:02,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1075 [2018-11-10 12:26:02,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1075 [2018-11-10 12:26:02,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1075 states and 1473 transitions. [2018-11-10 12:26:02,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:02,060 INFO L705 BuchiCegarLoop]: Abstraction has 1075 states and 1473 transitions. [2018-11-10 12:26:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states and 1473 transitions. [2018-11-10 12:26:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 621. [2018-11-10 12:26:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 12:26:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 853 transitions. [2018-11-10 12:26:02,072 INFO L728 BuchiCegarLoop]: Abstraction has 621 states and 853 transitions. [2018-11-10 12:26:02,072 INFO L608 BuchiCegarLoop]: Abstraction has 621 states and 853 transitions. [2018-11-10 12:26:02,073 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:26:02,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 853 transitions. [2018-11-10 12:26:02,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-10 12:26:02,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:02,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:02,076 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, 1, 1] [2018-11-10 12:26:02,076 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, 1, 1, 1] [2018-11-10 12:26:02,076 INFO L793 eck$LassoCheckResult]: Stem: 6242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 6090#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 6091#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 6102#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6103#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 6202#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 6203#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 6243#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6150#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6151#L108 assume !(~P_1_pc~0 == 1); 6129#L108-2 is_P_1_triggered_~__retres1~0 := 0; 6213#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6286#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6266#L481 assume !(activate_threads_~tmp~1 != 0); 6267#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6238#L176 assume !(~P_2_pc~0 == 1); 6239#L176-2 is_P_2_triggered_~__retres1~1 := 0; 6240#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6174#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6175#L489 assume !(activate_threads_~tmp___0~1 != 0); 6272#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6280#L258 assume !(~C_1_pc~0 == 1); 6276#L258-2 assume !(~C_1_pc~0 == 2); 6185#L268-1 is_C_1_triggered_~__retres1~2 := 0; 6186#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6189#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6125#L497 assume !(activate_threads_~tmp___1~1 != 0); 6126#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6138#L422 assume { :end_inline_reset_delta_events } true; 6190#L551-3 [2018-11-10 12:26:02,077 INFO L795 eck$LassoCheckResult]: Loop: 6190#L551-3 assume true; 6199#L551-1 assume !false; 6106#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 6070#L387 assume true; 6071#L347-1 assume !false; 6154#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6097#L318 assume !(~P_1_st~0 == 0); 6099#L322 assume !(~P_2_st~0 == 0); 6155#L326 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 6156#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6285#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 6416#L352 assume !(eval_~tmp___2~0 != 0); 6152#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 6092#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 6093#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6153#L108-6 assume !(~P_1_pc~0 == 1); 6172#L108-8 is_P_1_triggered_~__retres1~0 := 0; 6326#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6320#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6314#L481-6 assume !(activate_threads_~tmp~1 != 0); 6246#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6241#L176-6 assume !(~P_2_pc~0 == 1); 6221#L176-8 is_P_2_triggered_~__retres1~1 := 0; 6222#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6163#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6164#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 6268#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6269#L258-6 assume !(~C_1_pc~0 == 1); 6247#L258-8 assume !(~C_1_pc~0 == 2); 6144#L268-5 is_C_1_triggered_~__retres1~2 := 0; 6145#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6184#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6080#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 6081#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6191#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6114#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 6115#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6236#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6235#L570 assume !(start_simulation_~tmp~3 == 0); 6206#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6122#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 6123#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6215#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 6216#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 6183#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 6082#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 6083#L583 assume !(start_simulation_~tmp___0~2 != 0); 6190#L551-3 [2018-11-10 12:26:02,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 2 times [2018-11-10 12:26:02,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:02,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2011966143, now seen corresponding path program 1 times [2018-11-10 12:26:02,091 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:02,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:02,123 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-10 12:26:02,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:02,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:02,123 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:02,124 INFO L87 Difference]: Start difference. First operand 621 states and 853 transitions. cyclomatic complexity: 233 Second operand 3 states. [2018-11-10 12:26:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:02,170 INFO L93 Difference]: Finished difference Result 1081 states and 1463 transitions. [2018-11-10 12:26:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:02,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1081 states and 1463 transitions. [2018-11-10 12:26:02,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1048 [2018-11-10 12:26:02,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1081 states to 1081 states and 1463 transitions. [2018-11-10 12:26:02,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1081 [2018-11-10 12:26:02,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1081 [2018-11-10 12:26:02,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1081 states and 1463 transitions. [2018-11-10 12:26:02,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:02,183 INFO L705 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-10 12:26:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states and 1463 transitions. [2018-11-10 12:26:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2018-11-10 12:26:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-11-10 12:26:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1463 transitions. [2018-11-10 12:26:02,199 INFO L728 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-10 12:26:02,200 INFO L608 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-10 12:26:02,200 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:26:02,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1463 transitions. [2018-11-10 12:26:02,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1048 [2018-11-10 12:26:02,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:02,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:02,205 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, 1, 1] [2018-11-10 12:26:02,205 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, 1, 1, 1] [2018-11-10 12:26:02,205 INFO L793 eck$LassoCheckResult]: Stem: 7954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 7798#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7799#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 7809#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7810#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 7913#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 7914#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 7955#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7858#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7859#L108 assume !(~P_1_pc~0 == 1); 7834#L108-2 is_P_1_triggered_~__retres1~0 := 0; 7924#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 7999#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7977#L481 assume !(activate_threads_~tmp~1 != 0); 7978#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7949#L176 assume !(~P_2_pc~0 == 1); 7950#L176-2 is_P_2_triggered_~__retres1~1 := 0; 7951#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7882#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7883#L489 assume !(activate_threads_~tmp___0~1 != 0); 7983#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7993#L258 assume !(~C_1_pc~0 == 1); 7988#L258-2 assume !(~C_1_pc~0 == 2); 7893#L268-1 is_C_1_triggered_~__retres1~2 := 0; 7894#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 7899#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7830#L497 assume !(activate_threads_~tmp___1~1 != 0); 7831#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7844#L422 assume { :end_inline_reset_delta_events } true; 7900#L551-3 [2018-11-10 12:26:02,205 INFO L795 eck$LassoCheckResult]: Loop: 7900#L551-3 assume true; 8168#L551-1 assume !false; 8164#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 8162#L387 assume true; 8161#L347-1 assume !false; 8160#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8158#L318 assume !(~P_1_st~0 == 0); 8159#L322 assume !(~P_2_st~0 == 0); 8258#L326 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 8256#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8254#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8251#L352 assume !(eval_~tmp___2~0 != 0); 8249#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 8247#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 8245#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8243#L108-6 assume ~P_1_pc~0 == 1; 8240#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 8239#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8238#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8236#L481-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 8235#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8233#L176-6 assume !(~P_2_pc~0 == 1); 8231#L176-8 is_P_2_triggered_~__retres1~1 := 0; 8230#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8227#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8225#L489-6 assume activate_threads_~tmp___0~1 != 0;~P_2_st~0 := 0; 8224#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8223#L258-6 assume !(~C_1_pc~0 == 1); 8222#L258-8 assume !(~C_1_pc~0 == 2); 8220#L268-5 is_C_1_triggered_~__retres1~2 := 0; 8218#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8216#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8212#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 8209#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8208#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8206#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 8204#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8201#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8198#L570 assume !(start_simulation_~tmp~3 == 0); 8195#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8192#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 8190#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8187#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8182#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 8180#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 8177#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8172#L583 assume !(start_simulation_~tmp___0~2 != 0); 7900#L551-3 [2018-11-10 12:26:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 3 times [2018-11-10 12:26:02,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1602464610, now seen corresponding path program 1 times [2018-11-10 12:26:02,219 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:02,280 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-10 12:26:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:02,280 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:26:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:26:02,281 INFO L87 Difference]: Start difference. First operand 1081 states and 1463 transitions. cyclomatic complexity: 383 Second operand 5 states. [2018-11-10 12:26:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:02,355 INFO L93 Difference]: Finished difference Result 2401 states and 3246 transitions. [2018-11-10 12:26:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:26:02,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2401 states and 3246 transitions. [2018-11-10 12:26:02,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2368 [2018-11-10 12:26:02,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2401 states to 2401 states and 3246 transitions. [2018-11-10 12:26:02,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2401 [2018-11-10 12:26:02,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2401 [2018-11-10 12:26:02,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2401 states and 3246 transitions. [2018-11-10 12:26:02,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:02,371 INFO L705 BuchiCegarLoop]: Abstraction has 2401 states and 3246 transitions. [2018-11-10 12:26:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states and 3246 transitions. [2018-11-10 12:26:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1117. [2018-11-10 12:26:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-10 12:26:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1490 transitions. [2018-11-10 12:26:02,384 INFO L728 BuchiCegarLoop]: Abstraction has 1117 states and 1490 transitions. [2018-11-10 12:26:02,385 INFO L608 BuchiCegarLoop]: Abstraction has 1117 states and 1490 transitions. [2018-11-10 12:26:02,385 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:26:02,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1490 transitions. [2018-11-10 12:26:02,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1084 [2018-11-10 12:26:02,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:02,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:02,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:02,388 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:02,389 INFO L793 eck$LassoCheckResult]: Stem: 11452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 11294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 11295#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 11305#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 11306#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 11409#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 11410#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 11453#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 11354#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11355#L108 assume !(~P_1_pc~0 == 1); 11330#L108-2 is_P_1_triggered_~__retres1~0 := 0; 11420#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11496#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11478#L481 assume !(activate_threads_~tmp~1 != 0); 11479#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11447#L176 assume !(~P_2_pc~0 == 1); 11448#L176-2 is_P_2_triggered_~__retres1~1 := 0; 11449#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11380#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11381#L489 assume !(activate_threads_~tmp___0~1 != 0); 11485#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11493#L258 assume !(~C_1_pc~0 == 1); 11489#L258-2 assume !(~C_1_pc~0 == 2); 11390#L268-1 is_C_1_triggered_~__retres1~2 := 0; 11391#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11395#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11326#L497 assume !(activate_threads_~tmp___1~1 != 0); 11327#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11340#L422 assume { :end_inline_reset_delta_events } true; 11396#L551-3 [2018-11-10 12:26:02,389 INFO L795 eck$LassoCheckResult]: Loop: 11396#L551-3 assume true; 11706#L551-1 assume !false; 11703#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 11700#L387 assume true; 11698#L347-1 assume !false; 11697#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11696#L318 assume !(~P_1_st~0 == 0); 11691#L322 assume !(~P_2_st~0 == 0); 11689#L326 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 11690#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11625#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11626#L352 assume !(eval_~tmp___2~0 != 0); 11667#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 11802#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 11801#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11599#L108-6 assume ~P_1_pc~0 == 1; 11601#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 11799#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11797#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11795#L481-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 11758#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11753#L176-6 assume !(~P_2_pc~0 == 1); 11751#L176-8 is_P_2_triggered_~__retres1~1 := 0; 11749#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11747#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11745#L489-6 assume !(activate_threads_~tmp___0~1 != 0); 11743#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11741#L258-6 assume !(~C_1_pc~0 == 1); 11739#L258-8 assume !(~C_1_pc~0 == 2); 11737#L268-5 is_C_1_triggered_~__retres1~2 := 0; 11735#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11733#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11731#L497-6 assume activate_threads_~tmp___1~1 != 0;~C_1_st~0 := 0; 11729#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11727#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11724#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 11722#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11720#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11717#L570 assume !(start_simulation_~tmp~3 == 0); 11715#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11713#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 11712#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11711#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11710#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 11709#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 11708#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11707#L583 assume !(start_simulation_~tmp___0~2 != 0); 11396#L551-3 [2018-11-10 12:26:02,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 4 times [2018-11-10 12:26:02,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1821319328, now seen corresponding path program 1 times [2018-11-10 12:26:02,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:02,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:02,461 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-10 12:26:02,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:02,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:26:02,462 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:26:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:26:02,462 INFO L87 Difference]: Start difference. First operand 1117 states and 1490 transitions. cyclomatic complexity: 374 Second operand 5 states. [2018-11-10 12:26:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:02,519 INFO L93 Difference]: Finished difference Result 2371 states and 3163 transitions. [2018-11-10 12:26:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:26:02,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2371 states and 3163 transitions. [2018-11-10 12:26:02,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2338 [2018-11-10 12:26:02,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2371 states to 2371 states and 3163 transitions. [2018-11-10 12:26:02,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2371 [2018-11-10 12:26:02,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2371 [2018-11-10 12:26:02,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2371 states and 3163 transitions. [2018-11-10 12:26:02,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:02,534 INFO L705 BuchiCegarLoop]: Abstraction has 2371 states and 3163 transitions. [2018-11-10 12:26:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states and 3163 transitions. [2018-11-10 12:26:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1147. [2018-11-10 12:26:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-11-10 12:26:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1509 transitions. [2018-11-10 12:26:02,547 INFO L728 BuchiCegarLoop]: Abstraction has 1147 states and 1509 transitions. [2018-11-10 12:26:02,548 INFO L608 BuchiCegarLoop]: Abstraction has 1147 states and 1509 transitions. [2018-11-10 12:26:02,548 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:26:02,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1147 states and 1509 transitions. [2018-11-10 12:26:02,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-10 12:26:02,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:02,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:02,551 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, 1, 1] [2018-11-10 12:26:02,551 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, 1, 1, 1] [2018-11-10 12:26:02,551 INFO L793 eck$LassoCheckResult]: Stem: 14955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 14796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 14797#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 14807#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 14808#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 14909#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 14910#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 14956#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14854#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14855#L108 assume !(~P_1_pc~0 == 1); 14832#L108-2 is_P_1_triggered_~__retres1~0 := 0; 14921#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15005#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14987#L481 assume !(activate_threads_~tmp~1 != 0); 14988#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14949#L176 assume !(~P_2_pc~0 == 1); 14950#L176-2 is_P_2_triggered_~__retres1~1 := 0; 14951#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14879#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14880#L489 assume !(activate_threads_~tmp___0~1 != 0); 14994#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15001#L258 assume !(~C_1_pc~0 == 1); 14997#L258-2 assume !(~C_1_pc~0 == 2); 14890#L268-1 is_C_1_triggered_~__retres1~2 := 0; 14891#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14895#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14828#L497 assume !(activate_threads_~tmp___1~1 != 0); 14829#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 14841#L422 assume { :end_inline_reset_delta_events } true; 14896#L551-3 [2018-11-10 12:26:02,552 INFO L795 eck$LassoCheckResult]: Loop: 14896#L551-3 assume true; 15301#L551-1 assume !false; 15299#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 15180#L387 assume true; 15296#L347-1 assume !false; 15294#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15291#L318 assume !(~P_1_st~0 == 0); 15292#L322 assume !(~P_2_st~0 == 0); 15530#L326 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 15487#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15466#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 15443#L352 assume !(eval_~tmp___2~0 != 0); 15434#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 15429#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 15428#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15427#L108-6 assume ~P_1_pc~0 == 1; 15424#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 15422#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15420#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15418#L481-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 15416#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15414#L176-6 assume !(~P_2_pc~0 == 1); 15412#L176-8 is_P_2_triggered_~__retres1~1 := 0; 15410#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15379#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15348#L489-6 assume !(activate_threads_~tmp___0~1 != 0); 15338#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15336#L258-6 assume !(~C_1_pc~0 == 1); 15334#L258-8 assume !(~C_1_pc~0 == 2); 15332#L268-5 is_C_1_triggered_~__retres1~2 := 0; 15330#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15328#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15326#L497-6 assume !(activate_threads_~tmp___1~1 != 0); 15324#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15322#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15319#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 15317#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15315#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 15312#L570 assume !(start_simulation_~tmp~3 == 0); 15310#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15308#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 15307#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15306#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 15305#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 15304#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 15303#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 15302#L583 assume !(start_simulation_~tmp___0~2 != 0); 14896#L551-3 [2018-11-10 12:26:02,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 5 times [2018-11-10 12:26:02,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash 541455650, now seen corresponding path program 1 times [2018-11-10 12:26:02,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:02,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:02,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1807088919, now seen corresponding path program 1 times [2018-11-10 12:26:02,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:02,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:02,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:02,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:02,597 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-10 12:26:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:02,742 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-10 12:26:02,796 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:26:02,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:26:02,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:26:02,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:26:02,797 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:26:02,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:02,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:26:02,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:26:02,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 12:26:02,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:26:02,798 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:26:02,815 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-10 12:26:02,822 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-10 12:26:02,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,825 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-10 12:26:02,827 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-10 12:26:02,829 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-10 12:26:02,831 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-10 12:26:02,833 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-10 12:26:02,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,842 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-10 12:26:02,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,863 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-10 12:26:02,865 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-10 12:26:02,868 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-10 12:26:02,870 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-10 12:26:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:26:02,876 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-10 12:26:02,878 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-10 12:26:02,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-10 12:26:02,888 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-10 12:26:02,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-10 12:26:02,893 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-10 12:26:03,055 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:26:03,056 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,064 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,085 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,085 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 12:26:03,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,119 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,131 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,131 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 12:26:03,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,176 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-10 12:26:03,199 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,199 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,224 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,224 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,245 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,245 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,266 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,266 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,299 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,300 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=-2} Honda state: {~P_2_pc~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,331 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,331 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,349 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,351 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,351 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,371 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,371 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,391 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,391 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,430 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,430 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,451 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,451 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,471 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,471 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,500 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:26:03,500 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:26:03,526 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:26:03,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:26:03,573 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:26:03,574 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:26:03,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:26:03,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:26:03,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:26:03,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:26:03,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:26:03,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:26:03,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:26:03,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-10 12:26:03,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:26:03,575 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:26:03,577 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-10 12:26:03,579 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-10 12:26:03,585 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-10 12:26:03,589 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-10 12:26:03,591 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-10 12:26:03,593 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-10 12:26:03,594 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-10 12:26:03,596 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-10 12:26:03,598 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-10 12:26:03,600 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-10 12:26:03,601 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-10 12:26:03,602 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-10 12:26:03,604 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-10 12:26:03,606 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-10 12:26:03,608 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-10 12:26:03,610 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-10 12:26:03,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-10 12:26:03,620 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-10 12:26:03,627 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-10 12:26:03,629 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-10 12:26:03,632 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-10 12:26:03,637 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-10 12:26:03,639 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-10 12:26:03,641 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-10 12:26:03,647 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-10 12:26:03,652 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-10 12:26:03,654 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-10 12:26:03,656 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-10 12:26:03,803 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:26:03,808 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:26:03,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,833 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,849 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,851 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,860 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,863 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:26:03,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:26:03,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,890 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 12:26:03,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-10 12:26:03,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,890 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,891 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,893 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,900 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,900 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,902 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,904 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,905 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,906 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,907 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,908 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:03,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,912 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,915 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,918 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,921 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,922 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,924 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:03,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,926 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:03,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,931 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,934 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,935 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,936 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:03,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,938 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,938 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:03,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,941 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,943 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,943 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,945 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,946 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,948 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,950 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,951 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,954 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,955 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:03,960 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:03,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,961 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 12:26:03,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-10 12:26:03,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,964 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,965 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,969 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,970 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,972 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,974 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,974 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,978 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,978 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,980 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,980 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,981 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:03,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,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-10 12:26:03,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,991 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:03,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:03,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,996 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:03,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:03,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:03,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:03,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:03,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:03,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:03,997 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:03,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:03,998 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:03,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,005 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,030 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,037 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,038 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,041 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,041 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,042 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 12:26:04,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-10 12:26:04,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,043 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,055 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,055 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,060 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,061 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,063 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,065 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,074 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,075 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,077 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,077 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,079 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,080 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,090 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,091 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,095 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,096 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,109 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,110 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,112 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,112 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,116 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,116 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,129 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,129 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,129 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,135 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,136 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,139 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,139 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,147 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,147 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,147 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,149 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,149 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,166 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,166 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,169 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,169 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,180 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,180 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,183 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,184 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,191 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,191 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,195 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,195 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:26:04,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,198 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,198 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,199 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 12:26:04,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,207 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,207 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,209 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,210 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,225 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,230 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,230 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,231 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,235 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,235 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,236 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,250 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,250 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,250 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,252 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,252 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:04,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,270 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,270 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,271 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,272 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,273 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,275 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,275 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,291 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,291 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,293 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,293 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,293 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,296 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,297 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,297 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:04,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,312 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,312 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,313 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:04,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,331 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,332 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,332 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,335 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,335 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,336 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,338 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,338 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:04,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,344 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,344 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:04,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,349 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,349 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,350 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,360 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,365 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,368 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,382 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,382 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,383 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,390 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,390 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,390 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,394 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,394 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,405 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 12:26:04,406 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 12:26:04,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,407 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 12:26:04,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,408 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,411 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,412 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,413 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,434 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,439 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,442 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,442 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,455 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,455 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,459 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,459 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,462 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,464 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,478 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,481 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,485 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,501 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,502 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,502 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,505 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,509 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,510 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,510 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,525 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,526 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,526 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,527 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,534 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,539 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,553 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,553 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,559 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,569 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,569 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,571 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,577 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,578 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,579 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,584 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,585 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,586 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,590 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,590 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,591 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,595 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,595 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,605 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,606 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,610 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,617 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,679 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,688 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 12:26:04,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,689 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 12:26:04,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,690 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,690 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,693 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,695 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,697 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,719 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,719 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,720 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,722 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,722 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,723 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,725 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,726 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,728 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,728 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,729 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,731 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,731 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,732 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,739 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,740 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,742 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,743 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,746 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,746 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,748 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,749 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,751 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,752 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,767 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,767 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,768 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,770 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,770 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,771 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,779 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,779 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,781 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,794 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,796 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,798 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,799 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,799 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,801 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,802 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,802 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,803 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,824 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,824 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,824 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,826 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 12:26:04,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,833 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,833 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,835 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,837 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,837 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,838 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,855 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,858 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,859 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,859 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,884 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,893 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:04,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 12:26:04,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 12:26:04,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,901 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 12:26:04,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,919 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,920 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,925 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,926 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,945 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,948 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,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-10 12:26:04,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,950 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,950 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,976 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,979 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:04,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:04,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:04,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:04,983 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:04,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:04,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:04,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:04,983 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:04,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:04,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:04,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:04,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,007 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,009 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,035 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,042 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,043 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:05,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,067 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,067 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,068 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:05,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,080 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,099 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,099 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:05,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,103 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,104 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:26:05,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,136 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,136 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,137 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,139 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,169 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,169 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,176 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,202 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 12:26:05,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 12:26:05,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:26:05,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,206 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 12:26:05,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-10 12:26:05,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,209 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,213 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,214 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,250 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,250 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,254 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,276 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,277 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,280 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,281 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,284 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,285 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,285 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 12:26:05,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,314 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,314 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,318 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,318 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,322 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,324 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,345 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,345 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,349 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,349 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,353 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,353 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,378 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,379 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,379 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,379 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 12:26:05,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,386 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 12:26:05,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,398 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,415 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,416 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,420 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,420 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,420 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 12:26:05,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,425 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,425 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:26:05,425 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,426 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 12:26:05,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,449 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,449 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,455 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,455 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,456 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,459 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,460 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,485 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,485 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,489 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,489 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,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-10 12:26:05,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,520 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,520 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:26:05,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 12:26:05,525 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 12:26:05,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:26:05,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:26:05,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:26:05,526 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 12:26:05,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:26:05,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:26:05,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:26:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:05,531 INFO L87 Difference]: Start difference. First operand 1147 states and 1509 transitions. cyclomatic complexity: 363 Second operand 3 states. [2018-11-10 12:26:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:05,836 INFO L93 Difference]: Finished difference Result 1147 states and 1493 transitions. [2018-11-10 12:26:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:05,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1147 states and 1493 transitions. [2018-11-10 12:26:05,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-10 12:26:05,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1147 states to 1147 states and 1493 transitions. [2018-11-10 12:26:05,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1147 [2018-11-10 12:26:05,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1147 [2018-11-10 12:26:05,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1147 states and 1493 transitions. [2018-11-10 12:26:05,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:05,852 INFO L705 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-10 12:26:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states and 1493 transitions. [2018-11-10 12:26:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2018-11-10 12:26:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-11-10 12:26:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1493 transitions. [2018-11-10 12:26:05,871 INFO L728 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-10 12:26:05,871 INFO L608 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-10 12:26:05,871 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:26:05,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1147 states and 1493 transitions. [2018-11-10 12:26:05,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-10 12:26:05,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:05,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:05,876 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, 1, 1] [2018-11-10 12:26:05,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 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, 1, 1, 1, 1] [2018-11-10 12:26:05,877 INFO L793 eck$LassoCheckResult]: Stem: 17249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 17100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 17101#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 17109#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 17110#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 17210#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 17211#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 17251#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 17156#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17157#L108 assume !(~P_1_pc~0 == 1); 17134#L108-2 is_P_1_triggered_~__retres1~0 := 0; 17220#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17291#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17273#L481 assume !(activate_threads_~tmp~1 != 0); 17274#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17245#L176 assume !(~P_2_pc~0 == 1); 17246#L176-2 is_P_2_triggered_~__retres1~1 := 0; 17247#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17180#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17181#L489 assume !(activate_threads_~tmp___0~1 != 0); 17279#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17287#L258 assume !(~C_1_pc~0 == 1); 17281#L258-2 assume !(~C_1_pc~0 == 2); 17190#L268-1 is_C_1_triggered_~__retres1~2 := 0; 17191#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17195#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17130#L497 assume !(activate_threads_~tmp___1~1 != 0); 17131#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 17145#L422 assume { :end_inline_reset_delta_events } true; 17196#L551-3 [2018-11-10 12:26:05,877 INFO L795 eck$LassoCheckResult]: Loop: 17196#L551-3 assume true; 17689#L551-1 assume !false; 17493#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 17490#L387 assume true; 17488#L347-1 assume !false; 17486#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17484#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 17482#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17480#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17478#L352 assume eval_~tmp___2~0 != 0; 17476#L352-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17473#L361 assume eval_~tmp~0 != 0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 17474#L73 assume ~P_1_pc~0 == 0; 17682#L77 assume true; 17680#L84 assume !(~i~0 < ~max_loop~0); 17672#L96 ~P_1_st~0 := 2; 17464#L100 assume { :end_inline_P_1 } true; 17462#L357 assume !(~P_2_st~0 == 0); 17218#L372 assume !(~C_1_st~0 == 0); 17080#L387 assume true; 17081#L347-1 assume !false; 17160#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17107#L318 assume !(~P_1_st~0 == 0); 17108#L322 assume !(~P_2_st~0 == 0); 17161#L326 assume !(~C_1_st~0 == 0);exists_runnable_thread_~__retres1~3 := 0; 17163#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18132#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 18133#L352 assume !(eval_~tmp___2~0 != 0); 17158#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 17098#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 17099#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17159#L108-6 assume ~P_1_pc~0 == 1; 17113#L109-2 assume ~P_1_ev~0 == 1;is_P_1_triggered_~__retres1~0 := 1; 17114#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 18131#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 18130#L481-6 assume activate_threads_~tmp~1 != 0;~P_1_st~0 := 0; 17253#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17248#L176-6 assume !(~P_2_pc~0 == 1); 17228#L176-8 is_P_2_triggered_~__retres1~1 := 0; 17229#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17171#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17172#L489-6 assume !(activate_threads_~tmp___0~1 != 0); 17272#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17256#L258-6 assume !(~C_1_pc~0 == 1); 17254#L258-8 assume !(~C_1_pc~0 == 2); 17150#L268-5 is_C_1_triggered_~__retres1~2 := 0; 17151#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17189#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17285#L497-6 assume !(activate_threads_~tmp___1~1 != 0); 18148#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18146#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18144#L318-1 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 18142#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18140#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 18138#L570 assume !(start_simulation_~tmp~3 == 0); 18136#L570-2 assume { :begin_inline_stop_simulation } true;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;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18135#L318-2 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 18110#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18109#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 18108#L525 assume stop_simulation_~tmp~2 != 0;stop_simulation_~__retres2~0 := 0; 17694#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 17693#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17690#L583 assume !(start_simulation_~tmp___0~2 != 0); 17196#L551-3 [2018-11-10 12:26:05,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 6 times [2018-11-10 12:26:05,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:05,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:05,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1013796560, now seen corresponding path program 1 times [2018-11-10 12:26:05,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:05,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:05,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:26:05,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:05,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:05,974 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:26:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:05,974 INFO L87 Difference]: Start difference. First operand 1147 states and 1493 transitions. cyclomatic complexity: 347 Second operand 3 states. [2018-11-10 12:26:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:06,137 INFO L93 Difference]: Finished difference Result 1920 states and 2481 transitions. [2018-11-10 12:26:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:06,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1920 states and 2481 transitions. [2018-11-10 12:26:06,145 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1876 [2018-11-10 12:26:06,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1920 states to 1920 states and 2481 transitions. [2018-11-10 12:26:06,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1920 [2018-11-10 12:26:06,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1920 [2018-11-10 12:26:06,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1920 states and 2481 transitions. [2018-11-10 12:26:06,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:06,157 INFO L705 BuchiCegarLoop]: Abstraction has 1920 states and 2481 transitions. [2018-11-10 12:26:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states and 2481 transitions. [2018-11-10 12:26:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1904. [2018-11-10 12:26:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-11-10 12:26:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2461 transitions. [2018-11-10 12:26:06,182 INFO L728 BuchiCegarLoop]: Abstraction has 1904 states and 2461 transitions. [2018-11-10 12:26:06,182 INFO L608 BuchiCegarLoop]: Abstraction has 1904 states and 2461 transitions. [2018-11-10 12:26:06,182 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:26:06,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1904 states and 2461 transitions. [2018-11-10 12:26:06,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1860 [2018-11-10 12:26:06,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:06,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:06,188 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, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,188 INFO L793 eck$LassoCheckResult]: Stem: 20338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 20170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 20171#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 20181#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 20182#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 20288#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 20289#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 20339#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 20230#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 20231#L108 assume !(~P_1_pc~0 == 1); 20301#L108-2 is_P_1_triggered_~__retres1~0 := 0; 20302#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 20207#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 20208#L481 assume !(activate_threads_~tmp~1 != 0); 20369#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20331#L176 assume !(~P_2_pc~0 == 1); 20332#L176-2 is_P_2_triggered_~__retres1~1 := 0; 20333#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20255#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 20256#L489 assume !(activate_threads_~tmp___0~1 != 0); 20374#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20382#L258 assume !(~C_1_pc~0 == 1); 20380#L258-2 assume !(~C_1_pc~0 == 2); 20266#L268-1 is_C_1_triggered_~__retres1~2 := 0; 20267#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 20271#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 20205#L497 assume !(activate_threads_~tmp___1~1 != 0); 20206#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 20215#L422 assume { :end_inline_reset_delta_events } true; 20272#L551-3 assume true; 21554#L551-1 assume !false; 21519#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 21516#L387 [2018-11-10 12:26:06,189 INFO L795 eck$LassoCheckResult]: Loop: 21516#L387 assume true; 21510#L347-1 assume !false; 21508#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21506#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 21501#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21497#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 21493#L352 assume eval_~tmp___2~0 != 0; 21489#L352-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 21484#L361 assume !(eval_~tmp~0 != 0); 21480#L357 assume !(~P_2_st~0 == 0); 21479#L372 assume !(~C_1_st~0 == 0); 21516#L387 [2018-11-10 12:26:06,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 1 times [2018-11-10 12:26:06,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 1 times [2018-11-10 12:26:06,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash -825812880, now seen corresponding path program 1 times [2018-11-10 12:26:06,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:06,223 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-10 12:26:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:06,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:06,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:06,262 INFO L87 Difference]: Start difference. First operand 1904 states and 2461 transitions. cyclomatic complexity: 560 Second operand 3 states. [2018-11-10 12:26:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:06,293 INFO L93 Difference]: Finished difference Result 3071 states and 3921 transitions. [2018-11-10 12:26:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:06,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3071 states and 3921 transitions. [2018-11-10 12:26:06,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2989 [2018-11-10 12:26:06,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3071 states to 3071 states and 3921 transitions. [2018-11-10 12:26:06,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3071 [2018-11-10 12:26:06,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3071 [2018-11-10 12:26:06,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3071 states and 3921 transitions. [2018-11-10 12:26:06,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:06,380 INFO L705 BuchiCegarLoop]: Abstraction has 3071 states and 3921 transitions. [2018-11-10 12:26:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states and 3921 transitions. [2018-11-10 12:26:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2971. [2018-11-10 12:26:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2018-11-10 12:26:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 3801 transitions. [2018-11-10 12:26:06,416 INFO L728 BuchiCegarLoop]: Abstraction has 2971 states and 3801 transitions. [2018-11-10 12:26:06,416 INFO L608 BuchiCegarLoop]: Abstraction has 2971 states and 3801 transitions. [2018-11-10 12:26:06,416 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:26:06,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2971 states and 3801 transitions. [2018-11-10 12:26:06,424 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-10 12:26:06,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:06,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:06,425 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, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,425 INFO L793 eck$LassoCheckResult]: Stem: 25331#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 25153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 25154#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 25166#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 25167#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 25277#L295-2 assume !(~P_2_i~0 == 1);~P_2_st~0 := 2; 25278#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 27563#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 27562#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 27561#L108 assume !(~P_1_pc~0 == 1); 27560#L108-2 is_P_1_triggered_~__retres1~0 := 0; 27559#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 27558#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 27557#L481 assume !(activate_threads_~tmp~1 != 0); 27556#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 27555#L176 assume !(~P_2_pc~0 == 1); 27554#L176-2 is_P_2_triggered_~__retres1~1 := 0; 27553#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 27552#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27551#L489 assume !(activate_threads_~tmp___0~1 != 0); 27550#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 27549#L258 assume !(~C_1_pc~0 == 1); 25370#L258-2 assume !(~C_1_pc~0 == 2); 25253#L268-1 is_C_1_triggered_~__retres1~2 := 0; 25254#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 25259#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 25187#L497 assume !(activate_threads_~tmp___1~1 != 0); 25188#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 27508#L422 assume { :end_inline_reset_delta_events } true; 27506#L551-3 assume true; 27503#L551-1 assume !false; 27499#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 27496#L387 [2018-11-10 12:26:06,425 INFO L795 eck$LassoCheckResult]: Loop: 27496#L387 assume true; 27495#L347-1 assume !false; 27494#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27493#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 27492#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27491#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 27490#L352 assume eval_~tmp___2~0 != 0; 27489#L352-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 25286#L361 assume !(eval_~tmp~0 != 0); 25287#L357 assume !(~P_2_st~0 == 0); 27497#L372 assume !(~C_1_st~0 == 0); 27496#L387 [2018-11-10 12:26:06,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -381421525, now seen corresponding path program 1 times [2018-11-10 12:26:06,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:06,451 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-10 12:26:06,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:06,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:26:06,452 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:26:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 2 times [2018-11-10 12:26:06,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:06,493 INFO L87 Difference]: Start difference. First operand 2971 states and 3801 transitions. cyclomatic complexity: 833 Second operand 3 states. [2018-11-10 12:26:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:06,513 INFO L93 Difference]: Finished difference Result 2945 states and 3774 transitions. [2018-11-10 12:26:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:06,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2945 states and 3774 transitions. [2018-11-10 12:26:06,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-10 12:26:06,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2945 states to 2945 states and 3774 transitions. [2018-11-10 12:26:06,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2945 [2018-11-10 12:26:06,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2945 [2018-11-10 12:26:06,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2945 states and 3774 transitions. [2018-11-10 12:26:06,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:06,542 INFO L705 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-10 12:26:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states and 3774 transitions. [2018-11-10 12:26:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2018-11-10 12:26:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2018-11-10 12:26:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 3774 transitions. [2018-11-10 12:26:06,576 INFO L728 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-10 12:26:06,576 INFO L608 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-10 12:26:06,576 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 12:26:06,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2945 states and 3774 transitions. [2018-11-10 12:26:06,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-10 12:26:06,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:06,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:06,583 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, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,584 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,584 INFO L793 eck$LassoCheckResult]: Stem: 31243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 31077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 31078#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 31088#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 31089#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 31197#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 31198#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 31245#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 31134#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 31135#L108 assume !(~P_1_pc~0 == 1); 31207#L108-2 is_P_1_triggered_~__retres1~0 := 0; 31208#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 31111#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 31112#L481 assume !(activate_threads_~tmp~1 != 0); 31271#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 31236#L176 assume !(~P_2_pc~0 == 1); 31237#L176-2 is_P_2_triggered_~__retres1~1 := 0; 31238#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 31162#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 31163#L489 assume !(activate_threads_~tmp___0~1 != 0); 31276#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 31285#L258 assume !(~C_1_pc~0 == 1); 31278#L258-2 assume !(~C_1_pc~0 == 2); 31174#L268-1 is_C_1_triggered_~__retres1~2 := 0; 31175#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 31179#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 31109#L497 assume !(activate_threads_~tmp___1~1 != 0); 31110#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 31123#L422 assume { :end_inline_reset_delta_events } true; 31180#L551-3 assume true; 32741#L551-1 assume !false; 32554#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 32555#L387 [2018-11-10 12:26:06,584 INFO L795 eck$LassoCheckResult]: Loop: 32555#L387 assume true; 32831#L347-1 assume !false; 32830#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 32536#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 32533#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 32534#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 32616#L352 assume eval_~tmp___2~0 != 0; 32614#L352-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 32523#L361 assume !(eval_~tmp~0 != 0); 32497#L357 assume ~P_2_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32493#L376 assume !(eval_~tmp___0~0 != 0); 32494#L372 assume !(~C_1_st~0 == 0); 32555#L387 [2018-11-10 12:26:06,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 2 times [2018-11-10 12:26:06,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:06,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1871491567, now seen corresponding path program 1 times [2018-11-10 12:26:06,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:06,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 169462935, now seen corresponding path program 1 times [2018-11-10 12:26:06,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:26:06,629 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-10 12:26:06,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:26:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:26:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:26:06,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:26:06,673 INFO L87 Difference]: Start difference. First operand 2945 states and 3774 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-10 12:26:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:26:06,704 INFO L93 Difference]: Finished difference Result 4851 states and 6158 transitions. [2018-11-10 12:26:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:26:06,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4851 states and 6158 transitions. [2018-11-10 12:26:06,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4771 [2018-11-10 12:26:06,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4851 states to 4851 states and 6158 transitions. [2018-11-10 12:26:06,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4851 [2018-11-10 12:26:06,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4851 [2018-11-10 12:26:06,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4851 states and 6158 transitions. [2018-11-10 12:26:06,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:26:06,740 INFO L705 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-10 12:26:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states and 6158 transitions. [2018-11-10 12:26:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4851. [2018-11-10 12:26:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2018-11-10 12:26:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6158 transitions. [2018-11-10 12:26:06,787 INFO L728 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-10 12:26:06,788 INFO L608 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-10 12:26:06,788 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 12:26:06,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4851 states and 6158 transitions. [2018-11-10 12:26:06,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4771 [2018-11-10 12:26:06,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:26:06,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:26:06,800 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, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:26:06,800 INFO L793 eck$LassoCheckResult]: Stem: 39048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 38880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 38881#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;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;assume { :begin_inline_update_channels } true; 38891#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 38892#L295 assume ~P_1_i~0 == 1;~P_1_st~0 := 0; 38999#L295-2 assume ~P_2_i~0 == 1;~P_2_st~0 := 0; 39000#L300-1 assume ~C_1_i~0 == 1;~C_1_st~0 := 0; 39049#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 38939#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;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;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 38940#L108 assume !(~P_1_pc~0 == 1); 39010#L108-2 is_P_1_triggered_~__retres1~0 := 0; 39011#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38916#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38917#L481 assume !(activate_threads_~tmp~1 != 0); 39081#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 39041#L176 assume !(~P_2_pc~0 == 1); 39042#L176-2 is_P_2_triggered_~__retres1~1 := 0; 39043#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 38966#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 38967#L489 assume !(activate_threads_~tmp___0~1 != 0); 39083#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 39091#L258 assume !(~C_1_pc~0 == 1); 39086#L258-2 assume !(~C_1_pc~0 == 2); 38977#L268-1 is_C_1_triggered_~__retres1~2 := 0; 38978#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38983#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 38914#L497 assume !(activate_threads_~tmp___1~1 != 0); 38915#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 38924#L422 assume { :end_inline_reset_delta_events } true; 38984#L551-3 assume true; 40563#L551-1 assume !false; 40440#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;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; 40438#L387 [2018-11-10 12:26:06,800 INFO L795 eck$LassoCheckResult]: Loop: 40438#L387 assume true; 40436#L347-1 assume !false; 40434#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 40432#L318 assume ~P_1_st~0 == 0;exists_runnable_thread_~__retres1~3 := 1; 40430#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 40428#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 40426#L352 assume eval_~tmp___2~0 != 0; 40424#L352-1 assume ~P_1_st~0 == 0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 40419#L361 assume !(eval_~tmp~0 != 0); 40417#L357 assume ~P_2_st~0 == 0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 40394#L376 assume !(eval_~tmp___0~0 != 0); 40415#L372 assume ~C_1_st~0 == 0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 40441#L391 assume !(eval_~tmp___1~0 != 0); 40438#L387 [2018-11-10 12:26:06,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 3 times [2018-11-10 12:26:06,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2113305569, now seen corresponding path program 1 times [2018-11-10 12:26:06,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:26:06,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:26:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash 958381687, now seen corresponding path program 1 times [2018-11-10 12:26:06,817 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:26:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:26:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:26:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:26:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:26:07,078 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-10 12:26:07,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:26:07 BoogieIcfgContainer [2018-11-10 12:26:07,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:26:07,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:26:07,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:26:07,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:26:07,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:26:00" (3/4) ... [2018-11-10 12:26:07,153 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 12:26:07,196 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b122722-fcb4-49a8-b154-3ee77a3154cd/bin-2019/uautomizer/witness.graphml [2018-11-10 12:26:07,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:26:07,197 INFO L168 Benchmark]: Toolchain (without parser) took 7132.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 959.2 MB in the beginning and 989.8 MB in the end (delta: -30.6 MB). Peak memory consumption was 244.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,197 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:26:07,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,198 INFO L168 Benchmark]: Boogie Preprocessor took 66.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,198 INFO L168 Benchmark]: RCFGBuilder took 553.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,198 INFO L168 Benchmark]: BuchiAutomizer took 6186.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 84.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,199 INFO L168 Benchmark]: Witness Printer took 46.87 ms. Allocated memory is still 1.3 GB. Free memory was 997.2 MB in the beginning and 989.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:26:07,200 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.00 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 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 33.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.1 MB in the beginning and 940.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 553.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6186.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 997.2 MB in the end (delta: 84.0 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. * Witness Printer took 46.87 ms. Allocated memory is still 1.3 GB. Free memory was 997.2 MB in the beginning and 989.8 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4851 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.7s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4076 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 4851 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3813 SDtfs, 4723 SDslu, 4970 SDs, 0 SdLazy, 311 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 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: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - 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@3975b5cb=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ff3aaa3=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f1efd2=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@242b02db=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@3d45f1bf=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@668bf66d=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53052d8=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@443f65e8=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e3944eb=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 [L623] CALL init_model() [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] RET C_1_i = 1 [L623] init_model() [L624] CALL start_simulation() [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L544] FCALL update_channels() [L545] CALL init_threads() [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] RET C_1_st = 0 [L545] init_threads() [L546] FCALL fire_delta_events() [L547] CALL activate_threads() [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L479] CALL, EXPR is_P_1_triggered() [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] RET return (__retres1); [L479] EXPR is_P_1_triggered() [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L487] CALL, EXPR is_P_2_triggered() [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] RET return (__retres1); [L487] EXPR is_P_2_triggered() [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L495] CALL, EXPR is_C_1_triggered() [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] RET return (__retres1); [L495] EXPR is_C_1_triggered() [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE, RET !(\read(tmp___1)) [L547] activate_threads() [L548] FCALL reset_delta_events() [L551] COND TRUE 1 [L554] kernel_st = 1 [L555] CALL eval() [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; Loop: [L347] COND TRUE 1 [L350] CALL, EXPR exists_runnable_thread() [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] RET return (__retres1); [L350] EXPR exists_runnable_thread() [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...