WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2 > 0 /\ arg1 > 0 /\ arg2-arg1P0 == 0), cost: 1
   1: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, arg1'=arg1P1, (arg1-2*x50 == 0 /\ arg1-arg1P1 == 0 /\ arg1 > 0), cost: 1
   3: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P3, arg1'=arg1P3, (arg1-arg1P3 == 0 /\ arg1 > 0 /\ -1-2*x90+arg1 == 0), cost: 1
   2: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P2, arg1'=arg1P2, (-1-arg1P2+arg1 == 0 /\ arg1 > 0 /\ arg1-2*x70 >= 0 /\ arg1-2*x70 == 0 /\ -2+arg1-2*x70 < 0), cost: 1
   4: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=arg1P4, (-2-2*x110+arg1 < 0 /\ -2*x110+arg1 >= 0 /\ 3-arg1P4+arg1 == 0 /\ arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1
   5: __init -> f1_0_main_Load : arg2'=arg2P5, arg1'=arg1P5, TRUE, cost: 1


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

Applied preprocessing
Original rule:
f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, arg1'=arg1P1, (arg1-2*x50 == 0 /\ arg1-arg1P1 == 0 /\ arg1 > 0), cost: 1
New rule:
f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, (arg1-2*x50 == 0 /\ arg1 > 0), cost: 1

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

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

Applied preprocessing
Original rule:
f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=arg1P4, (-2-2*x110+arg1 < 0 /\ -2*x110+arg1 >= 0 /\ 3-arg1P4+arg1 == 0 /\ arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1
New rule:
f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2, (1+arg2 > 0 /\ arg1 > 0), cost: 1
   7: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, (arg1-2*x50 == 0 /\ arg1 > 0), cost: 1
   9: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P3, (arg1 > 0 /\ -1-2*x90+arg1 == 0), cost: 1
   8: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1
  10: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1
   5: __init -> f1_0_main_Load : arg2'=arg2P5, arg1'=arg1P5, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P5, arg1'=arg1P5, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2, (1+arg2 > 0 /\ arg1 > 0), cost: 1
New rule:
__init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2

Applied deletion
Removed the following rules: 5 6

Eliminated locations on linear paths
Start location: __init
   7: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, (arg1-2*x50 == 0 /\ arg1 > 0), cost: 1
   9: f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P3, (arg1 > 0 /\ -1-2*x90+arg1 == 0), cost: 1
   8: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1
  10: f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1
  11: __init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2


Eliminating location f49_0_increase_LE\' by chaining:

Applied chaining
First rule:
f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P1, (arg1-2*x50 == 0 /\ arg1 > 0), cost: 1
Second rule:
f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1 > 0 /\ arg1-2*x70 == 0), cost: 1
New rule:
f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1-2*x50 == 0 /\ arg1 > 0 /\ arg1-2*x70 == 0), cost: 2

Applied chaining
First rule:
f49_0_increase_LE -> f49_0_increase_LE\' : arg2'=arg2P3, (arg1 > 0 /\ -1-2*x90+arg1 == 0), cost: 1
Second rule:
f49_0_increase_LE\' -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x110+arg1 == 0), cost: 1
New rule:
f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x90+arg1 == 0 /\ -1-2*x110+arg1 == 0), cost: 2

Applied deletion
Removed the following rules: 7 8 9 10

Eliminated locations on tree-shaped paths
Start location: __init
  12: f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1-2*x50 == 0 /\ arg1 > 0 /\ arg1-2*x70 == 0), cost: 2
  13: f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x90+arg1 == 0 /\ -1-2*x110+arg1 == 0), cost: 2
  11: __init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2


Accelerated simple loops
Start location: __init
  12: f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1-2*x50 == 0 /\ arg1 > 0 /\ arg1-2*x70 == 0), cost: 2
  13: f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x90+arg1 == 0 /\ -1-2*x110+arg1 == 0), cost: 2
  11: __init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2


Applied chaining
First rule:
__init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2
Second rule:
f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+arg1, (arg1-2*x50 == 0 /\ arg1 > 0 /\ arg1-2*x70 == 0), cost: 2
New rule:
__init -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+2*x70, 2*x70 > 0, cost: 4

Applied chaining
First rule:
__init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2
Second rule:
f49_0_increase_LE -> f49_0_increase_LE : arg2'=arg2P4, arg1'=3+arg1, (arg1 > 0 /\ -1-2*x90+arg1 == 0 /\ -1-2*x110+arg1 == 0), cost: 2
New rule:
__init -> f49_0_increase_LE : arg2'=arg2P4, arg1'=4+2*x90, 1+2*x90 > 0, cost: 4

Applied deletion
Removed the following rules: 12 13

Chained accelerated rules with incoming rules
Start location: __init
  11: __init -> f49_0_increase_LE : arg2'=arg2P0, arg1'=arg2P5, (arg1P5 > 0 /\ 1+arg2P5 > 0), cost: 2
  14: __init -> f49_0_increase_LE : arg2'=arg2P2, arg1'=-1+2*x70, 2*x70 > 0, cost: 4
  15: __init -> f49_0_increase_LE : arg2'=arg2P4, arg1'=4+2*x90, 1+2*x90 > 0, cost: 4


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