WORST_CASE(INF,?)

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ x4_1>-1 && arg2>0 && arg2P_1<=arg1 && arg1>0 && arg1P_1>2 && arg2P_1>0 && arg2==arg3P_1 ], cost: 1
      1: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1 && arg2>0 && arg2P_2<=arg1 && arg1>0 && arg1P_2>1 && arg2P_2>0 && arg2==arg3P_2 ], cost: 1
      4: f1_0_main_New -> f69_0__init__GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_5>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 && arg3==arg4P_3 ], cost: 1
      3: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ x23_1>-1 && arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 && arg3==arg4P_4 ], cost: 1
      5: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg1P_6>-1 && arg3>1 && arg1>0 && arg2>0 ], cost: 1
      7: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && arg2P_8>0 && arg3P_8>0 && arg4P_8>-1 && 2+arg5<=arg2 ], cost: 1
      6: f69_0__init__GT -> f69_0__init__GT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg1>0 && -1+arg1<arg1 && -1+arg1==arg1P_7 ], cost: 1
      8: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1P_9<=arg1 && arg2P_9<=arg3 && -2+arg2P_9<=arg4 && arg3P_9<=arg3 && -2+arg3P_9<=arg4 && 2+arg4P_9<=arg3 && arg4P_9<=arg4 && arg1>0 && arg2>1 && arg3>2 && arg4>0 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 ], cost: 1
      9: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg3P_10<=arg3 && -2+arg3P_10<=arg4 && 2+arg4P_10<=arg3 && arg4P_10<=arg4 && arg1>2 && arg2>2 && arg3>2 && arg4>0 && arg1P_10>0 && arg2P_10>0 && arg3P_10>2 && arg4P_10>0 ], cost: 1
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg2, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg2P_1<=arg1 && arg1>0 && arg1P_1>2 && arg2P_1>0 ], cost: 1
      1: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg2, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1 && arg2>0 && arg2P_2<=arg1 && arg1>0 && arg1P_2>1 && arg2P_2>0 ], cost: 1
      4: f1_0_main_New -> f69_0__init__GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_5>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg3, arg5'=arg5P_3, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 ], cost: 1
      3: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg3, arg5'=arg5P_4, [ arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 ], cost: 1
      5: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg1P_6>-1 && arg3>1 && arg1>0 && arg2>0 ], cost: 1
      7: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && arg2P_8>0 && arg3P_8>0 && arg4P_8>-1 && 2+arg5<=arg2 ], cost: 1
      6: f69_0__init__GT -> f69_0__init__GT : arg1'=-1+arg1, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg1>0 ], cost: 1
      8: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1P_9<=arg1 && arg2P_9<=arg3 && -2+arg2P_9<=arg4 && arg3P_9<=arg3 && -2+arg3P_9<=arg4 && 2+arg4P_9<=arg3 && arg4P_9<=arg4 && arg1>0 && arg2>1 && arg3>2 && arg4>0 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 ], cost: 1
      9: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg3P_10<=arg3 && -2+arg3P_10<=arg4 && 2+arg4P_10<=arg3 && arg4P_10<=arg4 && arg1>2 && arg2>2 && arg3>2 && arg4>0 && arg1P_10>0 && arg2P_10>0 && arg3P_10>2 && arg4P_10>0 ], cost: 1
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 3.
   Accelerating the following rules:
      6: f69_0__init__GT -> f69_0__init__GT : arg1'=-1+arg1, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg1>0 ], cost: 1

   Accelerated rule 6 with metering function arg1, yielding the new rule 11.
   Removing the simple loops: 6.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1P_9<=arg1 && arg2P_9<=arg3 && -2+arg2P_9<=arg4 && arg3P_9<=arg3 && -2+arg3P_9<=arg4 && 2+arg4P_9<=arg3 && arg4P_9<=arg4 && arg1>0 && arg2>1 && arg3>2 && arg4>0 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 ], cost: 1
      9: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg3P_10<=arg3 && -2+arg3P_10<=arg4 && 2+arg4P_10<=arg3 && arg4P_10<=arg4 && arg1>2 && arg2>2 && arg3>2 && arg4>0 && arg1P_10>0 && arg2P_10>0 && arg3P_10>2 && arg4P_10>0 ], cost: 1

      During metering: Instantiating temporary variables by {arg3P_9==arg3,arg4P_9==1,arg2P_9==2+arg4}
   Accelerated rule 8 with NONTERM (after strengthening guard), yielding the new rule 12.
   Found no metering function for rule 9.
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg2, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg2P_1<=arg1 && arg1>0 && arg1P_1>2 && arg2P_1>0 ], cost: 1
      1: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg2, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1 && arg2>0 && arg2P_2<=arg1 && arg1>0 && arg1P_2>1 && arg2P_2>0 ], cost: 1
      4: f1_0_main_New -> f69_0__init__GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_5>-1 && arg2>0 && arg1>0 ], cost: 1
      2: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg3, arg5'=arg5P_3, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 ], cost: 1
      3: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg3, arg5'=arg5P_4, [ arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 ], cost: 1
      5: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg1P_6>-1 && arg3>1 && arg1>0 && arg2>0 ], cost: 1
      7: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && arg2P_8>0 && arg3P_8>0 && arg4P_8>-1 && 2+arg5<=arg2 ], cost: 1
     11: f69_0__init__GT -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg1>0 ], cost: arg1
      8: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg1P_9<=arg1 && arg2P_9<=arg3 && -2+arg2P_9<=arg4 && arg3P_9<=arg3 && -2+arg3P_9<=arg4 && 2+arg4P_9<=arg3 && arg4P_9<=arg4 && arg1>0 && arg2>1 && arg3>2 && arg4>0 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 ], cost: 1
      9: f292_0_isZero_NONNULL -> f292_0_isZero_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg3P_10<=arg3 && -2+arg3P_10<=arg4 && 2+arg4P_10<=arg3 && arg4P_10<=arg4 && arg1>2 && arg2>2 && arg3>2 && arg4>0 && arg1P_10>0 && arg2P_10>0 && arg3P_10>2 && arg4P_10>0 ], cost: 1
     12: f292_0_isZero_NONNULL -> [7] : [ arg1P_9<=arg1 && arg2P_9<=arg3 && -2+arg2P_9<=arg4 && arg3P_9<=arg3 && -2+arg3P_9<=arg4 && 2+arg4P_9<=arg3 && arg4P_9<=arg4 && arg1>0 && arg2>1 && arg3>2 && arg4>0 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 && arg2P_9<=arg3P_9 && 2+arg4P_9<=arg3P_9 && -2+arg2P_9<=arg4P_9 && -2+arg3P_9<=arg4P_9 ], cost: NONTERM
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg2, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg2P_1<=arg1 && arg1>0 && arg1P_1>2 && arg2P_1>0 ], cost: 1
      1: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg2, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1 && arg2>0 && arg2P_2<=arg1 && arg1>0 && arg1P_2>1 && arg2P_2>0 ], cost: 1
      4: f1_0_main_New -> f69_0__init__GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_5>-1 && arg2>0 && arg1>0 ], cost: 1
     13: f1_0_main_New -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2>0 && arg1>0 && arg1P_5>0 ], cost: 1+arg1P_5
      2: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg3, arg5'=arg5P_3, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 ], cost: 1
      3: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg3, arg5'=arg5P_4, [ arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 ], cost: 1
      5: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg1P_6>-1 && arg3>1 && arg1>0 && arg2>0 ], cost: 1
     14: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && arg1>0 && arg2>0 && arg1P_6>0 ], cost: 1+arg1P_6
      7: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && arg2P_8>0 && arg3P_8>0 && arg4P_8>-1 && 2+arg5<=arg2 ], cost: 1
     15: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg4>1 && arg1>0 && arg2>0 && 2+arg5<=arg2 && arg1P_9>0 && arg2P_9>2 && arg3P_9>2 && arg4P_9>0 && arg2P_9<=arg3 && arg3P_9<=arg3 && 2+arg4P_9<=arg3 && 3<=arg3 && arg1P_9<=arg2 ], cost: 2
     16: f204_0_main_InvokeMethod -> f292_0_isZero_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ arg4>1 && arg1>0 && 2+arg5<=arg2 && arg1P_10>0 && arg2P_10>0 && arg3P_10>2 && arg4P_10>0 && 2+arg2P_10<=arg3 && 3<=arg3 && arg3P_10<=arg3 && 2+arg4P_10<=arg3 && 2+arg1P_10<=arg2 && 3<=arg2 ], cost: 2
     17: f204_0_main_InvokeMethod -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && 2+arg5<=arg2 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg2, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg2P_1<=arg1 && arg1>0 && arg1P_1>2 && arg2P_1>0 ], cost: 1
      1: f1_0_main_New -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg2, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1 && arg2>0 && arg2P_2<=arg1 && arg1>0 && arg1P_2>1 && arg2P_2>0 ], cost: 1
     13: f1_0_main_New -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2>0 && arg1>0 && arg1P_5>0 ], cost: 1+arg1P_5
      2: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg3, arg5'=arg5P_3, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 ], cost: 1
      3: f155_0_main_ArrayAccess -> f204_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg3, arg5'=arg5P_4, [ arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 ], cost: 1
     14: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && arg1>0 && arg2>0 && arg1P_6>0 ], cost: 1+arg1P_6
     17: f204_0_main_InvokeMethod -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg2 && arg4>1 && arg2P_8<=arg3 && arg3P_8<=arg3 && 1+arg4P_8<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_8>0 && 2+arg5<=arg2 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     10: __init -> f1_0_main_New : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     14: f155_0_main_ArrayAccess -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && arg1>0 && arg2>0 && arg1P_6>0 ], cost: 1+arg1P_6
     21: f155_0_main_ArrayAccess -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1>=arg1P_3 && arg3>1 && arg1P_3<=arg2 && arg1>=arg2P_3 && arg1>=-1+arg3P_3 && -1+arg3P_3<=arg2 && arg1>0 && arg2>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1>=2+arg5P_3 && arg1P_8<=arg2P_3 && arg2P_8<=arg3P_3 && arg3P_8<=arg3P_3 && 1+arg4P_8<=arg3P_3 && arg1P_8>0 && 2+arg5P_3<=arg2P_3 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     22: f155_0_main_ArrayAccess -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && arg1P_4<=arg1 && arg1P_4<=arg2 && arg2P_4<=arg1 && arg1>0 && arg2>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1 && arg1P_8<=arg2P_4 && arg2P_8<=arg3P_4 && arg3P_8<=arg3P_4 && 1+arg4P_8<=arg3P_4 && arg1P_8>0 && 2+arg5P_4<=arg2P_4 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     18: __init -> f155_0_main_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg2P_11, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2P_11>0 && arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 ], cost: 2
     19: __init -> f155_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg2P_11, arg4'=arg4P_2, arg5'=arg5P_2, [ -1+arg1P_2<=arg1P_11 && arg2P_11>0 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 ], cost: 2
     20: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2P_11>0 && arg1P_11>0 && arg1P_5>0 ], cost: 2+arg1P_5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     20: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2P_11>0 && arg1P_11>0 && arg1P_5>0 ], cost: 2+arg1P_5
     23: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg2P_11>1 && arg1P_6>0 ], cost: 3+arg1P_6
     24: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg1P_1>=arg1P_3 && arg2P_11>1 && arg1P_3<=arg2P_1 && arg1P_1>=arg2P_3 && arg1P_1>=-1+arg3P_3 && -1+arg3P_3<=arg2P_1 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_1>=2+arg5P_3 && arg1P_8<=arg2P_3 && arg2P_8<=arg3P_3 && arg3P_8<=arg3P_3 && 1+arg4P_8<=arg3P_3 && arg1P_8>0 && 2+arg5P_3<=arg2P_3 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     25: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg2P_11>1 && arg1P_4<=arg1P_1 && arg1P_4<=arg2P_1 && arg2P_4<=arg1P_1 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1P_1 && arg1P_8<=arg2P_4 && arg2P_8<=arg3P_4 && arg3P_8<=arg3P_4 && 1+arg4P_8<=arg3P_4 && arg1P_8>0 && 2+arg5P_4<=arg2P_4 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     26: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg2P_11>1 && arg1P_6>0 ], cost: 3+arg1P_6
     27: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg1P_2>=arg1P_3 && arg2P_11>1 && arg1P_3<=arg2P_2 && arg1P_2>=arg2P_3 && arg1P_2>=-1+arg3P_3 && -1+arg3P_3<=arg2P_2 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_2>=2+arg5P_3 && arg1P_8<=arg2P_3 && arg2P_8<=arg3P_3 && arg3P_8<=arg3P_3 && 1+arg4P_8<=arg3P_3 && arg1P_8>0 && 2+arg5P_3<=arg2P_3 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     28: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg2P_11>1 && arg1P_4<=arg1P_2 && arg1P_4<=arg2P_2 && arg2P_4<=arg1P_2 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1P_2 && arg1P_8<=arg2P_4 && arg2P_8<=arg3P_4 && arg3P_8<=arg3P_4 && 1+arg4P_8<=arg3P_4 && arg1P_8>0 && 2+arg5P_4<=arg2P_4 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     20: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2P_11>0 && arg1P_11>0 && arg1P_5>0 ], cost: 2+arg1P_5
     23: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg2P_11>1 && arg1P_6>0 ], cost: 3+arg1P_6
     24: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg1P_1>=arg1P_3 && arg2P_11>1 && arg1P_3<=arg2P_1 && arg1P_1>=arg2P_3 && arg1P_1>=-1+arg3P_3 && -1+arg3P_3<=arg2P_1 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_1>=2+arg5P_3 && arg1P_8<=arg2P_3 && arg2P_8<=arg3P_3 && arg3P_8<=arg3P_3 && 1+arg4P_8<=arg3P_3 && arg1P_8>0 && 2+arg5P_3<=arg2P_3 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     25: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>2 && arg2P_1>0 && arg2P_11>1 && arg1P_4<=arg1P_1 && arg1P_4<=arg2P_1 && arg2P_4<=arg1P_1 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1P_1 && arg1P_8<=arg2P_4 && arg2P_8<=arg3P_4 && arg3P_8<=arg3P_4 && 1+arg4P_8<=arg3P_4 && arg1P_8>0 && 2+arg5P_4<=arg2P_4 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     26: __init -> f69_0__init__GT : arg1'=0, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg2P_11>1 && arg1P_6>0 ], cost: 3+arg1P_6
     27: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg1P_2>=arg1P_3 && arg2P_11>1 && arg1P_3<=arg2P_2 && arg1P_2>=arg2P_3 && arg1P_2>=-1+arg3P_3 && -1+arg3P_3<=arg2P_2 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_2>=2+arg5P_3 && arg1P_8<=arg2P_3 && arg2P_8<=arg3P_3 && arg3P_8<=arg3P_3 && 1+arg4P_8<=arg3P_3 && arg1P_8>0 && 2+arg5P_3<=arg2P_3 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM
     28: __init -> [7] : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ -1+arg1P_2<=arg1P_11 && arg2P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>1 && arg2P_2>0 && arg2P_11>1 && arg1P_4<=arg1P_2 && arg1P_4<=arg2P_2 && arg2P_4<=arg1P_2 && arg1P_4>0 && arg2P_4>0 && arg3P_4>2 && 2+arg5P_4<=arg1P_2 && arg1P_8<=arg2P_4 && arg2P_8<=arg3P_4 && arg3P_8<=arg3P_4 && 1+arg4P_8<=arg3P_4 && arg1P_8>0 && 2+arg5P_4<=arg2P_4 && arg2P_8>1 && arg3P_8>2 && arg4P_8>0 ], cost: NONTERM

Computing asymptotic complexity for rule 20
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg1P_5 (+/+!), 2+arg1P_5 (+), arg1P_11 (+/+!), arg2P_11 (+/+!) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg1P_5==n,arg1P_11==n,arg2P_11==n}
      resulting limit problem:
      [solved]

   Solution:
      arg1P_5 / n
      arg1P_11 / n
      arg2P_11 / n
   Resulting cost 2+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 2+n
   Rule cost:   2+arg1P_5
   Rule guard:  [ arg2P_11>0 && arg1P_11>0 && arg1P_5>0 ]

WORST_CASE(INF,?)