WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f291_0_solve_GE : arg2'=arg2P0, arg1'=arg1P0, (-arg1P0 == 0 /\ -arg2 == 0 /\ arg1 > 0 /\ -arg2P0 == 0), cost: 1
   1: f1_0_main_Load -> f291_0_solve_GE : arg2'=arg2P1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1-arg2P1 == 0 /\ 1+arg1P1 > 0), cost: 1
   2: f291_0_solve_GE -> f291_0_solve_GE : arg2'=arg2P2, arg1'=arg1P2, (-1+arg1-arg1P2 == 0 /\ -2+arg2 < 0 /\ -1 < 0 /\ -1+arg1 > 0 /\ arg2-arg2P2 == 0), cost: 1
   3: f291_0_solve_GE -> f291_0_solve_GE : arg2'=arg2P3, arg1'=arg1P3, (-1-arg1P3+arg1 == 0 /\ -2+arg2 < 0 /\ arg2-arg2P3 == 0 /\ -1 < 0 /\ -1+arg1 > 0), cost: 1
   4: __init -> f1_0_main_Load : arg2'=arg2P4, arg1'=arg1P4, TRUE, cost: 1


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

Applied preprocessing
Original rule:
f1_0_main_Load -> f291_0_solve_GE : arg2'=arg2P1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1-arg2P1 == 0 /\ 1+arg1P1 > 0), cost: 1
New rule:
f1_0_main_Load -> f291_0_solve_GE : arg2'=1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1+arg1P1 > 0), cost: 1

Applied preprocessing
Original rule:
f291_0_solve_GE -> f291_0_solve_GE : arg2'=arg2P2, arg1'=arg1P2, (-1+arg1-arg1P2 == 0 /\ -2+arg2 < 0 /\ -1 < 0 /\ -1+arg1 > 0 /\ arg2-arg2P2 == 0), cost: 1
New rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1

Applied preprocessing
Original rule:
f291_0_solve_GE -> f291_0_solve_GE : arg2'=arg2P3, arg1'=arg1P3, (-1-arg1P3+arg1 == 0 /\ -2+arg2 < 0 /\ arg2-arg2P3 == 0 /\ -1 < 0 /\ -1+arg1 > 0), cost: 1
New rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1

Simplified rules
Start location: __init
   5: f1_0_main_Load -> f291_0_solve_GE : arg2'=0, arg1'=0, (arg2 == 0 /\ arg1 > 0), cost: 1
   6: f1_0_main_Load -> f291_0_solve_GE : arg2'=1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1+arg1P1 > 0), cost: 1
   7: f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1
   4: __init -> f1_0_main_Load : arg2'=arg2P4, arg1'=arg1P4, TRUE, cost: 1


Applied acceleration
Original rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=-1+arg1, (2-arg2 > 0 /\ -1+arg1 > 0), cost: 1
New rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=-n+arg1, (-n+arg1 > 0 /\ n >= 0 /\ 2-arg2 > 0), cost: n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_HEmnaM.txt

Applied instantiation
Original rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=-n+arg1, (-n+arg1 > 0 /\ n >= 0 /\ 2-arg2 > 0), cost: n
New rule:
f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (1 > 0 /\ 2-arg2 > 0 /\ -1+arg1 >= 0), cost: -1+arg1

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

Applied deletion
Removed the following rules: 7

Accelerated simple loops
Start location: __init
   5: f1_0_main_Load -> f291_0_solve_GE : arg2'=0, arg1'=0, (arg2 == 0 /\ arg1 > 0), cost: 1
   6: f1_0_main_Load -> f291_0_solve_GE : arg2'=1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1+arg1P1 > 0), cost: 1
   9: f291_0_solve_GE -> f291_0_solve_GE : arg1'=1, (2-arg2 > 0 /\ -1+arg1 >= 0), cost: -1+arg1
   4: __init -> f1_0_main_Load : arg2'=arg2P4, arg1'=arg1P4, TRUE, cost: 1


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

Applied deletion
Removed the following rules: 9

Chained accelerated rules with incoming rules
Start location: __init
   5: f1_0_main_Load -> f291_0_solve_GE : arg2'=0, arg1'=0, (arg2 == 0 /\ arg1 > 0), cost: 1
   6: f1_0_main_Load -> f291_0_solve_GE : arg2'=1, arg1'=arg1P1, (arg2 > 0 /\ arg1 > 0 /\ 1+arg1P1 > 0), cost: 1
  10: f1_0_main_Load -> f291_0_solve_GE : arg2'=1, arg1'=1, (-1+arg1P1 >= 0 /\ arg2 > 0 /\ arg1 > 0), cost: arg1P1
   4: __init -> f1_0_main_Load : arg2'=arg2P4, arg1'=arg1P4, 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