NO

Initial ITS
Start location: l4
   0: l0 -> l2 : __disjvr_0^0'=__disjvr_0^post0, deltaext^0'=deltaext^post0, wnt^0'=wnt^post0, c0^0'=c0^post0, deltaext_new^0'=deltaext_new^post0, (wnt^0-wnt^post0 == 0 /\ __disjvr_0^0-__disjvr_0^post0 == 0 /\ -deltaext_new^post0+deltaext_new^0 == 0 /\ -c0^post0+c0^0 == 0 /\ deltaext^0-deltaext^post0 == 0 /\ -__disjvr_0^0+__disjvr_0^post0 == 0), cost: 1
   1: l2 -> l1 : __disjvr_0^0'=__disjvr_0^post1, deltaext^0'=deltaext^post1, wnt^0'=wnt^post1, c0^0'=c0^post1, deltaext_new^0'=deltaext_new^post1, (-wnt^post1+wnt^0 == 0 /\ deltaext^post1-deltaext_new^0 == 0 /\ __disjvr_0^0-__disjvr_0^post1 == 0 /\ c0^0-c0^post1 == 0 /\ -deltaext_new^post1+deltaext_new^0 == 0), cost: 1
   2: l1 -> l0 : __disjvr_0^0'=__disjvr_0^post2, deltaext^0'=deltaext^post2, wnt^0'=wnt^post2, c0^0'=c0^post2, deltaext_new^0'=deltaext_new^post2, (__disjvr_0^0-__disjvr_0^post2 == 0 /\ -1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -c0^post2+c0^0 == 0 /\ -wnt^post2+wnt^0 == 0 /\ -deltaext^0+deltaext_new^post2 == 0 /\ deltaext^0-deltaext^post2 == 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1
   3: l1 -> l0 : __disjvr_0^0'=__disjvr_0^post3, deltaext^0'=deltaext^post3, wnt^0'=wnt^post3, c0^0'=c0^post3, deltaext_new^0'=deltaext_new^post3, (wnt^0-wnt^post3 == 0 /\ c0^0-c0^post3 == 0 /\ deltaext^0-deltaext^post3 == 0 /\ 1-deltaext^0+deltaext_new^post3 == 0 /\ 2-2*deltaext^0+wnt^0+c0^0 <= 0 /\ __disjvr_0^0-__disjvr_0^post3 == 0), cost: 1
   4: l1 -> l0 : __disjvr_0^0'=__disjvr_0^post4, deltaext^0'=deltaext^post4, wnt^0'=wnt^post4, c0^0'=c0^post4, deltaext_new^0'=deltaext_new^post4, (-1-deltaext^0+deltaext_new^post4 == 0 /\ -wnt^post4+wnt^0 == 0 /\ -c0^post4+c0^0 == 0 /\ __disjvr_0^0-__disjvr_0^post4 == 0 /\ deltaext^0-deltaext^post4 == 0 /\ 1+2*deltaext^0-wnt^0-c0^0 <= 0), cost: 1
   5: l3 -> l1 : __disjvr_0^0'=__disjvr_0^post5, deltaext^0'=deltaext^post5, wnt^0'=wnt^post5, c0^0'=c0^post5, deltaext_new^0'=deltaext_new^post5, (-deltaext^0 <= 0 /\ -deltaext_new^post5+deltaext_new^0 == 0 /\ -3+wnt^0 <= 0 /\ wnt^0-wnt^post5 == 0 /\ -2+c0^post5 == 0 /\ __disjvr_0^0-__disjvr_0^post5 == 0 /\ -wnt^0 <= 0 /\ -3+deltaext^0 <= 0 /\ deltaext^0-deltaext^post5 == 0), cost: 1
   6: l4 -> l3 : __disjvr_0^0'=__disjvr_0^post6, deltaext^0'=deltaext^post6, wnt^0'=wnt^post6, c0^0'=c0^post6, deltaext_new^0'=deltaext_new^post6, (deltaext_new^0-deltaext_new^post6 == 0 /\ -wnt^post6+wnt^0 == 0 /\ __disjvr_0^0-__disjvr_0^post6 == 0 /\ deltaext^0-deltaext^post6 == 0 /\ -c0^post6+c0^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : __disjvr_0^0'=__disjvr_0^post0, deltaext^0'=deltaext^post0, wnt^0'=wnt^post0, c0^0'=c0^post0, deltaext_new^0'=deltaext_new^post0, (wnt^0-wnt^post0 == 0 /\ __disjvr_0^0-__disjvr_0^post0 == 0 /\ -deltaext_new^post0+deltaext_new^0 == 0 /\ -c0^post0+c0^0 == 0 /\ deltaext^0-deltaext^post0 == 0 /\ -__disjvr_0^0+__disjvr_0^post0 == 0), cost: 1
New rule:
l0 -> l2 : 0 == 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l1 : __disjvr_0^0'=__disjvr_0^post1, deltaext^0'=deltaext^post1, wnt^0'=wnt^post1, c0^0'=c0^post1, deltaext_new^0'=deltaext_new^post1, (-wnt^post1+wnt^0 == 0 /\ deltaext^post1-deltaext_new^0 == 0 /\ __disjvr_0^0-__disjvr_0^post1 == 0 /\ c0^0-c0^post1 == 0 /\ -deltaext_new^post1+deltaext_new^0 == 0), cost: 1
New rule:
l2 -> l1 : deltaext^0'=deltaext_new^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : __disjvr_0^0'=__disjvr_0^post2, deltaext^0'=deltaext^post2, wnt^0'=wnt^post2, c0^0'=c0^post2, deltaext_new^0'=deltaext_new^post2, (__disjvr_0^0-__disjvr_0^post2 == 0 /\ -1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -c0^post2+c0^0 == 0 /\ -wnt^post2+wnt^0 == 0 /\ -deltaext^0+deltaext_new^post2 == 0 /\ deltaext^0-deltaext^post2 == 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1
New rule:
l1 -> l0 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : __disjvr_0^0'=__disjvr_0^post3, deltaext^0'=deltaext^post3, wnt^0'=wnt^post3, c0^0'=c0^post3, deltaext_new^0'=deltaext_new^post3, (wnt^0-wnt^post3 == 0 /\ c0^0-c0^post3 == 0 /\ deltaext^0-deltaext^post3 == 0 /\ 1-deltaext^0+deltaext_new^post3 == 0 /\ 2-2*deltaext^0+wnt^0+c0^0 <= 0 /\ __disjvr_0^0-__disjvr_0^post3 == 0), cost: 1
New rule:
l1 -> l0 : deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : __disjvr_0^0'=__disjvr_0^post4, deltaext^0'=deltaext^post4, wnt^0'=wnt^post4, c0^0'=c0^post4, deltaext_new^0'=deltaext_new^post4, (-1-deltaext^0+deltaext_new^post4 == 0 /\ -wnt^post4+wnt^0 == 0 /\ -c0^post4+c0^0 == 0 /\ __disjvr_0^0-__disjvr_0^post4 == 0 /\ deltaext^0-deltaext^post4 == 0 /\ 1+2*deltaext^0-wnt^0-c0^0 <= 0), cost: 1
New rule:
l1 -> l0 : deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : __disjvr_0^0'=__disjvr_0^post5, deltaext^0'=deltaext^post5, wnt^0'=wnt^post5, c0^0'=c0^post5, deltaext_new^0'=deltaext_new^post5, (-deltaext^0 <= 0 /\ -deltaext_new^post5+deltaext_new^0 == 0 /\ -3+wnt^0 <= 0 /\ wnt^0-wnt^post5 == 0 /\ -2+c0^post5 == 0 /\ __disjvr_0^0-__disjvr_0^post5 == 0 /\ -wnt^0 <= 0 /\ -3+deltaext^0 <= 0 /\ deltaext^0-deltaext^post5 == 0), cost: 1
New rule:
l3 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : __disjvr_0^0'=__disjvr_0^post6, deltaext^0'=deltaext^post6, wnt^0'=wnt^post6, c0^0'=c0^post6, deltaext_new^0'=deltaext_new^post6, (deltaext_new^0-deltaext_new^post6 == 0 /\ -wnt^post6+wnt^0 == 0 /\ __disjvr_0^0-__disjvr_0^post6 == 0 /\ deltaext^0-deltaext^post6 == 0 /\ -c0^post6+c0^0 == 0), cost: 1
New rule:
l4 -> l3 : TRUE, cost: 1

Simplified rules
Start location: l4
   7: l0 -> l2 : 0 == 0, cost: 1
   8: l2 -> l1 : deltaext^0'=deltaext_new^0, TRUE, cost: 1
   9: l1 -> l0 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1
  10: l1 -> l0 : deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 1
  11: l1 -> l0 : deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 1
  12: l3 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 1
  13: l4 -> l3 : TRUE, cost: 1


Eliminating location l3 by chaining:

Applied chaining
First rule:
l4 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 1
New rule:
l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2

Applied deletion
Removed the following rules: 12 13

Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : 0 == 0, cost: 1
Second rule:
l2 -> l1 : deltaext^0'=deltaext_new^0, TRUE, cost: 1
New rule:
l0 -> l1 : deltaext^0'=deltaext_new^0, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 7 8

Eliminated locations on linear paths
Start location: l4
  15: l0 -> l1 : deltaext^0'=deltaext_new^0, 0 == 0, cost: 2
   9: l1 -> l0 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1
  10: l1 -> l0 : deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 1
  11: l1 -> l0 : deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 1
  14: l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2


Eliminating location l0 by chaining:

Applied chaining
First rule:
l1 -> l0 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 1
Second rule:
l0 -> l1 : deltaext^0'=deltaext_new^0, 0 == 0, cost: 2
New rule:
l1 -> l1 : deltaext^0'=deltaext^0, deltaext_new^0'=deltaext^0, (0 == 0 /\ -1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3

Applied simplification
Original rule:
l1 -> l1 : deltaext^0'=deltaext^0, deltaext_new^0'=deltaext^0, (0 == 0 /\ -1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
New rule:
l1 -> l1 : deltaext^0'=deltaext^0, deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3

Applied chaining
First rule:
l1 -> l0 : deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 1
Second rule:
l0 -> l1 : deltaext^0'=deltaext_new^0, 0 == 0, cost: 2
New rule:
l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, (0 == 0 /\ 2-2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3

Applied simplification
Original rule:
l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, (0 == 0 /\ 2-2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
New rule:
l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 3

Applied chaining
First rule:
l1 -> l0 : deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 1
Second rule:
l0 -> l1 : deltaext^0'=deltaext_new^0, 0 == 0, cost: 2
New rule:
l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, (0 == 0 /\ 1+2*deltaext^0-wnt^0-c0^0 <= 0), cost: 3

Applied simplification
Original rule:
l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, (0 == 0 /\ 1+2*deltaext^0-wnt^0-c0^0 <= 0), cost: 3
New rule:
l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 3

Applied deletion
Removed the following rules: 9 10 11 15

Eliminated locations on tree-shaped paths
Start location: l4
  16: l1 -> l1 : deltaext^0'=deltaext^0, deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
  17: l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 3
  18: l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 3
  14: l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2


Applied simplification
Original rule:
l1 -> l1 : deltaext^0'=deltaext^0, deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
New rule:
l1 -> l1 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3

Simplified simple loops
Start location: l4
  17: l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 3
  18: l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 3
  19: l1 -> l1 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
  14: l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2


Applied acceleration
Original rule:
l1 -> l1 : deltaext^0'=-1+deltaext^0, deltaext_new^0'=-1+deltaext^0, 2-2*deltaext^0+wnt^0+c0^0 <= 0, cost: 3
New rule:
l1 -> l1 : deltaext^0'=deltaext^0-n2, deltaext_new^0'=deltaext^0-n2, (2*deltaext^0-wnt^0-2*n2-c0^0 >= 0 /\ -1+n2 >= 0), cost: 3*n2

Applied acceleration
Original rule:
l1 -> l1 : deltaext^0'=1+deltaext^0, deltaext_new^0'=1+deltaext^0, 1+2*deltaext^0-wnt^0-c0^0 <= 0, cost: 3
New rule:
l1 -> l1 : deltaext^0'=n4+deltaext^0, deltaext_new^0'=n4+deltaext^0, (-1+n4 >= 0 /\ 1-2*n4-2*deltaext^0+wnt^0+c0^0 >= 0), cost: 3*n4

Applied nonterm
Original rule:
l1 -> l1 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
New rule:
l1 -> [5] : (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : deltaext_new^0'=deltaext^0, (-1+2*deltaext^0-wnt^0-c0^0 <= 0 /\ -2*deltaext^0+wnt^0+c0^0 <= 0), cost: 3
New rule:
l1 -> l1 : deltaext_new^0'=deltaext^0, (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: 3*n6

Applied deletion
Removed the following rules: 17 18 19

Accelerated simple loops
Start location: l4
  20: l1 -> l1 : deltaext^0'=deltaext^0-n2, deltaext_new^0'=deltaext^0-n2, (2*deltaext^0-wnt^0-2*n2-c0^0 >= 0 /\ -1+n2 >= 0), cost: 3*n2
  21: l1 -> l1 : deltaext^0'=n4+deltaext^0, deltaext_new^0'=n4+deltaext^0, (-1+n4 >= 0 /\ 1-2*n4-2*deltaext^0+wnt^0+c0^0 >= 0), cost: 3*n4
  22: l1 -> [5] : (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: NONTERM
  23: l1 -> l1 : deltaext_new^0'=deltaext^0, (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: 3*n6
  14: l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2


Applied chaining
First rule:
l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2
Second rule:
l1 -> l1 : deltaext^0'=deltaext^0-n2, deltaext_new^0'=deltaext^0-n2, (2*deltaext^0-wnt^0-2*n2-c0^0 >= 0 /\ -1+n2 >= 0), cost: 3*n2
New rule:
l4 -> l1 : deltaext^0'=deltaext^0-n2, c0^0'=2, deltaext_new^0'=deltaext^0-n2, (wnt^0 >= 0 /\ -1+n2 >= 0 /\ -2+2*deltaext^0-wnt^0-2*n2 >= 0 /\ -3+deltaext^0 <= 0), cost: 2+3*n2

Applied chaining
First rule:
l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2
Second rule:
l1 -> l1 : deltaext^0'=n4+deltaext^0, deltaext_new^0'=n4+deltaext^0, (-1+n4 >= 0 /\ 1-2*n4-2*deltaext^0+wnt^0+c0^0 >= 0), cost: 3*n4
New rule:
l4 -> l1 : deltaext^0'=n4+deltaext^0, c0^0'=2, deltaext_new^0'=n4+deltaext^0, (-1+n4 >= 0 /\ deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ 3-2*n4-2*deltaext^0+wnt^0 >= 0 /\ wnt^0 >= 0), cost: 2+3*n4

Applied chaining
First rule:
l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2
Second rule:
l1 -> [5] : (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: NONTERM
New rule:
l4 -> [5] : (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0), cost: NONTERM

Applied chaining
First rule:
l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2
Second rule:
l1 -> l1 : deltaext_new^0'=deltaext^0, (1-2*deltaext^0+wnt^0+c0^0 >= 0 /\ 2*deltaext^0-wnt^0-c0^0 >= 0), cost: 3*n6
New rule:
l4 -> l1 : c0^0'=2, deltaext_new^0'=deltaext^0, (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0), cost: 2+3*n6

Applied deletion
Removed the following rules: 20 21 22 23

Chained accelerated rules with incoming rules
Start location: l4
  14: l4 -> l1 : c0^0'=2, (deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0 /\ -3+deltaext^0 <= 0), cost: 2
  24: l4 -> l1 : deltaext^0'=deltaext^0-n2, c0^0'=2, deltaext_new^0'=deltaext^0-n2, (wnt^0 >= 0 /\ -1+n2 >= 0 /\ -2+2*deltaext^0-wnt^0-2*n2 >= 0 /\ -3+deltaext^0 <= 0), cost: 2+3*n2
  25: l4 -> l1 : deltaext^0'=n4+deltaext^0, c0^0'=2, deltaext_new^0'=n4+deltaext^0, (-1+n4 >= 0 /\ deltaext^0 >= 0 /\ -3+wnt^0 <= 0 /\ 3-2*n4-2*deltaext^0+wnt^0 >= 0 /\ wnt^0 >= 0), cost: 2+3*n4
  26: l4 -> [5] : (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0), cost: NONTERM
  27: l4 -> l1 : c0^0'=2, deltaext_new^0'=deltaext^0, (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0), cost: 2+3*n6


Removed unreachable locations and irrelevant leafs
Start location: l4
  26: l4 -> [5] : (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 26 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (3-2*deltaext^0+wnt^0 >= 0 /\ -2+2*deltaext^0-wnt^0 >= 0 /\ -3+wnt^0 <= 0 /\ wnt^0 >= 0)