WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1==arg1P_1 && arg2==arg2P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg2==arg2P_2 && arg3==arg3P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2==arg2P_3 && arg3==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f4 -> f5 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg3==arg3P_4 && arg4==arg4P_4 ], cost: 1
     24: f5 -> f6 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 && arg4==arg4P_25 ], cost: 1
     26: f5 -> f21 : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg2>arg3 && arg1==arg1P_27 && arg2==arg2P_27 && arg3==arg3P_27 && arg4==arg4P_27 ], cost: 1
     27: f5 -> f21 : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ arg1<0 && arg1==arg1P_28 && arg2==arg2P_28 && arg3==arg3P_28 && arg4==arg4P_28 ], cost: 1
     28: f5 -> f21 : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [ 0>arg2 && arg1==arg1P_29 && arg2==arg2P_29 && arg3==arg3P_29 && arg4==arg4P_29 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5==1+arg2 && arg1==arg1P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
      6: f10 -> f11 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ x28_1<0 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
      7: f10 -> f11 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x104_1>0 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f10 -> f12 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ x33_1==0 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      5: f11 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 && 1==arg4P_6 ], cost: 1
      9: f14 -> f13 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f12 -> f13 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     22: f13 -> f9 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1==arg1P_23 && arg2==arg2P_23 && arg3==arg3P_23 && arg4==arg4P_23 ], cost: 1
     11: f8 -> f15 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2P_12==-1+arg2 && arg1==arg1P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     14: f15 -> f16 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ x58_1<0 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f15 -> f16 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ x119_1>0 && arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     16: f15 -> f17 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x63_1==0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     12: f16 -> f19 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_13==-1+arg1 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     13: f19 -> f20 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && 0==arg4P_14 ], cost: 1
     17: f20 -> f18 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
     18: f17 -> f18 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     23: f18 -> f9 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 && arg4==arg4P_24 ], cost: 1
     19: f6 -> f7 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg4==0 && arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 && arg4==arg4P_20 ], cost: 1
     20: f6 -> f8 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg4<0 && arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 && arg4==arg4P_21 ], cost: 1
     21: f6 -> f8 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg4>0 && arg1==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 && arg4==arg4P_22 ], cost: 1
     25: f9 -> f5 : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1==arg1P_26 && arg2==arg2P_26 && arg3==arg3P_26 && arg4==arg4P_26 ], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, arg4'=arg4P_30, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     29: __init -> f1 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, arg4'=arg4P_30, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1==arg1P_1 && arg2==arg2P_1 && arg4==arg4P_1 ], cost: 1
      1: f2 -> f3 : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1==arg1P_2 && arg2==arg2P_2 && arg3==arg3P_2 ], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg2==arg2P_3 && arg3==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: f4 -> f5 : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1==arg1P_4 && arg3==arg3P_4 && arg4==arg4P_4 ], cost: 1
     24: f5 -> f6 : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg1==arg1P_25 && arg2==arg2P_25 && arg3==arg3P_25 && arg4==arg4P_25 ], cost: 1
      4: f7 -> f10 : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5==1+arg2 && arg1==arg1P_5 && arg3==arg3P_5 && arg4==arg4P_5 ], cost: 1
      6: f10 -> f11 : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ x28_1<0 && arg1==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 && arg4==arg4P_7 ], cost: 1
      7: f10 -> f11 : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x104_1>0 && arg1==arg1P_8 && arg2==arg2P_8 && arg3==arg3P_8 && arg4==arg4P_8 ], cost: 1
      8: f10 -> f12 : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ x33_1==0 && arg1==arg1P_9 && arg2==arg2P_9 && arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      5: f11 -> f14 : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 && 1==arg4P_6 ], cost: 1
      9: f14 -> f13 : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1==arg1P_10 && arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f12 -> f13 : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1==arg1P_11 && arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     22: f13 -> f9 : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1==arg1P_23 && arg2==arg2P_23 && arg3==arg3P_23 && arg4==arg4P_23 ], cost: 1
     11: f8 -> f15 : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2P_12==-1+arg2 && arg1==arg1P_12 && arg3==arg3P_12 && arg4==arg4P_12 ], cost: 1
     14: f15 -> f16 : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ x58_1<0 && arg1==arg1P_15 && arg2==arg2P_15 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: f15 -> f16 : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ x119_1>0 && arg1==arg1P_16 && arg2==arg2P_16 && arg3==arg3P_16 && arg4==arg4P_16 ], cost: 1
     16: f15 -> f17 : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x63_1==0 && arg1==arg1P_17 && arg2==arg2P_17 && arg3==arg3P_17 && arg4==arg4P_17 ], cost: 1
     12: f16 -> f19 : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_13==-1+arg1 && arg2==arg2P_13 && arg3==arg3P_13 && arg4==arg4P_13 ], cost: 1
     13: f19 -> f20 : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1==arg1P_14 && arg2==arg2P_14 && arg3==arg3P_14 && 0==arg4P_14 ], cost: 1
     17: f20 -> f18 : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1==arg1P_18 && arg2==arg2P_18 && arg3==arg3P_18 && arg4==arg4P_18 ], cost: 1
     18: f17 -> f18 : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1==arg1P_19 && arg2==arg2P_19 && arg3==arg3P_19 && arg4==arg4P_19 ], cost: 1
     23: f18 -> f9 : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1==arg1P_24 && arg2==arg2P_24 && arg3==arg3P_24 && arg4==arg4P_24 ], cost: 1
     19: f6 -> f7 : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg4==0 && arg1==arg1P_20 && arg2==arg2P_20 && arg3==arg3P_20 && arg4==arg4P_20 ], cost: 1
     20: f6 -> f8 : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg4<0 && arg1==arg1P_21 && arg2==arg2P_21 && arg3==arg3P_21 && arg4==arg4P_21 ], cost: 1
     21: f6 -> f8 : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg4>0 && arg1==arg1P_22 && arg2==arg2P_22 && arg3==arg3P_22 && arg4==arg4P_22 ], cost: 1
     25: f9 -> f5 : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1==arg1P_26 && arg2==arg2P_26 && arg3==arg3P_26 && arg4==arg4P_26 ], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, arg4'=arg4P_30, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg3'=arg3P_1, [], cost: 1
      1: f2 -> f3 : arg4'=arg4P_2, [], cost: 1
      2: f3 -> f4 : arg1'=arg1P_3, [], cost: 1
      3: f4 -> f5 : arg2'=arg2P_4, [], cost: 1
     24: f5 -> f6 : [ arg1>=0 && 0<=arg2 && arg2<=arg3 ], cost: 1
      4: f7 -> f10 : arg2'=1+arg2, [], cost: 1
      7: f10 -> f11 : [], cost: 1
      8: f10 -> f12 : [], cost: 1
      5: f11 -> f14 : arg4'=1, [], cost: 1
      9: f14 -> f13 : [], cost: 1
     10: f12 -> f13 : [], cost: 1
     22: f13 -> f9 : [], cost: 1
     11: f8 -> f15 : arg2'=-1+arg2, [], cost: 1
     15: f15 -> f16 : [], cost: 1
     16: f15 -> f17 : [], cost: 1
     12: f16 -> f19 : arg1'=-1+arg1, [], cost: 1
     13: f19 -> f20 : arg4'=0, [], cost: 1
     17: f20 -> f18 : [], cost: 1
     18: f17 -> f18 : [], cost: 1
     23: f18 -> f9 : [], cost: 1
     19: f6 -> f7 : [ arg4==0 ], cost: 1
     20: f6 -> f8 : [ arg4<0 ], cost: 1
     21: f6 -> f8 : [ arg4>0 ], cost: 1
     25: f9 -> f5 : [], cost: 1
     29: __init -> f1 : arg1'=arg1P_30, arg2'=arg2P_30, arg3'=arg3P_30, arg4'=arg4P_30, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
     24: f5 -> f6 : [ arg1>=0 && 0<=arg2 && arg2<=arg3 ], cost: 1
     36: f10 -> f13 : [], cost: 2
     37: f10 -> f13 : arg4'=1, [], cost: 3
     22: f13 -> f9 : [], cost: 1
     11: f8 -> f15 : arg2'=-1+arg2, [], cost: 1
     39: f15 -> f18 : [], cost: 2
     41: f15 -> f18 : arg1'=-1+arg1, arg4'=0, [], cost: 4
     23: f18 -> f9 : [], cost: 1
     20: f6 -> f8 : [ arg4<0 ], cost: 1
     21: f6 -> f8 : [ arg4>0 ], cost: 1
     34: f6 -> f10 : arg2'=1+arg2, [ arg4==0 ], cost: 2
     25: f9 -> f5 : [], cost: 1
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     42: f5 -> f8 : [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 2
     43: f5 -> f8 : [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 2
     44: f5 -> f10 : arg2'=1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 3
     45: f10 -> f9 : [], cost: 3
     46: f10 -> f9 : arg4'=1, [], cost: 4
     47: f8 -> f18 : arg2'=-1+arg2, [], cost: 3
     48: f8 -> f18 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [], cost: 5
     23: f18 -> f9 : [], cost: 1
     25: f9 -> f5 : [], cost: 1
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     49: f5 -> f9 : arg2'=1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 6
     50: f5 -> f9 : arg2'=1+arg2, arg4'=1, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 7
     51: f5 -> f18 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 5
     52: f5 -> f18 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 7
     53: f5 -> f18 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 5
     54: f5 -> f18 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 7
     23: f18 -> f9 : [], cost: 1
     25: f9 -> f5 : [], cost: 1
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     59: f5 -> f5 : arg2'=1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 7
     60: f5 -> f5 : arg2'=1+arg2, arg4'=1, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 8
     61: f5 -> f5 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 7
     62: f5 -> f5 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 9
     63: f5 -> f5 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 7
     64: f5 -> f5 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 9
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5

Accelerating simple loops of location 4.
   Accelerating the following rules:
     59: f5 -> f5 : arg2'=1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 7
     60: f5 -> f5 : arg2'=1+arg2, arg4'=1, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4==0 ], cost: 8
     61: f5 -> f5 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 7
     62: f5 -> f5 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 9
     63: f5 -> f5 : arg2'=-1+arg2, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 7
     64: f5 -> f5 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4>0 ], cost: 9

   Accelerated rule 59 with backward acceleration, yielding the new rule 65.
   Failed to prove monotonicity of the guard of rule 60.
   Accelerated rule 61 with backward acceleration, yielding the new rule 66.
   Failed to prove monotonicity of the guard of rule 62.
   Accelerated rule 63 with backward acceleration, yielding the new rule 67.
   Failed to prove monotonicity of the guard of rule 64.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 64 (outer loop) and 60 (inner loop) with Rule(4 | 0<=arg2, arg4==0, 1+arg2<=arg3, 1+arg1>=1, 0>=0, | 17+17*arg1 || 4 | 0=-1, 3=0, ), resulting in the new rules: 68, 69.
   Nested simple loops 60 (outer loop) and 64 (inner loop) with Rule(4 | arg2<=arg3, arg4>0, 0<=-1+arg2, arg1>=1, 0>=0, | 17*arg1 || 4 | 0=0, 3=1, ), resulting in the new rules: 70, 71.
   Removing the simple loops: 59 60 61 63 64.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     62: f5 -> f5 : arg1'=-1+arg1, arg2'=-1+arg2, arg4'=0, [ arg1>=0 && 0<=arg2 && arg2<=arg3 && arg4<0 ], cost: 9
     65: f5 -> f5 : arg2'=1+arg3, [ arg1>=0 && 0<=arg2 && arg4==0 && 1-arg2+arg3>=0 ], cost: 7-7*arg2+7*arg3
     66: f5 -> f5 : arg2'=-1, [ arg1>=0 && arg2<=arg3 && arg4<0 && 1+arg2>=0 ], cost: 7+7*arg2
     67: f5 -> f5 : arg2'=-1, [ arg1>=0 && arg2<=arg3 && arg4>0 && 1+arg2>=0 ], cost: 7+7*arg2
     68: f5 -> f5 : arg1'=-1, arg4'=0, [ 0<=arg2 && arg4==0 && 1+arg2<=arg3 && 1+arg1>=1 ], cost: 17+17*arg1
     69: f5 -> f5 : arg1'=-1, arg2'=-1+arg2, arg4'=0, [ arg2<=arg3 && arg4>0 && 0<=-1+arg2 && arg1>=1 ], cost: 9+17*arg1
     70: f5 -> f5 : arg1'=0, arg4'=1, [ arg2<=arg3 && arg4>0 && 0<=-1+arg2 && arg1>=1 ], cost: 17*arg1
     71: f5 -> f5 : arg1'=0, arg2'=1+arg2, arg4'=1, [ 0<=arg2 && arg4==0 && 1+arg2<=arg3 && arg1>=1 ], cost: 8+17*arg1
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5

Chained accelerated rules (with incoming rules):
   Start location: __init
     33: __init -> f5 : arg1'=arg1P_3, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=arg4P_2, [], cost: 5
     72: __init -> f5 : arg1'=-1+arg1P_3, arg2'=-1+arg2P_4, arg3'=arg3P_1, arg4'=0, [ arg1P_3>=0 && 0<=arg2P_4 && arg2P_4<=arg3P_1 ], cost: 14
     73: __init -> f5 : arg1'=arg1P_3, arg2'=1+arg3P_1, arg3'=arg3P_1, arg4'=0, [ arg1P_3>=0 && 0<=arg2P_4 && 1+arg3P_1-arg2P_4>=0 ], cost: 12+7*arg3P_1-7*arg2P_4
     74: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2<0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     75: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2>0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     76: __init -> f5 : arg1'=-1, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=0, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && 1+arg1P_3>=1 ], cost: 22+17*arg1P_3
     77: __init -> f5 : arg1'=-1, arg2'=-1+arg2P_4, arg3'=arg3P_1, arg4'=0, [ arg2P_4<=arg3P_1 && 0<=-1+arg2P_4 && arg1P_3>=1 ], cost: 14+17*arg1P_3
     78: __init -> f5 : arg1'=0, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=1, [ arg2P_4<=arg3P_1 && 0<=-1+arg2P_4 && arg1P_3>=1 ], cost: 5+17*arg1P_3
     79: __init -> f5 : arg1'=0, arg2'=1+arg2P_4, arg3'=arg3P_1, arg4'=1, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && arg1P_3>=1 ], cost: 13+17*arg1P_3

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     73: __init -> f5 : arg1'=arg1P_3, arg2'=1+arg3P_1, arg3'=arg3P_1, arg4'=0, [ arg1P_3>=0 && 0<=arg2P_4 && 1+arg3P_1-arg2P_4>=0 ], cost: 12+7*arg3P_1-7*arg2P_4
     74: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2<0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     75: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2>0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     76: __init -> f5 : arg1'=-1, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=0, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && 1+arg1P_3>=1 ], cost: 22+17*arg1P_3
     77: __init -> f5 : arg1'=-1, arg2'=-1+arg2P_4, arg3'=arg3P_1, arg4'=0, [ arg2P_4<=arg3P_1 && 0<=-1+arg2P_4 && arg1P_3>=1 ], cost: 14+17*arg1P_3
     78: __init -> f5 : arg1'=0, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=1, [ arg2P_4<=arg3P_1 && 0<=-1+arg2P_4 && arg1P_3>=1 ], cost: 5+17*arg1P_3
     79: __init -> f5 : arg1'=0, arg2'=1+arg2P_4, arg3'=arg3P_1, arg4'=1, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && arg1P_3>=1 ], cost: 13+17*arg1P_3

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     73: __init -> f5 : arg1'=arg1P_3, arg2'=1+arg3P_1, arg3'=arg3P_1, arg4'=0, [ arg1P_3>=0 && 0<=arg2P_4 && 1+arg3P_1-arg2P_4>=0 ], cost: 12+7*arg3P_1-7*arg2P_4
     74: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2<0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     75: __init -> f5 : arg1'=arg1P_3, arg2'=-1, arg3'=arg3P_1, arg4'=arg4P_2, [ arg1P_3>=0 && arg2P_4<=arg3P_1 && arg4P_2>0 && 1+arg2P_4>=0 ], cost: 12+7*arg2P_4
     76: __init -> f5 : arg1'=-1, arg2'=arg2P_4, arg3'=arg3P_1, arg4'=0, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && 1+arg1P_3>=1 ], cost: 22+17*arg1P_3
     77: __init -> f5 : arg1'=-1, arg2'=-1+arg2P_4, arg3'=arg3P_1, arg4'=0, [ arg2P_4<=arg3P_1 && 0<=-1+arg2P_4 && arg1P_3>=1 ], cost: 14+17*arg1P_3
     79: __init -> f5 : arg1'=0, arg2'=1+arg2P_4, arg3'=arg3P_1, arg4'=1, [ 0<=arg2P_4 && 1+arg2P_4<=arg3P_1 && arg1P_3>=1 ], cost: 13+17*arg1P_3

Computing asymptotic complexity for rule 73
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 76
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 77
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 79
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 74
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 75
   Resulting cost 0 has complexity: Unknown

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),?)