NO

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


Applied preprocessing
Original rule:
l0 -> l1 : y^0'=y^post0, x^0'=x^post0, z^0'=z^post0, (0 == 0 /\ y^0-x^0+x^post0 == 0 /\ y^0-y^post0 == 0), cost: 1
New rule:
l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l0 -> l2 : y^0'=y^post1, x^0'=x^post1, z^0'=z^post1, (2-z^0 <= 0 /\ 1-z^0+z^post1 == 0 /\ -1-y^0+y^post1 == 0 /\ x^0-x^post1 == 0), cost: 1
New rule:
l0 -> l2 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : y^0'=y^post2, x^0'=x^post2, z^0'=z^post2, (z^0-z^post2 == 0 /\ y^0-y^post2 == 0 /\ -x^post2+x^0 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : y^0'=y^post3, x^0'=x^post3, z^0'=z^post3, (-x^post3+x^0 == 0 /\ -y^post3+y^0 == 0 /\ -z^post3+z^0 == 0 /\ 2-x^0 <= 0), cost: 1
New rule:
l1 -> l0 : -2+x^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : y^0'=y^post4, x^0'=x^post4, z^0'=z^post4, (-x^post4+x^0 == 0 /\ -z^post4+z^0 == 0 /\ -y^post4+y^0 == 0), cost: 1
New rule:
l3 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : y^0'=y^post5, x^0'=x^post5, z^0'=z^post5, (-x^post5+x^0 == 0 /\ -z^post5+z^0 == 0 /\ -y^post5+y^0 == 0), cost: 1
New rule:
l4 -> l3 : TRUE, cost: 1

Simplified rules
Start location: l4
   6: l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
   7: l0 -> l2 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 1
   9: l1 -> l0 : -2+x^0 >= 0, cost: 1
   8: l2 -> l0 : TRUE, cost: 1
  10: l3 -> l1 : TRUE, cost: 1
  11: l4 -> l3 : TRUE, cost: 1


Eliminating location l3 by chaining:

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

Applied deletion
Removed the following rules: 10 11

Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 1
Second rule:
l2 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 2

Applied deletion
Removed the following rules: 7 8

Eliminated locations on linear paths
Start location: l4
   6: l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
  13: l0 -> l0 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 2
   9: l1 -> l0 : -2+x^0 >= 0, cost: 1
  12: l4 -> l1 : TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : y^0'=1+y^0, z^0'=-1+z^0, -2+z^0 >= 0, cost: 2
New rule:
l0 -> l0 : y^0'=y^0+n, z^0'=z^0-n, (-1+z^0-n >= 0 /\ n >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_BJlenl.txt

Applied instantiation
Original rule:
l0 -> l0 : y^0'=y^0+n, z^0'=z^0-n, (-1+z^0-n >= 0 /\ n >= 0), cost: 2*n
New rule:
l0 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, (0 >= 0 /\ -1+z^0 >= 0), cost: -2+2*z^0

Applied simplification
Original rule:
l0 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, (0 >= 0 /\ -1+z^0 >= 0), cost: -2+2*z^0
New rule:
l0 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, -1+z^0 >= 0, cost: -2+2*z^0

Applied deletion
Removed the following rules: 13

Accelerated simple loops
Start location: l4
   6: l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
  15: l0 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, -1+z^0 >= 0, cost: -2+2*z^0
   9: l1 -> l0 : -2+x^0 >= 0, cost: 1
  12: l4 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l1 -> l0 : -2+x^0 >= 0, cost: 1
Second rule:
l0 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, -1+z^0 >= 0, cost: -2+2*z^0
New rule:
l1 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: -1+2*z^0

Applied deletion
Removed the following rules: 15

Chained accelerated rules with incoming rules
Start location: l4
   6: l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
   9: l1 -> l0 : -2+x^0 >= 0, cost: 1
  16: l1 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: -1+2*z^0
  12: l4 -> l1 : TRUE, cost: 2


Eliminating location l0 by chaining:

Applied chaining
First rule:
l1 -> l0 : -2+x^0 >= 0, cost: 1
Second rule:
l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
New rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, (0 == 0 /\ -2+x^0 >= 0), cost: 2

Applied simplification
Original rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, (0 == 0 /\ -2+x^0 >= 0), cost: 2
New rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2

Applied chaining
First rule:
l1 -> l0 : y^0'=-1+y^0+z^0, z^0'=1, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: -1+2*z^0
Second rule:
l0 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, 0 == 0, cost: 1
New rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (0 == 0 /\ -2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0

Applied simplification
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (0 == 0 /\ -2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
New rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0

Applied deletion
Removed the following rules: 6 9 16

Eliminated locations on tree-shaped paths
Start location: l4
  17: l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
  18: l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
  12: l4 -> l1 : TRUE, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
New rule:
l1 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_JBjChj.txt

Applied nonterm
Original rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
New rule:
l1 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_gmlePl.txt

Applied acceleration
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
New rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DnACIN.txt

Applied nonterm
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
New rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_gPKiGk.txt

Applied chaining
First rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
Second rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
New rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=2-2*y^0+x^0-2*z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ -1+z^0 >= 0), cost: 2+2*z^0

Applied acceleration
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=2-2*y^0+x^0-2*z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ -1+z^0 >= 0), cost: 2+2*z^0
New rule:
l1 -> l1 : y^0'=-n2+y^0+n2*z^post0, x^0'=n2-n2^2*z^post0-2*n2*y^0+x^0+n2^2-n2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -2+2*y^0+2*z^0 == 0 /\ -1+n2 >= 0), cost: 2*n2+2*n2*z^post0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_bNfNLh.txt

Applied nonterm
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=2-2*y^0+x^0-2*z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ -1+z^0 >= 0), cost: 2+2*z^0
New rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EcIPei.txt

Applied chaining
First rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
Second rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
New rule:
l1 -> [6] : (0 <= 0 /\ 0 == 0 /\ 1-z^post0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -2+2*y^0+2*z^post0 == 0 /\ -1-2*y^0+x^0-z^post0 >= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1+z^0 >= 0), cost: 2*z^0
Second rule:
l1 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
New rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0-n0*(-1+y^0+z^0)+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0+2*z^0

Applied acceleration
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0-n0*(-1+y^0+z^0)+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0+2*z^0
New rule:
l1 -> l1 : y^0'=-n4+y^0+n4*z^post0, x^0'=1/2*n4-1/2*n4^2*z^post0+1/2*n4*n0-n4*y^0-1/2*n4^2*n0*z^post0+x^0-1/2*n4*n0*z^post0-1/2*n4*z^post0+1/2*n4^2+1/2*n4^2*n0-n4*y^0*n0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n4 >= 0 /\ -1+n0 >= 0), cost: 2*n4*n0+2*n4*z^post0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_MFCkkp.txt

Applied nonterm
Original rule:
l1 -> l1 : y^0'=-1+y^0+z^0, x^0'=1-y^0-n0*(-1+y^0+z^0)+x^0-z^0, z^0'=z^post0, (-2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0+2*z^0
New rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_abAmdC.txt

Applied chaining
First rule:
l1 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
Second rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (0 <= 0 /\ 0 == 0 /\ 1-z^post0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^post0)+z^post0 == 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^post0)*(-1+n0)+x^0-y^0*n0-z^post0 >= 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
Second rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
New rule:
l1 -> l1 : x^0'=-y^0+x^0-y^0*n1, z^0'=1, (y^0 == 0 /\ -2-y^0+x^0 >= 0 /\ -1+n1 >= 0), cost: 2+2*n1

Applied nonterm
Original rule:
l1 -> l1 : x^0'=-y^0+x^0-y^0*n1, z^0'=1, (y^0 == 0 /\ -2-y^0+x^0 >= 0 /\ -1+n1 >= 0), cost: 2+2*n1
New rule:
l1 -> [6] : (y^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -y^0 >= 0 /\ -1+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_HGFigH.txt

Applied chaining
First rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
Second rule:
l1 -> [6] : (y^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -y^0 >= 0 /\ -1+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ y^0+n1*z^post0-n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
Second rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
New rule:
l1 -> l1 : y^0'=y^0+n1*z^0-n1, x^0'=-y^0-3/2*n1*z^0+x^0+1/2*n1^2+3/2*n1-1/2*n1^2*z^0-y^0*n1, (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2+2*n1*z^0

Applied nonterm
Original rule:
l1 -> l1 : y^0'=y^0+n1*z^0-n1, x^0'=-y^0-3/2*n1*z^0+x^0+1/2*n1^2+3/2*n1-1/2*n1^2*z^0-y^0*n1, (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2+2*n1*z^0
New rule:
l1 -> [6] : (1-y^0-z^0 >= 0 /\ 1-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 >= 0 /\ n7 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_heiHGA.txt

Applied chaining
First rule:
l1 -> l1 : x^0'=-y^0+x^0, z^0'=z^post0, -2+x^0 >= 0, cost: 2
Second rule:
l1 -> [6] : (1-y^0-z^0 >= 0 /\ 1-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 >= 0 /\ n7 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (1-z^post0 >= 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ 1-y^0-z^post0 >= 0 /\ -1+n1 >= 0 /\ -2-y^0-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ n7 >= 0 /\ -1+y^0+z^post0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
New rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0

Applied simplification
Original rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
New rule:
l1 -> [6] : (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
New rule:
l1 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (0 <= 0 /\ 0 == 0 /\ 1-z^post0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -2+2*y^0+2*z^post0 == 0 /\ -1-2*y^0+x^0-z^post0 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (-1+z^post0 == 0 /\ -2+2*y^0+2*z^post0 == 0 /\ -1-2*y^0+x^0-z^post0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (0 == 0 /\ -2+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 <= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (0 <= 0 /\ 0 == 0 /\ 1-z^post0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ -1+y^0+n0*(-1+y^0+z^post0)+z^post0 == 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1-y^0-(-1+y^0+z^post0)*(-1+n0)+x^0-y^0*n0-z^post0 >= 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (-1+z^post0 == 0 /\ -1+y^0+n0*(-1+y^0+z^post0)+z^post0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (0 == 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ y^0+n1*z^post0-n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ y^0+n1*z^post0-n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [6] : (1-z^post0 >= 0 /\ -1+z^post0 >= 0 /\ -2+x^0 >= 0 /\ 1-y^0-z^post0 >= 0 /\ -1+n1 >= 0 /\ -2-y^0-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ n7 >= 0 /\ -1+y^0+z^post0 >= 0), cost: NONTERM
New rule:
l1 -> [6] : (-1+z^post0 <= 0 /\ -1+z^post0 >= 0 /\ 1-y^0-z^post0 >= 0 /\ -1+n1 >= 0 /\ -2-y^0-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ n7 >= 0 /\ -1+y^0+z^post0 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 17 18

Accelerated simple loops
Start location: l4
  19: l1 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
  20: l1 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM
  27: l1 -> [6] : (y^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -y^0 >= 0 /\ -1+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
  29: l1 -> [6] : (1-y^0-z^0 >= 0 /\ 1-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 >= 0 /\ n7 >= 0), cost: NONTERM
  31: l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
  32: l1 -> [6] : (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
  33: l1 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
  34: l1 -> [6] : (-1+z^post0 == 0 /\ -2+2*y^0+2*z^post0 == 0 /\ -1-2*y^0+x^0-z^post0 >= 0), cost: NONTERM
  35: l1 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
  36: l1 -> [6] : (-1+z^post0 == 0 /\ -1+y^0+n0*(-1+y^0+z^post0)+z^post0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
  37: l1 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ y^0+n1*z^post0-n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
  38: l1 -> [6] : (-1+z^post0 <= 0 /\ -1+z^post0 >= 0 /\ 1-y^0-z^post0 >= 0 /\ -1+n1 >= 0 /\ -2-y^0-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ n7 >= 0 /\ -1+y^0+z^post0 >= 0), cost: NONTERM
  12: l4 -> l1 : TRUE, cost: 2


Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2*n0
New rule:
l4 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2+2*n0

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM
New rule:
l4 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (y^0 >= 0 /\ -2-y^0+x^0 >= 0 /\ -y^0 >= 0 /\ -1+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (-2-y^0+x^0 >= 0 /\ -y^0 == 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (1-y^0-z^0 >= 0 /\ 1-z^0 >= 0 /\ -1+z^0 >= 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 >= 0 /\ n7 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 == 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> l1 : y^0'=y^0+n1*z^post0-n1, x^0'=-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0, z^0'=z^post0, (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2*n1*z^post0
New rule:
l4 -> l1 : y^0'=y^0+n1*z^0-n1, x^0'=-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1, (-2+x^0 >= 0 /\ -1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2+2*n1*z^0

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-2+x^0 >= 0 /\ z^0-z^post0 == 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
New rule:
l4 -> [6] : (-2+x^0 >= 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
New rule:
l4 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1+z^post0 == 0 /\ -2+2*y^0+2*z^post0 == 0 /\ -1-2*y^0+x^0-z^post0 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (y^0 == 0 /\ -2-2*y^0+x^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ z^0-z^post0 == 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1+z^post0 == 0 /\ -1+y^0+n0*(-1+y^0+z^post0)+z^post0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (y^0+y^0*n0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ y^0+n1*z^post0-n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 >= 0 /\ -1+n6 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 == 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : TRUE, cost: 2
Second rule:
l1 -> [6] : (-1+z^post0 <= 0 /\ -1+z^post0 >= 0 /\ 1-y^0-z^post0 >= 0 /\ -1+n1 >= 0 /\ -2-y^0-1/2*n1*z^post0+x^0+1/2*n1^2+1/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ n7 >= 0 /\ -1+y^0+z^post0 >= 0), cost: NONTERM
New rule:
l4 -> [6] : (y^0 == 0 /\ -1+n1 >= 0 /\ -2-y^0+x^0-y^0*n1 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 19 20 27 29 31 32 33 34 35 36 37 38

Chained accelerated rules with incoming rules
Start location: l4
  12: l4 -> l1 : TRUE, cost: 2
  39: l4 -> l1 : x^0'=x^0-y^0*n0, z^0'=z^post0, (-2+x^0 >= 0 /\ -2-y^0*(-1+n0)+x^0 >= 0 /\ -1+n0 >= 0), cost: 2+2*n0
  40: l4 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM
  41: l4 -> [6] : (-2-y^0+x^0 >= 0 /\ -y^0 == 0), cost: NONTERM
  42: l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
  43: l4 -> l1 : y^0'=y^0+n1*z^0-n1, x^0'=-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1, (-2+x^0 >= 0 /\ -1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0), cost: 2+2*n1*z^0
  44: l4 -> [6] : (-2+x^0 >= 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
  45: l4 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
  46: l4 -> [6] : (y^0 == 0 /\ -2-2*y^0+x^0 >= 0), cost: NONTERM
  47: l4 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
  48: l4 -> [6] : (y^0+y^0*n0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
  49: l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 == 0), cost: NONTERM
  50: l4 -> [6] : (y^0 == 0 /\ -1+n1 >= 0 /\ -2-y^0+x^0-y^0*n1 >= 0), cost: NONTERM


Removed unreachable locations and irrelevant leafs
Start location: l4
  40: l4 -> [6] : (-2+x^0 >= 0 /\ y^0 <= 0), cost: NONTERM
  41: l4 -> [6] : (-2-y^0+x^0 >= 0 /\ -y^0 == 0), cost: NONTERM
  42: l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -2-1/2*n1*z^0+x^0+1/2*n1^2+1/2*n1-1/2*n1^2*z^0-y^0*n1 >= 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
  44: l4 -> [6] : (-2+x^0 >= 0 /\ -1+z^0 == 0 /\ -1+y^0+z^0 == 0), cost: NONTERM
  45: l4 -> [6] : (-1-y^0+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -2+2*y^0+2*z^0 == 0), cost: NONTERM
  46: l4 -> [6] : (y^0 == 0 /\ -2-2*y^0+x^0 >= 0), cost: NONTERM
  47: l4 -> [6] : (-1-y^0-(-1+y^0+z^0)*(-1+n0)+x^0-z^0 >= 0 /\ 1-z^0 == 0 /\ -1+y^0+n0*(-1+y^0+z^0)+z^0 == 0 /\ -1+n0 >= 0), cost: NONTERM
  48: l4 -> [6] : (y^0+y^0*n0 == 0 /\ -2+x^0-y^0*n0 >= 0 /\ -1+n0 >= 0), cost: NONTERM
  49: l4 -> [6] : (-1+z^0 == 0 /\ -1+n1 >= 0 /\ -1+y^0+z^0 == 0 /\ -2-y^0-3/2*n1*z^post0+x^0+1/2*n1^2+3/2*n1-y^0*n1-1/2*n1^2*z^post0 >= 0 /\ -y^0-n1*z^post0+n1 == 0), cost: NONTERM
  50: l4 -> [6] : (y^0 == 0 /\ -1+n1 >= 0 /\ -2-y^0+x^0-y^0*n1 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 40 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (-2+x^0 >= 0 /\ y^0 <= 0)