WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg2 > 0 /\ -1-2*x100+x90 == 0 /\ arg2-arg2P0 == 0 /\ arg1-arg1P0 == 0 /\ 1+x90 > 0), cost: 1
   2: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ arg2-arg2P2 == 0 /\ arg1-arg1P2 == 0 /\ arg2 > 0 /\ 1+x170 > 0 /\ -2*x180+x170 == 0), cost: 1
   1: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -1-2*x140+x130 == 0 /\ 1-arg1P1 == 0 /\ 1+x130 > 0 /\ arg2 > 0 /\ -2*x140+x130 >= 0 /\ -arg2P1 == 0 /\ -2-2*x140+x130 < 0), cost: 1
   3: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -arg1P3 == 0 /\ 1+x210 > 0 /\ arg2 > 0 /\ 1-arg2P3 == 0 /\ -2*x220+x210 >= 0 /\ -2*x220+x210 == 0 /\ -2-2*x220+x210 < 0), cost: 1
   4: f174_0_test_EQ -> f174_0_test_EQ : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1-arg1P4 == 0 /\ arg1-arg2 == 0 /\ -1+arg1-arg2P4 == 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ arg2 > 0 /\ -1-2*x100+x90 == 0 /\ arg2-arg2P0 == 0 /\ arg1-arg1P0 == 0 /\ 1+x90 > 0), cost: 1
New rule:
f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 2+2*x100 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_Load\' -> f174_0_test_EQ : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -1-2*x140+x130 == 0 /\ 1-arg1P1 == 0 /\ 1+x130 > 0 /\ arg2 > 0 /\ -2*x140+x130 >= 0 /\ -arg2P1 == 0 /\ -2-2*x140+x130 < 0), cost: 1
New rule:
f1_0_main_Load\' -> f174_0_test_EQ : arg1'=1, arg2'=0, (arg1 > 0 /\ arg2 > 0 /\ 2+2*x140 > 0), cost: 1

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

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

Applied preprocessing
Original rule:
f174_0_test_EQ -> f174_0_test_EQ : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1-arg1P4 == 0 /\ arg1-arg2 == 0 /\ -1+arg1-arg2P4 == 0), cost: 1
New rule:
f174_0_test_EQ -> f174_0_test_EQ : arg1'=-1+arg1, arg2'=-1+arg1, arg1-arg2 == 0, cost: 1

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 2+2*x100 > 0 /\ arg2 > 0), cost: 1
   8: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x180 > 0 /\ arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=1, arg2'=0, (arg1 > 0 /\ arg2 > 0 /\ 2+2*x140 > 0), cost: 1
   9: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=0, arg2'=1, (arg1 > 0 /\ 1+2*x220 > 0 /\ arg2 > 0), cost: 1
  10: f174_0_test_EQ -> f174_0_test_EQ : arg1'=-1+arg1, arg2'=-1+arg1, arg1-arg2 == 0, cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied nonterm
Original rule:
f174_0_test_EQ -> f174_0_test_EQ : arg1'=-1+arg1, arg2'=-1+arg1, arg1-arg2 == 0, cost: 1
New rule:
f174_0_test_EQ -> [4] : (-arg1+arg2 >= 0 /\ arg1-arg2 >= 0), cost: NONTERM

Applied acceleration
Original rule:
f174_0_test_EQ -> f174_0_test_EQ : arg1'=-1+arg1, arg2'=-1+arg1, arg1-arg2 == 0, cost: 1
New rule:
f174_0_test_EQ -> f174_0_test_EQ : arg1'=arg1-n0, arg2'=arg1-n0, (-arg1+arg2 >= 0 /\ arg1-arg2 >= 0), cost: n0

Applied deletion
Removed the following rules: 10

Accelerated simple loops
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 2+2*x100 > 0 /\ arg2 > 0), cost: 1
   8: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x180 > 0 /\ arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=1, arg2'=0, (arg1 > 0 /\ arg2 > 0 /\ 2+2*x140 > 0), cost: 1
   9: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=0, arg2'=1, (arg1 > 0 /\ 1+2*x220 > 0 /\ arg2 > 0), cost: 1
  11: f174_0_test_EQ -> [4] : (-arg1+arg2 >= 0 /\ arg1-arg2 >= 0), cost: NONTERM
  12: f174_0_test_EQ -> f174_0_test_EQ : arg1'=arg1-n0, arg2'=arg1-n0, (-arg1+arg2 >= 0 /\ arg1-arg2 >= 0), cost: n0
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied deletion
Removed the following rules: 11 12

Chained accelerated rules with incoming rules
Start location: __init
   6: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 2+2*x100 > 0 /\ arg2 > 0), cost: 1
   8: f1_0_main_Load -> f1_0_main_Load\' : (arg1 > 0 /\ 1+2*x180 > 0 /\ arg2 > 0), cost: 1
   7: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=1, arg2'=0, (arg1 > 0 /\ arg2 > 0 /\ 2+2*x140 > 0), cost: 1
   9: f1_0_main_Load\' -> f174_0_test_EQ : arg1'=0, arg2'=1, (arg1 > 0 /\ 1+2*x220 > 0 /\ arg2 > 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, 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