WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : Result_4^0'=Result_4^post0, ___retres3_7^0'=___retres3_7^post0, x_6^0'=x_6^post0, ___cil_tmp4_8^0'=___cil_tmp4_8^post0, i_5^0'=i_5^post0, (10-x_6^0 <= 0 /\ ___cil_tmp4_8^post0-___retres3_7^post0 == 0 /\ ___retres3_7^post0 == 0 /\ -___cil_tmp4_8^post0+Result_4^post0 == 0 /\ x_6^0-x_6^post0 == 0 /\ -i_5^post0+i_5^0 == 0), cost: 1
   1: l0 -> l1 : Result_4^0'=Result_4^post1, ___retres3_7^0'=___retres3_7^post1, x_6^0'=x_6^post1, ___cil_tmp4_8^0'=___cil_tmp4_8^post1, i_5^0'=i_5^post1, (___retres3_7^post1 == 0 /\ -x_6^post1+x_6^0 == 0 /\ -9+x_6^0 <= 0 /\ -___cil_tmp4_8^post1+Result_4^post1 == 0 /\ -___retres3_7^post1+___cil_tmp4_8^post1 == 0 /\ -i_5^post1+i_5^0 == 0 /\ -100+i_5^0 <= 0), cost: 1
   2: l0 -> l2 : Result_4^0'=Result_4^post2, ___retres3_7^0'=___retres3_7^post2, x_6^0'=x_6^post2, ___cil_tmp4_8^0'=___cil_tmp4_8^post2, i_5^0'=i_5^post2, (Result_4^0-Result_4^post2 == 0 /\ -___cil_tmp4_8^post2+___cil_tmp4_8^0 == 0 /\ -x_6^post2+x_6^0 == 0 /\ -9+x_6^0 <= 0 /\ ___retres3_7^0-___retres3_7^post2 == 0 /\ 1+i_5^post2-i_5^0 == 0 /\ 101-i_5^0 <= 0), cost: 1
   3: l2 -> l0 : Result_4^0'=Result_4^post3, ___retres3_7^0'=___retres3_7^post3, x_6^0'=x_6^post3, ___cil_tmp4_8^0'=___cil_tmp4_8^post3, i_5^0'=i_5^post3, (-i_5^post3+i_5^0 == 0 /\ x_6^0-x_6^post3 == 0 /\ ___cil_tmp4_8^0-___cil_tmp4_8^post3 == 0 /\ ___retres3_7^0-___retres3_7^post3 == 0 /\ Result_4^0-Result_4^post3 == 0), cost: 1
   4: l3 -> l0 : Result_4^0'=Result_4^post4, ___retres3_7^0'=___retres3_7^post4, x_6^0'=x_6^post4, ___cil_tmp4_8^0'=___cil_tmp4_8^post4, i_5^0'=i_5^post4, (-1000+i_5^post4 == 0 /\ -x_6^post4+x_6^0 == 0 /\ -___cil_tmp4_8^post4+___cil_tmp4_8^0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ ___retres3_7^0-___retres3_7^post4 == 0), cost: 1
   5: l4 -> l3 : Result_4^0'=Result_4^post5, ___retres3_7^0'=___retres3_7^post5, x_6^0'=x_6^post5, ___cil_tmp4_8^0'=___cil_tmp4_8^post5, i_5^0'=i_5^post5, (-i_5^post5+i_5^0 == 0 /\ x_6^0-x_6^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -___cil_tmp4_8^post5+___cil_tmp4_8^0 == 0 /\ ___retres3_7^0-___retres3_7^post5 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l4
   2: l0 -> l2 : Result_4^0'=Result_4^post2, ___retres3_7^0'=___retres3_7^post2, x_6^0'=x_6^post2, ___cil_tmp4_8^0'=___cil_tmp4_8^post2, i_5^0'=i_5^post2, (Result_4^0-Result_4^post2 == 0 /\ -___cil_tmp4_8^post2+___cil_tmp4_8^0 == 0 /\ -x_6^post2+x_6^0 == 0 /\ -9+x_6^0 <= 0 /\ ___retres3_7^0-___retres3_7^post2 == 0 /\ 1+i_5^post2-i_5^0 == 0 /\ 101-i_5^0 <= 0), cost: 1
   3: l2 -> l0 : Result_4^0'=Result_4^post3, ___retres3_7^0'=___retres3_7^post3, x_6^0'=x_6^post3, ___cil_tmp4_8^0'=___cil_tmp4_8^post3, i_5^0'=i_5^post3, (-i_5^post3+i_5^0 == 0 /\ x_6^0-x_6^post3 == 0 /\ ___cil_tmp4_8^0-___cil_tmp4_8^post3 == 0 /\ ___retres3_7^0-___retres3_7^post3 == 0 /\ Result_4^0-Result_4^post3 == 0), cost: 1
   4: l3 -> l0 : Result_4^0'=Result_4^post4, ___retres3_7^0'=___retres3_7^post4, x_6^0'=x_6^post4, ___cil_tmp4_8^0'=___cil_tmp4_8^post4, i_5^0'=i_5^post4, (-1000+i_5^post4 == 0 /\ -x_6^post4+x_6^0 == 0 /\ -___cil_tmp4_8^post4+___cil_tmp4_8^0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ ___retres3_7^0-___retres3_7^post4 == 0), cost: 1
   5: l4 -> l3 : Result_4^0'=Result_4^post5, ___retres3_7^0'=___retres3_7^post5, x_6^0'=x_6^post5, ___cil_tmp4_8^0'=___cil_tmp4_8^post5, i_5^0'=i_5^post5, (-i_5^post5+i_5^0 == 0 /\ x_6^0-x_6^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -___cil_tmp4_8^post5+___cil_tmp4_8^0 == 0 /\ ___retres3_7^0-___retres3_7^post5 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : Result_4^0'=Result_4^post2, ___retres3_7^0'=___retres3_7^post2, x_6^0'=x_6^post2, ___cil_tmp4_8^0'=___cil_tmp4_8^post2, i_5^0'=i_5^post2, (Result_4^0-Result_4^post2 == 0 /\ -___cil_tmp4_8^post2+___cil_tmp4_8^0 == 0 /\ -x_6^post2+x_6^0 == 0 /\ -9+x_6^0 <= 0 /\ ___retres3_7^0-___retres3_7^post2 == 0 /\ 1+i_5^post2-i_5^0 == 0 /\ 101-i_5^0 <= 0), cost: 1
New rule:
l0 -> l2 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : Result_4^0'=Result_4^post3, ___retres3_7^0'=___retres3_7^post3, x_6^0'=x_6^post3, ___cil_tmp4_8^0'=___cil_tmp4_8^post3, i_5^0'=i_5^post3, (-i_5^post3+i_5^0 == 0 /\ x_6^0-x_6^post3 == 0 /\ ___cil_tmp4_8^0-___cil_tmp4_8^post3 == 0 /\ ___retres3_7^0-___retres3_7^post3 == 0 /\ Result_4^0-Result_4^post3 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : Result_4^0'=Result_4^post4, ___retres3_7^0'=___retres3_7^post4, x_6^0'=x_6^post4, ___cil_tmp4_8^0'=___cil_tmp4_8^post4, i_5^0'=i_5^post4, (-1000+i_5^post4 == 0 /\ -x_6^post4+x_6^0 == 0 /\ -___cil_tmp4_8^post4+___cil_tmp4_8^0 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ ___retres3_7^0-___retres3_7^post4 == 0), cost: 1
New rule:
l3 -> l0 : i_5^0'=1000, TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : Result_4^0'=Result_4^post5, ___retres3_7^0'=___retres3_7^post5, x_6^0'=x_6^post5, ___cil_tmp4_8^0'=___cil_tmp4_8^post5, i_5^0'=i_5^post5, (-i_5^post5+i_5^0 == 0 /\ x_6^0-x_6^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -___cil_tmp4_8^post5+___cil_tmp4_8^0 == 0 /\ ___retres3_7^0-___retres3_7^post5 == 0), cost: 1
New rule:
l4 -> l3 : TRUE, cost: 1

Simplified rules
Start location: l4
   6: l0 -> l2 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 1
   7: l2 -> l0 : TRUE, cost: 1
   8: l3 -> l0 : i_5^0'=1000, TRUE, cost: 1
   9: l4 -> l3 : TRUE, cost: 1


Eliminating location l3 by chaining:

Applied chaining
First rule:
l4 -> l3 : TRUE, cost: 1
Second rule:
l3 -> l0 : i_5^0'=1000, TRUE, cost: 1
New rule:
l4 -> l0 : i_5^0'=1000, TRUE, cost: 2

Applied deletion
Removed the following rules: 8 9

Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 1
Second rule:
l2 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 2

Applied deletion
Removed the following rules: 6 7

Eliminated locations on linear paths
Start location: l4
  11: l0 -> l0 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 2
  10: l4 -> l0 : i_5^0'=1000, TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : i_5^0'=-1+i_5^0, (-101+i_5^0 >= 0 /\ -9+x_6^0 <= 0), cost: 2
New rule:
l0 -> l0 : i_5^0'=-n0+i_5^0, (-100-n0+i_5^0 >= 0 /\ n0 >= 0 /\ 9-x_6^0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l0 -> l0 : i_5^0'=-n0+i_5^0, (-100-n0+i_5^0 >= 0 /\ n0 >= 0 /\ 9-x_6^0 >= 0), cost: 2*n0
New rule:
l0 -> l0 : i_5^0'=100, (0 >= 0 /\ 9-x_6^0 >= 0 /\ -100+i_5^0 >= 0), cost: -200+2*i_5^0

Applied simplification
Original rule:
l0 -> l0 : i_5^0'=100, (0 >= 0 /\ 9-x_6^0 >= 0 /\ -100+i_5^0 >= 0), cost: -200+2*i_5^0
New rule:
l0 -> l0 : i_5^0'=100, (-9+x_6^0 <= 0 /\ -100+i_5^0 >= 0), cost: -200+2*i_5^0

Applied deletion
Removed the following rules: 11

Accelerated simple loops
Start location: l4
  13: l0 -> l0 : i_5^0'=100, (-9+x_6^0 <= 0 /\ -100+i_5^0 >= 0), cost: -200+2*i_5^0
  10: l4 -> l0 : i_5^0'=1000, TRUE, cost: 2


Applied chaining
First rule:
l4 -> l0 : i_5^0'=1000, TRUE, cost: 2
Second rule:
l0 -> l0 : i_5^0'=100, (-9+x_6^0 <= 0 /\ -100+i_5^0 >= 0), cost: -200+2*i_5^0
New rule:
l4 -> l0 : i_5^0'=100, -9+x_6^0 <= 0, cost: 1802

Applied deletion
Removed the following rules: 13

Chained accelerated rules with incoming rules
Start location: l4
  10: l4 -> l0 : i_5^0'=1000, TRUE, cost: 2
  14: l4 -> l0 : i_5^0'=100, -9+x_6^0 <= 0, cost: 1802


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0