WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=arg2P0, (-1+arg1P0 > 0 /\ -arg2P0 == 0), cost: 1
   1: f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -10+arg2 < 0 /\ arg1P1 > 0 /\ 1-arg2P1+arg2 == 0 /\ -1-arg1+arg1P1 <= 0 /\ 1+arg2 > 0 /\ 2-arg1+arg2 <= 0), cost: 1
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=arg2P0, (-1+arg1P0 > 0 /\ -arg2P0 == 0), cost: 1
New rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1

Applied preprocessing
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -10+arg2 < 0 /\ arg1P1 > 0 /\ 1-arg2P1+arg2 == 0 /\ -1-arg1+arg1P1 <= 0 /\ 1+arg2 > 0 /\ 2-arg1+arg2 <= 0), cost: 1
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=1+arg2, (arg1P1 > 0 /\ -1-arg1+arg1P1 <= 0 /\ 10-arg2 > 0 /\ 1+arg2 > 0 /\ 2-arg1+arg2 <= 0), cost: 1

Simplified rules
Start location: __init
   3: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1
   4: f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=1+arg2, (arg1P1 > 0 /\ -1-arg1+arg1P1 <= 0 /\ 10-arg2 > 0 /\ 1+arg2 > 0 /\ 2-arg1+arg2 <= 0), cost: 1
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1


Applied acceleration
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=1+arg2, (arg1P1 > 0 /\ -1-arg1+arg1P1 <= 0 /\ 10-arg2 > 0 /\ 1+arg2 > 0 /\ 2-arg1+arg2 <= 0), cost: 1
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=n0+arg2, (arg1P1 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0 /\ 11-n0-arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((-1+arg1P1-n0-arg2 >= 0 /\ -2+arg1-arg2 >= 0) \/ (1+arg1-arg1P1 >= 0 /\ -1+arg1P1-n0-arg2 >= 0))), cost: n0

Applied instantiation
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=n0+arg2, (arg1P1 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0 /\ 11-n0-arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((-1+arg1P1-n0-arg2 >= 0 /\ -2+arg1-arg2 >= 0) \/ (1+arg1-arg1P1 >= 0 /\ -1+arg1P1-n0-arg2 >= 0))), cost: n0
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (arg1P1 > 0 /\ 12-arg1P1 > 0 /\ -2+arg1P1-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((0 >= 0 /\ -2+arg1-arg2 >= 0) \/ (0 >= 0 /\ 1+arg1-arg1P1 >= 0))), cost: -1+arg1P1-arg2

Applied instantiation
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=n0+arg2, (arg1P1 > 0 /\ 1+arg2 > 0 /\ -1+n0 >= 0 /\ 11-n0-arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((-1+arg1P1-n0-arg2 >= 0 /\ -2+arg1-arg2 >= 0) \/ (1+arg1-arg1P1 >= 0 /\ -1+arg1P1-n0-arg2 >= 0))), cost: n0
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, (1 > 0 /\ arg1P1 > 0 /\ 9-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((-11+arg1P1 >= 0 /\ 1+arg1-arg1P1 >= 0) \/ (-11+arg1P1 >= 0 /\ -2+arg1-arg2 >= 0))), cost: 10-arg2

Applied simplification
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (arg1P1 > 0 /\ 12-arg1P1 > 0 /\ -2+arg1P1-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((0 >= 0 /\ -2+arg1-arg2 >= 0) \/ (0 >= 0 /\ 1+arg1-arg1P1 >= 0))), cost: -1+arg1P1-arg2
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (12-arg1P1 > 0 /\ -2+arg1P1-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: -1+arg1P1-arg2

Applied simplification
Original rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, (1 > 0 /\ arg1P1 > 0 /\ 9-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0 /\ ((-11+arg1P1 >= 0 /\ 1+arg1-arg1P1 >= 0) \/ (-11+arg1P1 >= 0 /\ -2+arg1-arg2 >= 0))), cost: 10-arg2
New rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, (-11+arg1P1 >= 0 /\ -9+arg2 <= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: 10-arg2

Applied deletion
Removed the following rules: 4

Accelerated simple loops
Start location: __init
   3: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1
   7: f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (12-arg1P1 > 0 /\ -2+arg1P1-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: -1+arg1P1-arg2
   8: f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, (-11+arg1P1 >= 0 /\ -9+arg2 <= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: 10-arg2
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1
Second rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (12-arg1P1 > 0 /\ -2+arg1P1-arg2 >= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: -1+arg1P1-arg2
New rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (-2+arg1P1 >= 0 /\ 12-arg1P1 > 0), cost: arg1P1

Applied chaining
First rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1
Second rule:
f73_0_m_GE -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, (-11+arg1P1 >= 0 /\ -9+arg2 <= 0 /\ 1+arg2 > 0 /\ 1+arg1-arg1P1 >= 0), cost: 10-arg2
New rule:
f1_0_main_New -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, -11+arg1P1 >= 0, cost: 11

Applied deletion
Removed the following rules: 7 8

Chained accelerated rules with incoming rules
Start location: __init
   3: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P0, arg2'=0, -1+arg1P0 > 0, cost: 1
   9: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P1, arg2'=-1+arg1P1, (-2+arg1P1 >= 0 /\ 12-arg1P1 > 0), cost: arg1P1
  10: f1_0_main_New -> f73_0_m_GE : arg1'=arg1P1, arg2'=10, -11+arg1P1 >= 0, cost: 11
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg2'=arg2P2, TRUE, cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0