NO

Initial ITS
Start location: l4
   0: l0 -> l1 : x_5^0'=x_5^post0, Result_4^0'=Result_4^post0, y_6^0'=y_6^post0, (y_6^0-y_6^post0 == 0 /\ Result_4^0-Result_4^post0 == 0 /\ x_5^0-x_5^post0 == 0), cost: 1
   1: l1 -> l2 : x_5^0'=x_5^post1, Result_4^0'=Result_4^post1, y_6^0'=y_6^post1, (0 == 0 /\ y_6^0-y_6^post1 == 0 /\ -x_5^0+x_5^post1-y_6^0 == 0 /\ 1+x_5^post1 <= 0), cost: 1
   2: l1 -> l3 : x_5^0'=x_5^post2, Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, (y_6^0-y_6^post2 == 0 /\ -x_5^0+x_5^post2-y_6^0 == 0 /\ -x_5^post2 <= 0 /\ -Result_4^post2+Result_4^0 == 0), cost: 1
   3: l3 -> l1 : x_5^0'=x_5^post3, Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, (-Result_4^post3+Result_4^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ -y_6^post3+y_6^0 == 0), cost: 1
   4: l4 -> l0 : x_5^0'=x_5^post4, Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, (-Result_4^post4+Result_4^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l4
   0: l0 -> l1 : x_5^0'=x_5^post0, Result_4^0'=Result_4^post0, y_6^0'=y_6^post0, (y_6^0-y_6^post0 == 0 /\ Result_4^0-Result_4^post0 == 0 /\ x_5^0-x_5^post0 == 0), cost: 1
   2: l1 -> l3 : x_5^0'=x_5^post2, Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, (y_6^0-y_6^post2 == 0 /\ -x_5^0+x_5^post2-y_6^0 == 0 /\ -x_5^post2 <= 0 /\ -Result_4^post2+Result_4^0 == 0), cost: 1
   3: l3 -> l1 : x_5^0'=x_5^post3, Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, (-Result_4^post3+Result_4^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ -y_6^post3+y_6^0 == 0), cost: 1
   4: l4 -> l0 : x_5^0'=x_5^post4, Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, (-Result_4^post4+Result_4^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : x_5^0'=x_5^post0, Result_4^0'=Result_4^post0, y_6^0'=y_6^post0, (y_6^0-y_6^post0 == 0 /\ Result_4^0-Result_4^post0 == 0 /\ x_5^0-x_5^post0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : x_5^0'=x_5^post2, Result_4^0'=Result_4^post2, y_6^0'=y_6^post2, (y_6^0-y_6^post2 == 0 /\ -x_5^0+x_5^post2-y_6^0 == 0 /\ -x_5^post2 <= 0 /\ -Result_4^post2+Result_4^0 == 0), cost: 1
New rule:
l1 -> l3 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : x_5^0'=x_5^post3, Result_4^0'=Result_4^post3, y_6^0'=y_6^post3, (-Result_4^post3+Result_4^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ -y_6^post3+y_6^0 == 0), cost: 1
New rule:
l3 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l0 : x_5^0'=x_5^post4, Result_4^0'=Result_4^post4, y_6^0'=y_6^post4, (-Result_4^post4+Result_4^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -x_5^post4+x_5^0 == 0), cost: 1
New rule:
l4 -> l0 : TRUE, cost: 1

Simplified rules
Start location: l4
   5: l0 -> l1 : TRUE, cost: 1
   6: l1 -> l3 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 1
   7: l3 -> l1 : TRUE, cost: 1
   8: l4 -> l0 : TRUE, cost: 1


Eliminating location l0 by chaining:

Applied chaining
First rule:
l4 -> l0 : TRUE, cost: 1
Second rule:
l0 -> l1 : TRUE, cost: 1
New rule:
l4 -> l1 : TRUE, cost: 2

Applied deletion
Removed the following rules: 5 8

Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 1
Second rule:
l3 -> l1 : TRUE, cost: 1
New rule:
l1 -> l1 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 6 7

Eliminated locations on linear paths
Start location: l4
  10: l1 -> l1 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 2
   9: l4 -> l1 : TRUE, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 2
New rule:
l1 -> l1 : x_5^0'=x_5^0+n*y_6^0, (n >= 0 /\ x_5^0+y_6^0+y_6^0*(-1+n) >= 0 /\ x_5^0+y_6^0 >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_IjOPcj.txt

Applied nonterm
Original rule:
l1 -> l1 : x_5^0'=x_5^0+y_6^0, -x_5^0-y_6^0 <= 0, cost: 2
New rule:
l1 -> [5] : (-y_6^0 <= 0 /\ x_5^0+y_6^0 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_pkLMJp.txt

Applied simplification
Original rule:
l1 -> [5] : (-y_6^0 <= 0 /\ x_5^0+y_6^0 >= 0), cost: NONTERM
New rule:
l1 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 10

Accelerated simple loops
Start location: l4
  11: l1 -> l1 : x_5^0'=x_5^0+n*y_6^0, (n >= 0 /\ x_5^0+y_6^0+y_6^0*(-1+n) >= 0 /\ x_5^0+y_6^0 >= 0), cost: 2*n
  13: l1 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM
   9: l4 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x_5^0'=x_5^0+n*y_6^0, (n >= 0 /\ x_5^0+y_6^0+y_6^0*(-1+n) >= 0 /\ x_5^0+y_6^0 >= 0), cost: 2*n
New rule:
l4 -> l1 : x_5^0'=x_5^0+n*y_6^0, (n >= 0 /\ x_5^0+y_6^0+y_6^0*(-1+n) >= 0 /\ x_5^0+y_6^0 >= 0), cost: 2+2*n

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM
New rule:
l4 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 11 13

Chained accelerated rules with incoming rules
Start location: l4
   9: l4 -> l1 : TRUE, cost: 2
  14: l4 -> l1 : x_5^0'=x_5^0+n*y_6^0, (n >= 0 /\ x_5^0+y_6^0+y_6^0*(-1+n) >= 0 /\ x_5^0+y_6^0 >= 0), cost: 2+2*n
  15: l4 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM


Removed unreachable locations and irrelevant leafs
Start location: l4
  15: l4 -> [5] : (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 15 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (x_5^0+y_6^0 >= 0 /\ y_6^0 >= 0)