WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f191_0_main_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ -1-arg1P0+arg2 == 0 /\ -arg3P0 == 0 /\ -arg2P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1
   1: f191_0_main_LE -> f191_0_main_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg3 > 0 /\ arg2 > 0 /\ -1+arg1-arg1P1 == 0), cost: 1
   2: f191_0_main_LE -> f191_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1-arg2P2 == 0 /\ -1+arg1-arg1P2 == 0 /\ 1-arg3P2 == 0 /\ arg2 > 0), cost: 1
   3: f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1P3 > 0 /\ -1+arg2 < 0), cost: 1
   4: f270_0_length_FieldAccess -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (arg1 > 0 /\ 1+arg1P4 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1


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

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

Applied preprocessing
Original rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1-arg2P2 == 0 /\ -1+arg1-arg1P2 == 0 /\ 1-arg3P2 == 0 /\ arg2 > 0), cost: 1
New rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=-1+arg1, arg3'=1, arg2'=arg1, arg2 > 0, cost: 1

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

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

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f191_0_main_LE : arg1'=-1+arg2, arg3'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f191_0_main_LE -> f191_0_main_LE : arg1'=-1+arg1, arg3'=arg3P1, arg2'=arg1, (arg3 > 0 /\ arg2 > 0), cost: 1
   8: f191_0_main_LE -> f191_0_main_LE : arg1'=-1+arg1, arg3'=1, arg2'=arg1, arg2 > 0, cost: 1
   9: f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1P3 > 0 /\ 1-arg2 > 0), cost: 1
  10: f270_0_length_FieldAccess -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1+arg1P4 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1


Applied acceleration
Original rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=-1+arg1, arg3'=arg3P1, arg2'=arg1, (arg3 > 0 /\ arg2 > 0), cost: 1
New rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=arg1-n1, arg3'=arg3P1, arg2'=1+arg1-n1, (arg3 > 0 /\ 2+arg1-n1 > 0 /\ arg2 > 0 /\ arg3P1 > 0 /\ -1+n1 >= 0), cost: n1

Applied instantiation
Original rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=arg1-n1, arg3'=arg3P1, arg2'=1+arg1-n1, (arg3 > 0 /\ 2+arg1-n1 > 0 /\ arg2 > 0 /\ arg3P1 > 0 /\ -1+n1 >= 0), cost: n1
New rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=-1, arg3'=arg3P1, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ arg3 > 0 /\ arg2 > 0 /\ arg3P1 > 0), cost: 1+arg1

Applied acceleration
Original rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=-1+arg1, arg3'=1, arg2'=arg1, arg2 > 0, cost: 1
New rule:
f191_0_main_LE -> f191_0_main_LE : arg1'=arg1-n3, arg3'=1, arg2'=1+arg1-n3, (2+arg1-n3 > 0 /\ -1+n3 >= 0 /\ arg2 > 0), cost: n3

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

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

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

Applied deletion
Removed the following rules: 7 8

Accelerated simple loops
Start location: __init
   6: f1_0_main_Load -> f191_0_main_LE : arg1'=-1+arg2, arg3'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1P3 > 0 /\ 1-arg2 > 0), cost: 1
  13: f191_0_main_LE -> f191_0_main_LE : arg1'=-1, arg3'=arg3P1, arg2'=0, (arg1 >= 0 /\ arg3 > 0 /\ arg2 > 0 /\ arg3P1 > 0), cost: 1+arg1
  14: f191_0_main_LE -> f191_0_main_LE : arg1'=-1, arg3'=1, arg2'=0, (arg1 >= 0 /\ arg2 > 0), cost: 1+arg1
  10: f270_0_length_FieldAccess -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1+arg1P4 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, TRUE, cost: 1


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

Applied deletion
Removed the following rules: 13 14

Applied chaining
First rule:
f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1P3 > 0 /\ 1-arg2 > 0), cost: 1
Second rule:
f270_0_length_FieldAccess -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1+arg1P4 > 0 /\ 1-arg1+arg1P4 <= 0), cost: 1
New rule:
f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1-arg2 > 0 /\ 1+arg1P4 > 0), cost: 2

Applied deletion
Removed the following rules: 10

Chained accelerated rules with incoming rules
Start location: __init
   6: f1_0_main_Load -> f191_0_main_LE : arg1'=-1+arg2, arg3'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
  15: f1_0_main_Load -> f191_0_main_LE : arg1'=-1, arg3'=1, arg2'=0, (arg1 > 0 /\ arg2 > 0), cost: 1+arg2
   9: f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1P3 > 0 /\ 1-arg2 > 0), cost: 1
  16: f191_0_main_LE -> f270_0_length_FieldAccess : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1-arg2 > 0 /\ 1+arg1P4 > 0), cost: 2
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg3'=arg3P5, 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