WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg4P_1>-1 && arg2>2 && arg2P_1>-1 && arg1P_1>-1 && arg1>0 && 0==arg3P_1 ], cost: 1
      1: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2>=x20_1 && arg4>0 && 1==arg3 && arg1==arg1P_2 && arg2==arg2P_2 && 1==arg3P_2 && arg4==arg4P_2 ], cost: 1
      3: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>0 && arg1>=x31_1 && 0==arg3 && arg1==arg1P_4 && arg2==arg2P_4 && 0==arg3P_4 && arg4==arg4P_4 ], cost: 1
      5: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2>=x41_1 && arg1>0 && 1==arg3 && 0==arg4 && arg1==arg1P_6 && arg2==arg2P_6 && 1==arg3P_6 && 0==arg4P_6 ], cost: 1
      7: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1>0 && arg1>x51_1 && 0==arg3 && 0==arg4 && arg1==arg1P_8 && arg2==arg2P_8 && 0==arg3P_8 && 0==arg4P_8 ], cost: 1
      9: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg2>0 && arg2>x61_1 && 0==arg1 && 1==arg3 && 0==arg4 && 0==arg1P_10 && arg2==arg2P_10 && 1==arg3P_10 && 0==arg4P_10 ], cost: 1
     11: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>0 && 0==arg1 && 0==arg3 && 0==arg4 && 0==arg1P_12 && arg2==arg2P_12 && 1==arg3P_12 && 0==arg4P_12 ], cost: 1
      2: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg4>0 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 && 1==arg3 && 2*arg1==arg2P_3 && 0==arg3P_3 && arg4==arg4P_3 ], cost: 1
      4: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg4P_5 && arg4>0 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 && 0==arg3 && 2*arg4==arg1P_5 && arg2==arg2P_5 && 1==arg3P_5 ], cost: 1
      6: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 && 1==arg3 && 0==arg4 && 2*arg1==arg2P_7 && 0==arg3P_7 && 0==arg4P_7 ], cost: 1
      8: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>arg4P_9 && arg1>0 && arg1-2*arg4P_9<2 && arg1-2*arg4P_9>=0 && 0==arg3 && 0==arg4 && 0==arg1P_9 && arg2==arg2P_9 && 1==arg3P_9 ], cost: 1
     10: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>arg1P_11 && arg2>0 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 && 0==arg1 && 1==arg3 && 0==arg4 && 0==arg2P_11 && 0==arg3P_11 && 0==arg4P_11 ], cost: 1
     12: __init -> f1_0_main_Load : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     12: __init -> f1_0_main_Load : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2>2 && arg2P_1>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, [ arg4>0 && 1==arg3 ], cost: 1
      3: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, [ arg4>0 && 0==arg3 ], cost: 1
      5: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 ], cost: 1
      7: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, arg4'=0, [ arg1>0 && 0==arg3 && 0==arg4 ], cost: 1
      9: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
     11: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 0==arg3 && 0==arg4 ], cost: 1
      2: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 && 1==arg3 ], cost: 1
      4: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg1>=arg4P_5 && arg4>0 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 && 0==arg3 ], cost: 1
      6: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 && 1==arg3 && 0==arg4 ], cost: 1
      8: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=arg4P_9, [ arg1>0 && arg1-2*arg4P_9<2 && arg1-2*arg4P_9>=0 && 0==arg3 && 0==arg4 ], cost: 1
     10: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
     12: __init -> f1_0_main_Load : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
     11: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 0==arg3 && 0==arg4 ], cost: 1

   Accelerated rule 11 with metering function 1-arg3, yielding the new rule 13.
   Removing the simple loops: 11.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2>2 && arg2P_1>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, [ arg4>0 && 1==arg3 ], cost: 1
      3: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, [ arg4>0 && 0==arg3 ], cost: 1
      5: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 ], cost: 1
      7: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, arg4'=0, [ arg1>0 && 0==arg3 && 0==arg4 ], cost: 1
      9: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
     13: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 0==arg3 && 0==arg4 ], cost: 1-arg3
      2: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 && 1==arg3 ], cost: 1
      4: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg1>=arg4P_5 && arg4>0 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 && 0==arg3 ], cost: 1
      6: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 && 1==arg3 && 0==arg4 ], cost: 1
      8: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=arg4P_9, [ arg1>0 && arg1-2*arg4P_9<2 && arg1-2*arg4P_9>=0 && 0==arg3 && 0==arg4 ], cost: 1
     10: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
     12: __init -> f1_0_main_Load : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2>2 && arg2P_1>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
     14: f1_0_main_Load -> f257_0_loop_GT : arg1'=0, arg2'=arg2P_1, arg3'=1, arg4'=0, [ arg2>2 && arg1>0 && arg2P_1>0 ], cost: 2
      1: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, [ arg4>0 && 1==arg3 ], cost: 1
      3: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, [ arg4>0 && 0==arg3 ], cost: 1
      5: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 ], cost: 1
      7: f257_0_loop_GT -> f257_0_loop_GT\' : arg3'=0, arg4'=0, [ arg1>0 && 0==arg3 && 0==arg4 ], cost: 1
      9: f257_0_loop_GT -> f257_0_loop_GT\' : arg1'=0, arg3'=1, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
      2: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 && 1==arg3 ], cost: 1
      4: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg1>=arg4P_5 && arg4>0 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 && 0==arg3 ], cost: 1
      6: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 && 1==arg3 && 0==arg4 ], cost: 1
      8: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=arg4P_9, [ arg1>0 && arg1-2*arg4P_9<2 && arg1-2*arg4P_9>=0 && 0==arg3 && 0==arg4 ], cost: 1
     10: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 && 0==arg1 && 1==arg3 && 0==arg4 ], cost: 1
     15: f257_0_loop_GT\' -> f257_0_loop_GT : arg1'=0, arg2'=2*arg1, arg3'=1, arg4'=0, [ arg1>0 && arg2>=0 && arg2<2 && 1==arg3 && 0==arg4 && 2*arg1>0 ], cost: 2
     12: __init -> f1_0_main_Load : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     18: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && 1==arg3 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 ], cost: 2
     19: f257_0_loop_GT -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg4>0 && 0==arg3 && arg1>=arg4P_5 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 ], cost: 2
     20: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 ], cost: 2
     21: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg2'=2*arg1, arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=0 && arg2<2 && 2*arg1>0 ], cost: 3
     22: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg3'=1, arg4'=arg4P_9, [ arg1>0 && 0==arg3 && 0==arg4 && arg1-2*arg4P_9<2 && arg1-2*arg4P_9>=0 ], cost: 2
     23: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 ], cost: 2
     16: __init -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2P_13>2 && arg2P_1>-1 && arg1P_1>-1 && arg1P_13>0 ], cost: 2
     17: __init -> f257_0_loop_GT : arg1'=0, arg2'=arg2P_1, arg3'=1, arg4'=0, [ arg2P_13>2 && arg1P_13>0 && arg2P_1>0 ], cost: 3

Applied pruning (of leafs and parallel rules):
   Start location: __init
     18: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && 1==arg3 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 ], cost: 2
     19: f257_0_loop_GT -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg4>0 && 0==arg3 && arg1>=arg4P_5 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 ], cost: 2
     20: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 ], cost: 2
     21: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg2'=2*arg1, arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=0 && arg2<2 && 2*arg1>0 ], cost: 3
     23: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 ], cost: 2
     16: __init -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2P_13>2 && arg2P_1>-1 && arg1P_1>-1 && arg1P_13>0 ], cost: 2
     17: __init -> f257_0_loop_GT : arg1'=0, arg2'=arg2P_1, arg3'=1, arg4'=0, [ arg2P_13>2 && arg1P_13>0 && arg2P_1>0 ], cost: 3

Accelerating simple loops of location 1.
   Accelerating the following rules:
     18: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1, arg3'=0, [ arg4>0 && 1==arg3 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 ], cost: 2
     19: f257_0_loop_GT -> f257_0_loop_GT : arg1'=2*arg4, arg3'=1, arg4'=arg4P_5, [ arg4>0 && 0==arg3 && arg1>=arg4P_5 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 ], cost: 2
     20: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1, arg3'=0, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 ], cost: 2
     21: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg2'=2*arg1, arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=0 && arg2<2 && 2*arg1>0 ], cost: 3
     23: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 ], cost: 2

   Accelerated rule 18 with metering function -1+arg3, yielding the new rule 24.
   Accelerated rule 19 with metering function -arg3, yielding the new rule 25.
   Accelerated rule 20 with metering function -1+arg3, yielding the new rule 26.
   Found no metering function for rule 21.
   Accelerated rule 23 with metering function -1+arg3, yielding the new rule 27.
   Removing the simple loops: 18 19 20 23.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     21: f257_0_loop_GT -> f257_0_loop_GT : arg1'=0, arg2'=2*arg1, arg3'=1, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=0 && arg2<2 && 2*arg1>0 ], cost: 3
     24: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_3, arg2'=2*arg1P_3, arg3'=0, [ arg4>0 && 1==arg3 && arg2>=arg1P_3 && -2*arg1P_3+arg2<2 && -2*arg1P_3+arg2>=0 && -1+arg3>=1 ], cost: -2+2*arg3
     25: f257_0_loop_GT -> f257_0_loop_GT : arg1'=2*arg4P_5, arg3'=1, arg4'=arg4P_5, [ arg4>0 && 0==arg3 && arg1>=arg4P_5 && arg1-2*arg4P_5<2 && arg1-2*arg4P_5>=0 && -arg3>=1 ], cost: -2*arg3
     26: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_7, arg2'=2*arg1P_7, arg3'=0, arg4'=0, [ arg1>0 && 1==arg3 && 0==arg4 && arg2>=arg1P_7 && -2*arg1P_7+arg2<2 && -2*arg1P_7+arg2>=0 && -1+arg3>=1 ], cost: -2+2*arg3
     27: f257_0_loop_GT -> f257_0_loop_GT : arg1'=arg1P_11, arg2'=0, arg3'=0, arg4'=0, [ arg2>0 && 0==arg1 && 1==arg3 && 0==arg4 && -2*arg1P_11+arg2<2 && -2*arg1P_11+arg2>=0 && -1+arg3>=1 ], cost: -2+2*arg3
     16: __init -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2P_13>2 && arg2P_1>-1 && arg1P_1>-1 && arg1P_13>0 ], cost: 2
     17: __init -> f257_0_loop_GT : arg1'=0, arg2'=arg2P_1, arg3'=1, arg4'=0, [ arg2P_13>2 && arg1P_13>0 && arg2P_1>0 ], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     16: __init -> f257_0_loop_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=0, arg4'=arg4P_1, [ arg4P_1>-1 && arg2P_13>2 && arg2P_1>-1 && arg1P_1>-1 && arg1P_13>0 ], cost: 2
     17: __init -> f257_0_loop_GT : arg1'=0, arg2'=arg2P_1, arg3'=1, arg4'=0, [ arg2P_13>2 && arg1P_13>0 && arg2P_1>0 ], cost: 3

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)