WORST_CASE(Omega(0),?)

Initial ITS
Start location: l7
   0: l0 -> l1 : oldn^0'=oldn^post0, e^0'=e^post0, olde^0'=olde^post0, copied^0'=copied^post0, n^0'=n^post0, (-n^post0+n^0 == 0 /\ oldn^0-oldn^post0 == 0 /\ copied^0-copied^post0 == 0 /\ -e^post0+e^0 == 0 /\ -oldn^0+n^0 <= 0 /\ -e^0+olde^0 <= 0 /\ olde^0-olde^post0 == 0 /\ 1-copied^0 <= 0), cost: 1
   1: l0 -> l2 : oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, copied^0'=copied^post1, n^0'=n^post1, (-11+n^post1-n^0 == 0 /\ -100+n^0 <= 0 /\ oldn^post1-n^0 == 0 /\ copied^0 <= 0 /\ -1+copied^post1 == 0 /\ 1-e^0 <= 0 /\ -1-e^0+e^post1 == 0 /\ olde^post1-e^0 == 0), cost: 1
   3: l0 -> l3 : oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, copied^0'=copied^post3, n^0'=n^post3, (101-n^0 <= 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ oldn^post3-n^0 == 0 /\ -e^0+olde^post3 == 0 /\ copied^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 1-e^0 <= 0), cost: 1
   5: l0 -> l4 : oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, copied^0'=copied^post5, n^0'=n^post5, (-11-n^0+n^post5 == 0 /\ -1-e^0+e^post5 == 0 /\ -100+n^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ 1-e^0 <= 0 /\ -olde^post5+olde^0 == 0 /\ -copied^post5+copied^0 == 0), cost: 1
   7: l0 -> l5 : oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, copied^0'=copied^post7, n^0'=n^post7, (101-n^0 <= 0 /\ -olde^post7+olde^0 == 0 /\ 1-e^0+e^post7 == 0 /\ copied^0-copied^post7 == 0 /\ 1-e^0 <= 0 /\ 10-n^0+n^post7 == 0 /\ oldn^0-oldn^post7 == 0), cost: 1
   2: l2 -> l0 : oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, copied^0'=copied^post2, n^0'=n^post2, (oldn^0-oldn^post2 == 0 /\ -e^post2+e^0 == 0 /\ -n^post2+n^0 == 0 /\ copied^0-copied^post2 == 0 /\ olde^0-olde^post2 == 0), cost: 1
   4: l3 -> l0 : oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, copied^0'=copied^post4, n^0'=n^post4, (copied^0-copied^post4 == 0 /\ olde^0-olde^post4 == 0 /\ -n^post4+n^0 == 0 /\ e^0-e^post4 == 0 /\ oldn^0-oldn^post4 == 0), cost: 1
   6: l4 -> l0 : oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, copied^0'=copied^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ olde^0-olde^post6 == 0 /\ oldn^0-oldn^post6 == 0 /\ -copied^post6+copied^0 == 0 /\ e^0-e^post6 == 0), cost: 1
   8: l5 -> l0 : oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, copied^0'=copied^post8, n^0'=n^post8, (-n^post8+n^0 == 0 /\ olde^0-olde^post8 == 0 /\ oldn^0-oldn^post8 == 0 /\ -copied^post8+copied^0 == 0 /\ e^0-e^post8 == 0), cost: 1
   9: l6 -> l0 : oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, copied^0'=copied^post9, n^0'=n^post9, (0 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ copied^post9 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1
  10: l7 -> l6 : oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, copied^0'=copied^post10, n^0'=n^post10, (-copied^post10+copied^0 == 0 /\ olde^0-olde^post10 == 0 /\ oldn^0-oldn^post10 == 0 /\ e^0-e^post10 == 0 /\ -n^post10+n^0 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l7
   1: l0 -> l2 : oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, copied^0'=copied^post1, n^0'=n^post1, (-11+n^post1-n^0 == 0 /\ -100+n^0 <= 0 /\ oldn^post1-n^0 == 0 /\ copied^0 <= 0 /\ -1+copied^post1 == 0 /\ 1-e^0 <= 0 /\ -1-e^0+e^post1 == 0 /\ olde^post1-e^0 == 0), cost: 1
   3: l0 -> l3 : oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, copied^0'=copied^post3, n^0'=n^post3, (101-n^0 <= 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ oldn^post3-n^0 == 0 /\ -e^0+olde^post3 == 0 /\ copied^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 1-e^0 <= 0), cost: 1
   5: l0 -> l4 : oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, copied^0'=copied^post5, n^0'=n^post5, (-11-n^0+n^post5 == 0 /\ -1-e^0+e^post5 == 0 /\ -100+n^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ 1-e^0 <= 0 /\ -olde^post5+olde^0 == 0 /\ -copied^post5+copied^0 == 0), cost: 1
   7: l0 -> l5 : oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, copied^0'=copied^post7, n^0'=n^post7, (101-n^0 <= 0 /\ -olde^post7+olde^0 == 0 /\ 1-e^0+e^post7 == 0 /\ copied^0-copied^post7 == 0 /\ 1-e^0 <= 0 /\ 10-n^0+n^post7 == 0 /\ oldn^0-oldn^post7 == 0), cost: 1
   2: l2 -> l0 : oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, copied^0'=copied^post2, n^0'=n^post2, (oldn^0-oldn^post2 == 0 /\ -e^post2+e^0 == 0 /\ -n^post2+n^0 == 0 /\ copied^0-copied^post2 == 0 /\ olde^0-olde^post2 == 0), cost: 1
   4: l3 -> l0 : oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, copied^0'=copied^post4, n^0'=n^post4, (copied^0-copied^post4 == 0 /\ olde^0-olde^post4 == 0 /\ -n^post4+n^0 == 0 /\ e^0-e^post4 == 0 /\ oldn^0-oldn^post4 == 0), cost: 1
   6: l4 -> l0 : oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, copied^0'=copied^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ olde^0-olde^post6 == 0 /\ oldn^0-oldn^post6 == 0 /\ -copied^post6+copied^0 == 0 /\ e^0-e^post6 == 0), cost: 1
   8: l5 -> l0 : oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, copied^0'=copied^post8, n^0'=n^post8, (-n^post8+n^0 == 0 /\ olde^0-olde^post8 == 0 /\ oldn^0-oldn^post8 == 0 /\ -copied^post8+copied^0 == 0 /\ e^0-e^post8 == 0), cost: 1
   9: l6 -> l0 : oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, copied^0'=copied^post9, n^0'=n^post9, (0 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ copied^post9 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1
  10: l7 -> l6 : oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, copied^0'=copied^post10, n^0'=n^post10, (-copied^post10+copied^0 == 0 /\ olde^0-olde^post10 == 0 /\ oldn^0-oldn^post10 == 0 /\ e^0-e^post10 == 0 /\ -n^post10+n^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : oldn^0'=oldn^post1, e^0'=e^post1, olde^0'=olde^post1, copied^0'=copied^post1, n^0'=n^post1, (-11+n^post1-n^0 == 0 /\ -100+n^0 <= 0 /\ oldn^post1-n^0 == 0 /\ copied^0 <= 0 /\ -1+copied^post1 == 0 /\ 1-e^0 <= 0 /\ -1-e^0+e^post1 == 0 /\ olde^post1-e^0 == 0), cost: 1
New rule:
l0 -> l2 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : oldn^0'=oldn^post2, e^0'=e^post2, olde^0'=olde^post2, copied^0'=copied^post2, n^0'=n^post2, (oldn^0-oldn^post2 == 0 /\ -e^post2+e^0 == 0 /\ -n^post2+n^0 == 0 /\ copied^0-copied^post2 == 0 /\ olde^0-olde^post2 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l0 -> l3 : oldn^0'=oldn^post3, e^0'=e^post3, olde^0'=olde^post3, copied^0'=copied^post3, n^0'=n^post3, (101-n^0 <= 0 /\ 1-e^0+e^post3 == 0 /\ -1+copied^post3 == 0 /\ oldn^post3-n^0 == 0 /\ -e^0+olde^post3 == 0 /\ copied^0 <= 0 /\ 10+n^post3-n^0 == 0 /\ 1-e^0 <= 0), cost: 1
New rule:
l0 -> l3 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : oldn^0'=oldn^post4, e^0'=e^post4, olde^0'=olde^post4, copied^0'=copied^post4, n^0'=n^post4, (copied^0-copied^post4 == 0 /\ olde^0-olde^post4 == 0 /\ -n^post4+n^0 == 0 /\ e^0-e^post4 == 0 /\ oldn^0-oldn^post4 == 0), cost: 1
New rule:
l3 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l0 -> l4 : oldn^0'=oldn^post5, e^0'=e^post5, olde^0'=olde^post5, copied^0'=copied^post5, n^0'=n^post5, (-11-n^0+n^post5 == 0 /\ -1-e^0+e^post5 == 0 /\ -100+n^0 <= 0 /\ oldn^0-oldn^post5 == 0 /\ 1-e^0 <= 0 /\ -olde^post5+olde^0 == 0 /\ -copied^post5+copied^0 == 0), cost: 1
New rule:
l0 -> l4 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l4 -> l0 : oldn^0'=oldn^post6, e^0'=e^post6, olde^0'=olde^post6, copied^0'=copied^post6, n^0'=n^post6, (-n^post6+n^0 == 0 /\ olde^0-olde^post6 == 0 /\ oldn^0-oldn^post6 == 0 /\ -copied^post6+copied^0 == 0 /\ e^0-e^post6 == 0), cost: 1
New rule:
l4 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l0 -> l5 : oldn^0'=oldn^post7, e^0'=e^post7, olde^0'=olde^post7, copied^0'=copied^post7, n^0'=n^post7, (101-n^0 <= 0 /\ -olde^post7+olde^0 == 0 /\ 1-e^0+e^post7 == 0 /\ copied^0-copied^post7 == 0 /\ 1-e^0 <= 0 /\ 10-n^0+n^post7 == 0 /\ oldn^0-oldn^post7 == 0), cost: 1
New rule:
l0 -> l5 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l5 -> l0 : oldn^0'=oldn^post8, e^0'=e^post8, olde^0'=olde^post8, copied^0'=copied^post8, n^0'=n^post8, (-n^post8+n^0 == 0 /\ olde^0-olde^post8 == 0 /\ oldn^0-oldn^post8 == 0 /\ -copied^post8+copied^0 == 0 /\ e^0-e^post8 == 0), cost: 1
New rule:
l5 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l0 : oldn^0'=oldn^post9, e^0'=e^post9, olde^0'=olde^post9, copied^0'=copied^post9, n^0'=n^post9, (0 == 0 /\ -1+e^post9 == 0 /\ -olde^post9+olde^0 == 0 /\ copied^post9 == 0 /\ oldn^0-oldn^post9 == 0), cost: 1
New rule:
l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l6 : oldn^0'=oldn^post10, e^0'=e^post10, olde^0'=olde^post10, copied^0'=copied^post10, n^0'=n^post10, (-copied^post10+copied^0 == 0 /\ olde^0-olde^post10 == 0 /\ oldn^0-oldn^post10 == 0 /\ e^0-e^post10 == 0 /\ -n^post10+n^0 == 0), cost: 1
New rule:
l7 -> l6 : TRUE, cost: 1

Simplified rules
Start location: l7
  11: l0 -> l2 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 1
  13: l0 -> l3 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1
  15: l0 -> l4 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1
  17: l0 -> l5 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1
  12: l2 -> l0 : TRUE, cost: 1
  14: l3 -> l0 : TRUE, cost: 1
  16: l4 -> l0 : TRUE, cost: 1
  18: l5 -> l0 : TRUE, cost: 1
  19: l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1
  20: l7 -> l6 : TRUE, cost: 1


Eliminating location l6 by chaining:

Applied chaining
First rule:
l7 -> l6 : TRUE, cost: 1
Second rule:
l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1
New rule:
l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 1
Second rule:
l2 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 11 12

Eliminating location l3 by chaining:

Applied chaining
First rule:
l0 -> l3 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1
Second rule:
l3 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 13 14

Eliminating location l4 by chaining:

Applied chaining
First rule:
l0 -> l4 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1
Second rule:
l4 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 15 16

Eliminating location l5 by chaining:

Applied chaining
First rule:
l0 -> l5 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 1
Second rule:
l5 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 17 18

Eliminated locations on linear paths
Start location: l7
  22: l0 -> l0 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 2
  23: l0 -> l0 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2
  24: l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2
  25: l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2
  21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : e^0'=1+e^0, n^0'=11+n^0, (-100+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2
New rule:
l0 -> l0 : e^0'=e^0+n1, n^0'=11*n1+n^0, (111-11*n1-n^0 >= 0 /\ n1 >= 0 /\ -1+e^0 >= 0), cost: 2*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_AkCOIo.txt

Applied acceleration
Original rule:
l0 -> l0 : e^0'=-1+e^0, n^0'=-10+n^0, (-101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2
New rule:
l0 -> l0 : e^0'=e^0-n2, n^0'=n^0-10*n2, (-91+n^0-10*n2 >= 0 /\ e^0-n2 >= 0 /\ n2 >= 0), cost: 2*n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_ACdGka.txt

Applied instantiation
Original rule:
l0 -> l0 : e^0'=e^0-n2, n^0'=n^0-10*n2, (-91+n^0-10*n2 >= 0 /\ e^0-n2 >= 0 /\ n2 >= 0), cost: 2*n2
New rule:
l0 -> l0 : e^0'=0, n^0'=-10*e^0+n^0, (0 >= 0 /\ -91-10*e^0+n^0 >= 0 /\ e^0 >= 0), cost: 2*e^0

Applied simplification
Original rule:
l0 -> l0 : e^0'=0, n^0'=-10*e^0+n^0, (0 >= 0 /\ -91-10*e^0+n^0 >= 0 /\ e^0 >= 0), cost: 2*e^0
New rule:
l0 -> l0 : e^0'=0, n^0'=-10*e^0+n^0, (-91-10*e^0+n^0 >= 0 /\ e^0 >= 0), cost: 2*e^0

Applied deletion
Removed the following rules: 24 25

Accelerated simple loops
Start location: l7
  22: l0 -> l0 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 2
  23: l0 -> l0 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2
  26: l0 -> l0 : e^0'=e^0+n1, n^0'=11*n1+n^0, (111-11*n1-n^0 >= 0 /\ n1 >= 0 /\ -1+e^0 >= 0), cost: 2*n1
  28: l0 -> l0 : e^0'=0, n^0'=-10*e^0+n^0, (-91-10*e^0+n^0 >= 0 /\ e^0 >= 0), cost: 2*e^0
  21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2


Applied chaining
First rule:
l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2
Second rule:
l0 -> l0 : oldn^0'=n^0, e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=11+n^0, (-100+n^0 <= 0 /\ copied^0 <= 0 /\ -1+e^0 >= 0), cost: 2
New rule:
l7 -> l0 : oldn^0'=n^post9, e^0'=2, olde^0'=1, copied^0'=1, n^0'=11+n^post9, -100+n^post9 <= 0, cost: 4

Applied chaining
First rule:
l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2
Second rule:
l0 -> l0 : oldn^0'=n^0, e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-10+n^0, (copied^0 <= 0 /\ -101+n^0 >= 0 /\ -1+e^0 >= 0), cost: 2
New rule:
l7 -> l0 : oldn^0'=n^post9, e^0'=0, olde^0'=1, copied^0'=1, n^0'=-10+n^post9, -101+n^post9 >= 0, cost: 4

Applied chaining
First rule:
l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2
Second rule:
l0 -> l0 : e^0'=e^0+n1, n^0'=11*n1+n^0, (111-11*n1-n^0 >= 0 /\ n1 >= 0 /\ -1+e^0 >= 0), cost: 2*n1
New rule:
l7 -> l0 : e^0'=1+n1, copied^0'=0, n^0'=11*n1+n^post9, (111-11*n1-n^post9 >= 0 /\ n1 >= 0), cost: 2+2*n1

Applied chaining
First rule:
l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2
Second rule:
l0 -> l0 : e^0'=0, n^0'=-10*e^0+n^0, (-91-10*e^0+n^0 >= 0 /\ e^0 >= 0), cost: 2*e^0
New rule:
l7 -> l0 : e^0'=0, copied^0'=0, n^0'=-10+n^post9, -101+n^post9 >= 0, cost: 4

Applied deletion
Removed the following rules: 22 23 26 28

Chained accelerated rules with incoming rules
Start location: l7
  21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2
  29: l7 -> l0 : oldn^0'=n^post9, e^0'=2, olde^0'=1, copied^0'=1, n^0'=11+n^post9, -100+n^post9 <= 0, cost: 4
  30: l7 -> l0 : oldn^0'=n^post9, e^0'=0, olde^0'=1, copied^0'=1, n^0'=-10+n^post9, -101+n^post9 >= 0, cost: 4
  31: l7 -> l0 : e^0'=1+n1, copied^0'=0, n^0'=11*n1+n^post9, (111-11*n1-n^post9 >= 0 /\ n1 >= 0), cost: 2+2*n1
  32: l7 -> l0 : e^0'=0, copied^0'=0, n^0'=-10+n^post9, -101+n^post9 >= 0, cost: 4


Removed unreachable locations and irrelevant leafs
Start location: l7
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0