WORST_CASE(Omega(0),?)

Initial ITS
Start location: l12
   0: l0 -> l1 : i4^0'=i4^post0, k6^0'=k6^post0, j5^0'=j5^post0, (i4^0-i4^post0 == 0 /\ k6^0-k6^post0 == 0 /\ -j5^post0+j5^0 == 0), cost: 1
  13: l1 -> l4 : i4^0'=i4^post13, k6^0'=k6^post13, j5^0'=j5^post13, (-1+i4^post13 == 0 /\ -j5^post13+j5^0 == 0 /\ 6-i4^0 <= 0 /\ k6^0-k6^post13 == 0), cost: 1
  14: l1 -> l2 : i4^0'=i4^post14, k6^0'=k6^post14, j5^0'=j5^post14, (-1+j5^post14 == 0 /\ k6^0-k6^post14 == 0 /\ -5+i4^0 <= 0 /\ i4^0-i4^post14 == 0), cost: 1
   1: l2 -> l3 : i4^0'=i4^post1, k6^0'=k6^post1, j5^0'=j5^post1, (k6^0-k6^post1 == 0 /\ i4^0-i4^post1 == 0 /\ j5^0-j5^post1 == 0), cost: 1
  11: l3 -> l0 : i4^0'=i4^post11, k6^0'=k6^post11, j5^0'=j5^post11, (-k6^post11+k6^0 == 0 /\ -j5^post11+j5^0 == 0 /\ 6-j5^0 <= 0 /\ -1-i4^0+i4^post11 == 0), cost: 1
  12: l3 -> l2 : i4^0'=i4^post12, k6^0'=k6^post12, j5^0'=j5^post12, (-1+j5^post12-j5^0 == 0 /\ i4^0-i4^post12 == 0 /\ -5+j5^0 <= 0 /\ -k6^post12+k6^0 == 0), cost: 1
   2: l4 -> l5 : i4^0'=i4^post2, k6^0'=k6^post2, j5^0'=j5^post2, (k6^0-k6^post2 == 0 /\ j5^0-j5^post2 == 0 /\ i4^0-i4^post2 == 0), cost: 1
   8: l5 -> l10 : i4^0'=i4^post8, k6^0'=k6^post8, j5^0'=j5^post8, (i4^0-i4^post8 == 0 /\ k6^0-k6^post8 == 0 /\ j5^0-j5^post8 == 0 /\ 6-i4^0 <= 0), cost: 1
   9: l5 -> l6 : i4^0'=i4^post9, k6^0'=k6^post9, j5^0'=j5^post9, (i4^0-i4^post9 == 0 /\ -1+j5^post9 == 0 /\ k6^0-k6^post9 == 0 /\ -5+i4^0 <= 0), cost: 1
   3: l6 -> l7 : i4^0'=i4^post3, k6^0'=k6^post3, j5^0'=j5^post3, (j5^0-j5^post3 == 0 /\ i4^0-i4^post3 == 0 /\ k6^0-k6^post3 == 0), cost: 1
   6: l7 -> l4 : i4^0'=i4^post6, k6^0'=k6^post6, j5^0'=j5^post6, (j5^0-j5^post6 == 0 /\ -1-i4^0+i4^post6 == 0 /\ k6^0-k6^post6 == 0 /\ 6-j5^0 <= 0), cost: 1
   7: l7 -> l9 : i4^0'=i4^post7, k6^0'=k6^post7, j5^0'=j5^post7, (-1+k6^post7 == 0 /\ -5+j5^0 <= 0 /\ j5^0-j5^post7 == 0 /\ i4^0-i4^post7 == 0), cost: 1
   4: l8 -> l6 : i4^0'=i4^post4, k6^0'=k6^post4, j5^0'=j5^post4, (-1-j5^0+j5^post4 == 0 /\ 6-k6^0 <= 0 /\ k6^0-k6^post4 == 0 /\ i4^0-i4^post4 == 0), cost: 1
   5: l8 -> l9 : i4^0'=i4^post5, k6^0'=k6^post5, j5^0'=j5^post5, (-1-k6^0+k6^post5 == 0 /\ -5+k6^0 <= 0 /\ i4^0-i4^post5 == 0 /\ j5^0-j5^post5 == 0), cost: 1
  10: l9 -> l8 : i4^0'=i4^post10, k6^0'=k6^post10, j5^0'=j5^post10, (-k6^post10+k6^0 == 0 /\ i4^0-i4^post10 == 0 /\ -j5^post10+j5^0 == 0), cost: 1
  15: l11 -> l0 : i4^0'=i4^post15, k6^0'=k6^post15, j5^0'=j5^post15, (-j5^post15+j5^0 == 0 /\ -1+i4^post15 == 0 /\ k6^0-k6^post15 == 0), cost: 1
  16: l12 -> l11 : i4^0'=i4^post16, k6^0'=k6^post16, j5^0'=j5^post16, (j5^0-j5^post16 == 0 /\ k6^0-k6^post16 == 0 /\ i4^0-i4^post16 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l12
   0: l0 -> l1 : i4^0'=i4^post0, k6^0'=k6^post0, j5^0'=j5^post0, (i4^0-i4^post0 == 0 /\ k6^0-k6^post0 == 0 /\ -j5^post0+j5^0 == 0), cost: 1
  13: l1 -> l4 : i4^0'=i4^post13, k6^0'=k6^post13, j5^0'=j5^post13, (-1+i4^post13 == 0 /\ -j5^post13+j5^0 == 0 /\ 6-i4^0 <= 0 /\ k6^0-k6^post13 == 0), cost: 1
  14: l1 -> l2 : i4^0'=i4^post14, k6^0'=k6^post14, j5^0'=j5^post14, (-1+j5^post14 == 0 /\ k6^0-k6^post14 == 0 /\ -5+i4^0 <= 0 /\ i4^0-i4^post14 == 0), cost: 1
   1: l2 -> l3 : i4^0'=i4^post1, k6^0'=k6^post1, j5^0'=j5^post1, (k6^0-k6^post1 == 0 /\ i4^0-i4^post1 == 0 /\ j5^0-j5^post1 == 0), cost: 1
  11: l3 -> l0 : i4^0'=i4^post11, k6^0'=k6^post11, j5^0'=j5^post11, (-k6^post11+k6^0 == 0 /\ -j5^post11+j5^0 == 0 /\ 6-j5^0 <= 0 /\ -1-i4^0+i4^post11 == 0), cost: 1
  12: l3 -> l2 : i4^0'=i4^post12, k6^0'=k6^post12, j5^0'=j5^post12, (-1+j5^post12-j5^0 == 0 /\ i4^0-i4^post12 == 0 /\ -5+j5^0 <= 0 /\ -k6^post12+k6^0 == 0), cost: 1
   2: l4 -> l5 : i4^0'=i4^post2, k6^0'=k6^post2, j5^0'=j5^post2, (k6^0-k6^post2 == 0 /\ j5^0-j5^post2 == 0 /\ i4^0-i4^post2 == 0), cost: 1
   9: l5 -> l6 : i4^0'=i4^post9, k6^0'=k6^post9, j5^0'=j5^post9, (i4^0-i4^post9 == 0 /\ -1+j5^post9 == 0 /\ k6^0-k6^post9 == 0 /\ -5+i4^0 <= 0), cost: 1
   3: l6 -> l7 : i4^0'=i4^post3, k6^0'=k6^post3, j5^0'=j5^post3, (j5^0-j5^post3 == 0 /\ i4^0-i4^post3 == 0 /\ k6^0-k6^post3 == 0), cost: 1
   6: l7 -> l4 : i4^0'=i4^post6, k6^0'=k6^post6, j5^0'=j5^post6, (j5^0-j5^post6 == 0 /\ -1-i4^0+i4^post6 == 0 /\ k6^0-k6^post6 == 0 /\ 6-j5^0 <= 0), cost: 1
   7: l7 -> l9 : i4^0'=i4^post7, k6^0'=k6^post7, j5^0'=j5^post7, (-1+k6^post7 == 0 /\ -5+j5^0 <= 0 /\ j5^0-j5^post7 == 0 /\ i4^0-i4^post7 == 0), cost: 1
   4: l8 -> l6 : i4^0'=i4^post4, k6^0'=k6^post4, j5^0'=j5^post4, (-1-j5^0+j5^post4 == 0 /\ 6-k6^0 <= 0 /\ k6^0-k6^post4 == 0 /\ i4^0-i4^post4 == 0), cost: 1
   5: l8 -> l9 : i4^0'=i4^post5, k6^0'=k6^post5, j5^0'=j5^post5, (-1-k6^0+k6^post5 == 0 /\ -5+k6^0 <= 0 /\ i4^0-i4^post5 == 0 /\ j5^0-j5^post5 == 0), cost: 1
  10: l9 -> l8 : i4^0'=i4^post10, k6^0'=k6^post10, j5^0'=j5^post10, (-k6^post10+k6^0 == 0 /\ i4^0-i4^post10 == 0 /\ -j5^post10+j5^0 == 0), cost: 1
  15: l11 -> l0 : i4^0'=i4^post15, k6^0'=k6^post15, j5^0'=j5^post15, (-j5^post15+j5^0 == 0 /\ -1+i4^post15 == 0 /\ k6^0-k6^post15 == 0), cost: 1
  16: l12 -> l11 : i4^0'=i4^post16, k6^0'=k6^post16, j5^0'=j5^post16, (j5^0-j5^post16 == 0 /\ k6^0-k6^post16 == 0 /\ i4^0-i4^post16 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : i4^0'=i4^post0, k6^0'=k6^post0, j5^0'=j5^post0, (i4^0-i4^post0 == 0 /\ k6^0-k6^post0 == 0 /\ -j5^post0+j5^0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l3 : i4^0'=i4^post1, k6^0'=k6^post1, j5^0'=j5^post1, (k6^0-k6^post1 == 0 /\ i4^0-i4^post1 == 0 /\ j5^0-j5^post1 == 0), cost: 1
New rule:
l2 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : i4^0'=i4^post2, k6^0'=k6^post2, j5^0'=j5^post2, (k6^0-k6^post2 == 0 /\ j5^0-j5^post2 == 0 /\ i4^0-i4^post2 == 0), cost: 1
New rule:
l4 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l7 : i4^0'=i4^post3, k6^0'=k6^post3, j5^0'=j5^post3, (j5^0-j5^post3 == 0 /\ i4^0-i4^post3 == 0 /\ k6^0-k6^post3 == 0), cost: 1
New rule:
l6 -> l7 : TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l6 : i4^0'=i4^post4, k6^0'=k6^post4, j5^0'=j5^post4, (-1-j5^0+j5^post4 == 0 /\ 6-k6^0 <= 0 /\ k6^0-k6^post4 == 0 /\ i4^0-i4^post4 == 0), cost: 1
New rule:
l8 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l9 : i4^0'=i4^post5, k6^0'=k6^post5, j5^0'=j5^post5, (-1-k6^0+k6^post5 == 0 /\ -5+k6^0 <= 0 /\ i4^0-i4^post5 == 0 /\ j5^0-j5^post5 == 0), cost: 1
New rule:
l8 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l4 : i4^0'=i4^post6, k6^0'=k6^post6, j5^0'=j5^post6, (j5^0-j5^post6 == 0 /\ -1-i4^0+i4^post6 == 0 /\ k6^0-k6^post6 == 0 /\ 6-j5^0 <= 0), cost: 1
New rule:
l7 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l9 : i4^0'=i4^post7, k6^0'=k6^post7, j5^0'=j5^post7, (-1+k6^post7 == 0 /\ -5+j5^0 <= 0 /\ j5^0-j5^post7 == 0 /\ i4^0-i4^post7 == 0), cost: 1
New rule:
l7 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l6 : i4^0'=i4^post9, k6^0'=k6^post9, j5^0'=j5^post9, (i4^0-i4^post9 == 0 /\ -1+j5^post9 == 0 /\ k6^0-k6^post9 == 0 /\ -5+i4^0 <= 0), cost: 1
New rule:
l5 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : i4^0'=i4^post10, k6^0'=k6^post10, j5^0'=j5^post10, (-k6^post10+k6^0 == 0 /\ i4^0-i4^post10 == 0 /\ -j5^post10+j5^0 == 0), cost: 1
New rule:
l9 -> l8 : TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : i4^0'=i4^post11, k6^0'=k6^post11, j5^0'=j5^post11, (-k6^post11+k6^0 == 0 /\ -j5^post11+j5^0 == 0 /\ 6-j5^0 <= 0 /\ -1-i4^0+i4^post11 == 0), cost: 1
New rule:
l3 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : i4^0'=i4^post12, k6^0'=k6^post12, j5^0'=j5^post12, (-1+j5^post12-j5^0 == 0 /\ i4^0-i4^post12 == 0 /\ -5+j5^0 <= 0 /\ -k6^post12+k6^0 == 0), cost: 1
New rule:
l3 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l4 : i4^0'=i4^post13, k6^0'=k6^post13, j5^0'=j5^post13, (-1+i4^post13 == 0 /\ -j5^post13+j5^0 == 0 /\ 6-i4^0 <= 0 /\ k6^0-k6^post13 == 0), cost: 1
New rule:
l1 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l2 : i4^0'=i4^post14, k6^0'=k6^post14, j5^0'=j5^post14, (-1+j5^post14 == 0 /\ k6^0-k6^post14 == 0 /\ -5+i4^0 <= 0 /\ i4^0-i4^post14 == 0), cost: 1
New rule:
l1 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l0 : i4^0'=i4^post15, k6^0'=k6^post15, j5^0'=j5^post15, (-j5^post15+j5^0 == 0 /\ -1+i4^post15 == 0 /\ k6^0-k6^post15 == 0), cost: 1
New rule:
l11 -> l0 : i4^0'=1, TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l11 : i4^0'=i4^post16, k6^0'=k6^post16, j5^0'=j5^post16, (j5^0-j5^post16 == 0 /\ k6^0-k6^post16 == 0 /\ i4^0-i4^post16 == 0), cost: 1
New rule:
l12 -> l11 : TRUE, cost: 1

Simplified rules
Start location: l12
  17: l0 -> l1 : TRUE, cost: 1
  29: l1 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 1
  30: l1 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 1
  18: l2 -> l3 : TRUE, cost: 1
  27: l3 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
  28: l3 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 1
  19: l4 -> l5 : TRUE, cost: 1
  25: l5 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 1
  20: l6 -> l7 : TRUE, cost: 1
  23: l7 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
  24: l7 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 1
  21: l8 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 1
  22: l8 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 1
  26: l9 -> l8 : TRUE, cost: 1
  31: l11 -> l0 : i4^0'=1, TRUE, cost: 1
  32: l12 -> l11 : TRUE, cost: 1


Eliminating location l11 by chaining:

Applied chaining
First rule:
l12 -> l11 : TRUE, cost: 1
Second rule:
l11 -> l0 : i4^0'=1, TRUE, cost: 1
New rule:
l12 -> l0 : i4^0'=1, TRUE, cost: 2

Applied deletion
Removed the following rules: 31 32

Eliminating location l5 by chaining:

Applied chaining
First rule:
l4 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 1
New rule:
l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 19 25

Eliminated locations on linear paths
Start location: l12
  17: l0 -> l1 : TRUE, cost: 1
  29: l1 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 1
  30: l1 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 1
  18: l2 -> l3 : TRUE, cost: 1
  27: l3 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
  28: l3 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 1
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  20: l6 -> l7 : TRUE, cost: 1
  23: l7 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
  24: l7 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 1
  21: l8 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 1
  22: l8 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 1
  26: l9 -> l8 : TRUE, cost: 1
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 1
New rule:
l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 1
New rule:
l0 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 17 29 30

Eliminating location l3 by chaining:

Applied chaining
First rule:
l2 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
New rule:
l2 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2

Applied chaining
First rule:
l2 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 1
New rule:
l2 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 18 27 28

Eliminating location l7 by chaining:

Applied chaining
First rule:
l6 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 1
New rule:
l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2

Applied chaining
First rule:
l6 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 1
New rule:
l6 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 20 23 24

Eliminating location l8 by chaining:

Applied chaining
First rule:
l9 -> l8 : TRUE, cost: 1
Second rule:
l8 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 1
New rule:
l9 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 2

Applied chaining
First rule:
l9 -> l8 : TRUE, cost: 1
Second rule:
l8 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 1
New rule:
l9 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 21 22 26

Eliminated locations on tree-shaped paths
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  36: l0 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  37: l2 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  38: l2 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 2
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  40: l6 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 2
  41: l9 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 2
  42: l9 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 2
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Applied acceleration
Original rule:
l2 -> l2 : j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 2
New rule:
l2 -> l2 : j5^0'=n0+j5^0, (6-n0-j5^0 >= 0 /\ n0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l2 -> l2 : j5^0'=n0+j5^0, (6-n0-j5^0 >= 0 /\ n0 >= 0), cost: 2*n0
New rule:
l2 -> l2 : j5^0'=6, (0 >= 0 /\ 6-j5^0 >= 0), cost: 12-2*j5^0

Applied simplification
Original rule:
l2 -> l2 : j5^0'=6, (0 >= 0 /\ 6-j5^0 >= 0), cost: 12-2*j5^0
New rule:
l2 -> l2 : j5^0'=6, -6+j5^0 <= 0, cost: 12-2*j5^0

Applied deletion
Removed the following rules: 38

Applied acceleration
Original rule:
l9 -> l9 : k6^0'=1+k6^0, -5+k6^0 <= 0, cost: 2
New rule:
l9 -> l9 : k6^0'=k6^0+n3, (6-k6^0-n3 >= 0 /\ n3 >= 0), cost: 2*n3

Applied instantiation
Original rule:
l9 -> l9 : k6^0'=k6^0+n3, (6-k6^0-n3 >= 0 /\ n3 >= 0), cost: 2*n3
New rule:
l9 -> l9 : k6^0'=6, (0 >= 0 /\ 6-k6^0 >= 0), cost: 12-2*k6^0

Applied simplification
Original rule:
l9 -> l9 : k6^0'=6, (0 >= 0 /\ 6-k6^0 >= 0), cost: 12-2*k6^0
New rule:
l9 -> l9 : k6^0'=6, -6+k6^0 <= 0, cost: 12-2*k6^0

Applied deletion
Removed the following rules: 42

Accelerated simple loops
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  36: l0 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  37: l2 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  44: l2 -> l2 : j5^0'=6, -6+j5^0 <= 0, cost: 12-2*j5^0
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  40: l6 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 2
  41: l9 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 2
  46: l9 -> l9 : k6^0'=6, -6+k6^0 <= 0, cost: 12-2*k6^0
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Applied chaining
First rule:
l0 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 2
Second rule:
l2 -> l2 : j5^0'=6, -6+j5^0 <= 0, cost: 12-2*j5^0
New rule:
l0 -> l2 : j5^0'=6, -5+i4^0 <= 0, cost: 12

Applied deletion
Removed the following rules: 44

Applied chaining
First rule:
l6 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 2
Second rule:
l9 -> l9 : k6^0'=6, -6+k6^0 <= 0, cost: 12-2*k6^0
New rule:
l6 -> l9 : k6^0'=6, -5+j5^0 <= 0, cost: 12

Applied deletion
Removed the following rules: 46

Chained accelerated rules with incoming rules
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  36: l0 -> l2 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  47: l0 -> l2 : j5^0'=6, -5+i4^0 <= 0, cost: 12
  37: l2 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  40: l6 -> l9 : k6^0'=1, -5+j5^0 <= 0, cost: 2
  48: l6 -> l9 : k6^0'=6, -5+j5^0 <= 0, cost: 12
  41: l9 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 2
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : j5^0'=6, -5+i4^0 <= 0, cost: 12
Second rule:
l2 -> l0 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
New rule:
l0 -> l0 : i4^0'=1+i4^0, j5^0'=6, (0 >= 0 /\ -5+i4^0 <= 0), cost: 14

Applied simplification
Original rule:
l0 -> l0 : i4^0'=1+i4^0, j5^0'=6, (0 >= 0 /\ -5+i4^0 <= 0), cost: 14
New rule:
l0 -> l0 : i4^0'=1+i4^0, j5^0'=6, -5+i4^0 <= 0, cost: 14

Applied deletion
Removed the following rules: 36 37 47

Eliminating location l9 by chaining:

Applied chaining
First rule:
l6 -> l9 : k6^0'=6, -5+j5^0 <= 0, cost: 12
Second rule:
l9 -> l6 : j5^0'=1+j5^0, -6+k6^0 >= 0, cost: 2
New rule:
l6 -> l6 : k6^0'=6, j5^0'=1+j5^0, (0 >= 0 /\ -5+j5^0 <= 0), cost: 14

Applied simplification
Original rule:
l6 -> l6 : k6^0'=6, j5^0'=1+j5^0, (0 >= 0 /\ -5+j5^0 <= 0), cost: 14
New rule:
l6 -> l6 : k6^0'=6, j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 14

Applied deletion
Removed the following rules: 40 41 48

Eliminated locations on tree-shaped paths
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  49: l0 -> l0 : i4^0'=1+i4^0, j5^0'=6, -5+i4^0 <= 0, cost: 14
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  50: l6 -> l6 : k6^0'=6, j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 14
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : i4^0'=1+i4^0, j5^0'=6, -5+i4^0 <= 0, cost: 14
New rule:
l0 -> l0 : i4^0'=i4^0+n6, j5^0'=6, (6-i4^0-n6 >= 0 /\ -1+n6 >= 0), cost: 14*n6

Applied instantiation
Original rule:
l0 -> l0 : i4^0'=i4^0+n6, j5^0'=6, (6-i4^0-n6 >= 0 /\ -1+n6 >= 0), cost: 14*n6
New rule:
l0 -> l0 : i4^0'=6, j5^0'=6, (0 >= 0 /\ 5-i4^0 >= 0), cost: 84-14*i4^0

Applied simplification
Original rule:
l0 -> l0 : i4^0'=6, j5^0'=6, (0 >= 0 /\ 5-i4^0 >= 0), cost: 84-14*i4^0
New rule:
l0 -> l0 : i4^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 84-14*i4^0

Applied deletion
Removed the following rules: 49

Applied acceleration
Original rule:
l6 -> l6 : k6^0'=6, j5^0'=1+j5^0, -5+j5^0 <= 0, cost: 14
New rule:
l6 -> l6 : k6^0'=6, j5^0'=n9+j5^0, (6-n9-j5^0 >= 0 /\ -1+n9 >= 0), cost: 14*n9

Applied instantiation
Original rule:
l6 -> l6 : k6^0'=6, j5^0'=n9+j5^0, (6-n9-j5^0 >= 0 /\ -1+n9 >= 0), cost: 14*n9
New rule:
l6 -> l6 : k6^0'=6, j5^0'=6, (0 >= 0 /\ 5-j5^0 >= 0), cost: 84-14*j5^0

Applied simplification
Original rule:
l6 -> l6 : k6^0'=6, j5^0'=6, (0 >= 0 /\ 5-j5^0 >= 0), cost: 84-14*j5^0
New rule:
l6 -> l6 : k6^0'=6, j5^0'=6, -5+j5^0 <= 0, cost: 84-14*j5^0

Applied deletion
Removed the following rules: 50

Accelerated simple loops
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  52: l0 -> l0 : i4^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 84-14*i4^0
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  54: l6 -> l6 : k6^0'=6, j5^0'=6, -5+j5^0 <= 0, cost: 84-14*j5^0
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2


Applied chaining
First rule:
l12 -> l0 : i4^0'=1, TRUE, cost: 2
Second rule:
l0 -> l0 : i4^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 84-14*i4^0
New rule:
l12 -> l0 : i4^0'=6, j5^0'=6, -4 <= 0, cost: 72

Applied deletion
Removed the following rules: 52

Applied chaining
First rule:
l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
Second rule:
l6 -> l6 : k6^0'=6, j5^0'=6, -5+j5^0 <= 0, cost: 84-14*j5^0
New rule:
l4 -> l6 : k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 72

Applied deletion
Removed the following rules: 54

Chained accelerated rules with incoming rules
Start location: l12
  35: l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
  34: l4 -> l6 : j5^0'=1, -5+i4^0 <= 0, cost: 2
  56: l4 -> l6 : k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 72
  39: l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
  33: l12 -> l0 : i4^0'=1, TRUE, cost: 2
  55: l12 -> l0 : i4^0'=6, j5^0'=6, -4 <= 0, cost: 72


Eliminating location l0 by chaining:

Applied chaining
First rule:
l12 -> l0 : i4^0'=6, j5^0'=6, -4 <= 0, cost: 72
Second rule:
l0 -> l4 : i4^0'=1, -6+i4^0 >= 0, cost: 2
New rule:
l12 -> l4 : i4^0'=1, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 74

Applied deletion
Removed the following rules: 33 35 55

Eliminating location l6 by chaining:

Applied chaining
First rule:
l4 -> l6 : k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 72
Second rule:
l6 -> l4 : i4^0'=1+i4^0, -6+j5^0 >= 0, cost: 2
New rule:
l4 -> l4 : i4^0'=1+i4^0, k6^0'=6, j5^0'=6, (0 >= 0 /\ -5+i4^0 <= 0), cost: 74

Applied simplification
Original rule:
l4 -> l4 : i4^0'=1+i4^0, k6^0'=6, j5^0'=6, (0 >= 0 /\ -5+i4^0 <= 0), cost: 74
New rule:
l4 -> l4 : i4^0'=1+i4^0, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 74

Applied deletion
Removed the following rules: 34 39 56

Eliminated locations on tree-shaped paths
Start location: l12
  58: l4 -> l4 : i4^0'=1+i4^0, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 74
  57: l12 -> l4 : i4^0'=1, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 74


Applied acceleration
Original rule:
l4 -> l4 : i4^0'=1+i4^0, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 74
New rule:
l4 -> l4 : i4^0'=i4^0+n12, k6^0'=6, j5^0'=6, (6-i4^0-n12 >= 0 /\ -1+n12 >= 0), cost: 74*n12

Applied instantiation
Original rule:
l4 -> l4 : i4^0'=i4^0+n12, k6^0'=6, j5^0'=6, (6-i4^0-n12 >= 0 /\ -1+n12 >= 0), cost: 74*n12
New rule:
l4 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, (0 >= 0 /\ 5-i4^0 >= 0), cost: 444-74*i4^0

Applied simplification
Original rule:
l4 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, (0 >= 0 /\ 5-i4^0 >= 0), cost: 444-74*i4^0
New rule:
l4 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 444-74*i4^0

Applied deletion
Removed the following rules: 58

Accelerated simple loops
Start location: l12
  60: l4 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 444-74*i4^0
  57: l12 -> l4 : i4^0'=1, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 74


Applied chaining
First rule:
l12 -> l4 : i4^0'=1, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 74
Second rule:
l4 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, -5+i4^0 <= 0, cost: 444-74*i4^0
New rule:
l12 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 444

Applied deletion
Removed the following rules: 60

Chained accelerated rules with incoming rules
Start location: l12
  57: l12 -> l4 : i4^0'=1, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 74
  61: l12 -> l4 : i4^0'=6, k6^0'=6, j5^0'=6, (0 >= 0 /\ -4 <= 0), cost: 444


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0