WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f263_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
   1: f263_0_main_GT -> f263_0_main_GT : arg2'=arg2P1, arg1'=arg1P1, arg3'=arg3P1, (1+arg1 > 0 /\ arg2-arg1 >= 0 /\ arg1-arg3P1 == 0 /\ -1+arg2-arg2P1 == 0 /\ 1+arg1-arg1P1 == 0 /\ -101+arg3 < 0), cost: 1
   2: __init -> f1_0_main_Load : arg2'=arg2P2, arg1'=arg1P2, arg3'=arg3P2, TRUE, cost: 1


Applied preprocessing
Original rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=arg2P1, arg1'=arg1P1, arg3'=arg3P1, (1+arg1 > 0 /\ arg2-arg1 >= 0 /\ arg1-arg3P1 == 0 /\ -1+arg2-arg2P1 == 0 /\ 1+arg1-arg1P1 == 0 /\ -101+arg3 < 0), cost: 1
New rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-1+arg2, arg1'=1+arg1, arg3'=arg1, (1+arg1 > 0 /\ 101-arg3 > 0 /\ arg2-arg1 >= 0), cost: 1

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f263_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
   3: f263_0_main_GT -> f263_0_main_GT : arg2'=-1+arg2, arg1'=1+arg1, arg3'=arg1, (1+arg1 > 0 /\ 101-arg3 > 0 /\ arg2-arg1 >= 0), cost: 1
   2: __init -> f1_0_main_Load : arg2'=arg2P2, arg1'=arg1P2, arg3'=arg3P2, TRUE, cost: 1


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

Applied instantiation
Original rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-n+arg2, arg1'=n+arg1, arg3'=-1+n+arg1, (2-2*n+arg2-arg1 >= 0 /\ 1+arg1 > 0 /\ 101-arg3 > 0 /\ 103-n-arg1 > 0 /\ -1+n >= 0), cost: n
New rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-102+arg2+arg1, arg1'=102, arg3'=101, (1 > 0 /\ 1+arg1 > 0 /\ 101-arg3 > 0 /\ -202+arg2+arg1 >= 0 /\ 101-arg1 >= 0), cost: 102-arg1

Applied simplification
Original rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-102+arg2+arg1, arg1'=102, arg3'=101, (1 > 0 /\ 1+arg1 > 0 /\ 101-arg3 > 0 /\ -202+arg2+arg1 >= 0 /\ 101-arg1 >= 0), cost: 102-arg1
New rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-102+arg2+arg1, arg1'=102, arg3'=101, (1+arg1 > 0 /\ 101-arg3 > 0 /\ -101+arg1 <= 0 /\ -202+arg2+arg1 >= 0), cost: 102-arg1

Applied deletion
Removed the following rules: 3

Accelerated simple loops
Start location: __init
   0: f1_0_main_Load -> f263_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
   5: f263_0_main_GT -> f263_0_main_GT : arg2'=-102+arg2+arg1, arg1'=102, arg3'=101, (1+arg1 > 0 /\ 101-arg3 > 0 /\ -101+arg1 <= 0 /\ -202+arg2+arg1 >= 0), cost: 102-arg1
   2: __init -> f1_0_main_Load : arg2'=arg2P2, arg1'=arg1P2, arg3'=arg3P2, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f263_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
Second rule:
f263_0_main_GT -> f263_0_main_GT : arg2'=-102+arg2+arg1, arg1'=102, arg3'=101, (1+arg1 > 0 /\ 101-arg3 > 0 /\ -101+arg1 <= 0 /\ -202+arg2+arg1 >= 0), cost: 102-arg1
New rule:
f1_0_main_Load -> f263_0_main_GT : arg2'=-102+arg2P0+arg1P0, arg1'=102, arg3'=101, (-101+arg1P0 <= 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ -202+arg2P0+arg1P0 >= 0), cost: 103-arg1P0

Applied deletion
Removed the following rules: 5

Chained accelerated rules with incoming rules
Start location: __init
   0: f1_0_main_Load -> f263_0_main_GT : arg2'=arg2P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3P0 > 0 /\ 1+arg2P0 > 0), cost: 1
   6: f1_0_main_Load -> f263_0_main_GT : arg2'=-102+arg2P0+arg1P0, arg1'=102, arg3'=101, (-101+arg1P0 <= 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ -202+arg2P0+arg1P0 >= 0), cost: 103-arg1P0
   2: __init -> f1_0_main_Load : arg2'=arg2P2, arg1'=arg1P2, arg3'=arg3P2, 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