WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f252_0_createIntList_Return -> f1489_0_max_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1<=arg1 && -1+arg1P_1<=arg2 && arg3P_1<=arg2 && arg4P_1<=arg2 && arg6P_1<=arg2 && arg1>0 && arg2>-1 && arg1P_1>0 && arg3P_1>-1 && arg4P_1>-1 && arg6P_1>-1 && 0==arg2P_1 && 0==arg5P_1 ], cost: 1
      2: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && x24_1<=arg5 && -1+arg1P_3<=arg3 && arg1P_3<=arg4 && arg1P_3<=arg6 && arg3P_3<=arg3 && 1+arg4P_3<=arg4 && 1+arg4P_3<=arg6 && 1+arg6P_3<=arg4 && 1+arg6P_3<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 && arg2==arg2P_3 && arg5==arg5P_3 ], cost: 1
      3: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && arg5P_4>arg5 && -1+arg1P_4<=arg3 && arg1P_4<=arg4 && arg1P_4<=arg6 && arg3P_4<=arg3 && 1+arg4P_4<=arg4 && 1+arg4P_4<=arg6 && 1+arg6P_4<=arg4 && 1+arg6P_4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && 2+arg5P_4<=arg4 && 2+arg5P_4<=arg6 && arg2==arg2P_4 ], cost: 1
      4: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg5>=arg2 && x37_1>0 && x48_1>0 && arg1P_5<=arg1 && -1+arg1P_5<=arg3 && -1+arg1P_5<=arg4 && -1+arg1P_5<=arg6 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 && 1+arg2==arg2P_5 && 0==arg5P_5 ], cost: 1
      7: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>=arg2 && x54_1>0 && x63_1>0 && arg2P_8<=arg3 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg2P_8>-1 && arg3P_8>-1 && arg2==arg1P_8 ], cost: 1
      1: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 && 0==arg2P_2 && 0==arg5P_2 ], cost: 1
      5: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1P_6>-1 && arg1>0 && 1==arg2P_6 ], cost: 1
      6: f605_0_createIntList_LE -> f605_0_createIntList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg2>0 && -1+arg1==arg1P_7 && 1+arg2==arg2P_7 ], cost: 1
      8: f1214_0_member_NULL -> f1214_0_member_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_9<=arg2 && x70_1<arg1 && 1+arg2P_9<=arg3 && 1+arg3P_9<=arg2 && 1+arg3P_9<=arg3 && arg2>0 && arg3>0 && arg2P_9>-1 && arg3P_9>-1 && arg1==arg1P_9 ], cost: 1
      9: f1214_0_member_NULL -> f1214_0_member_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg2 && x72_1>arg1 && 1+arg2P_10<=arg3 && 1+arg3P_10<=arg2 && 1+arg3P_10<=arg3 && arg2>0 && arg3>0 && arg2P_10>-1 && arg3P_10>-1 && arg1==arg1P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      2: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && x24_1<=arg5 && -1+arg1P_3<=arg3 && arg1P_3<=arg4 && arg1P_3<=arg6 && arg3P_3<=arg3 && 1+arg4P_3<=arg4 && 1+arg4P_3<=arg6 && 1+arg6P_3<=arg4 && 1+arg6P_3<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 && arg2==arg2P_3 && arg5==arg5P_3 ], cost: 1
      3: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && arg5P_4>arg5 && -1+arg1P_4<=arg3 && arg1P_4<=arg4 && arg1P_4<=arg6 && arg3P_4<=arg3 && 1+arg4P_4<=arg4 && 1+arg4P_4<=arg6 && 1+arg6P_4<=arg4 && 1+arg6P_4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && 2+arg5P_4<=arg4 && 2+arg5P_4<=arg6 && arg2==arg2P_4 ], cost: 1
      4: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg5>=arg2 && x37_1>0 && x48_1>0 && arg1P_5<=arg1 && -1+arg1P_5<=arg3 && -1+arg1P_5<=arg4 && -1+arg1P_5<=arg6 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 && 1+arg2==arg2P_5 && 0==arg5P_5 ], cost: 1
      7: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>=arg2 && x54_1>0 && x63_1>0 && arg2P_8<=arg3 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg2P_8>-1 && arg3P_8>-1 && arg2==arg1P_8 ], cost: 1
      1: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 && 0==arg2P_2 && 0==arg5P_2 ], cost: 1
      5: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1P_6>-1 && arg1>0 && 1==arg2P_6 ], cost: 1
      6: f605_0_createIntList_LE -> f605_0_createIntList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg2>0 && -1+arg1==arg1P_7 && 1+arg2==arg2P_7 ], cost: 1
      8: f1214_0_member_NULL -> f1214_0_member_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_9<=arg2 && x70_1<arg1 && 1+arg2P_9<=arg3 && 1+arg3P_9<=arg2 && 1+arg3P_9<=arg3 && arg2>0 && arg3>0 && arg2P_9>-1 && arg3P_9>-1 && arg1==arg1P_9 ], cost: 1
      9: f1214_0_member_NULL -> f1214_0_member_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg2 && x72_1>arg1 && 1+arg2P_10<=arg3 && 1+arg3P_10<=arg2 && 1+arg3P_10<=arg3 && arg2>0 && arg3>0 && arg2P_10>-1 && arg3P_10>-1 && arg1==arg1P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      2: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && -1+arg1P_3<=arg3 && arg1P_3<=arg4 && arg1P_3<=arg6 && arg3P_3<=arg3 && 1+arg4P_3<=arg4 && 1+arg4P_3<=arg6 && 1+arg6P_3<=arg4 && 1+arg6P_3<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 ], cost: 1
      3: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && arg5P_4>arg5 && -1+arg1P_4<=arg3 && arg1P_4<=arg4 && arg1P_4<=arg6 && arg3P_4<=arg3 && 1+arg4P_4<=arg4 && 1+arg4P_4<=arg6 && 1+arg6P_4<=arg4 && 1+arg6P_4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && 2+arg5P_4<=arg4 && 2+arg5P_4<=arg6 ], cost: 1
      4: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=1+arg2, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=0, arg6'=arg6P_5, [ arg5>=arg2 && arg1P_5<=arg1 && -1+arg1P_5<=arg3 && -1+arg1P_5<=arg4 && -1+arg1P_5<=arg6 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 ], cost: 1
      7: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>=arg2 && arg2P_8<=arg3 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg2P_8>-1 && arg3P_8>-1 ], cost: 1
      1: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=0, arg6'=arg6P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=arg1P_6, arg2'=1, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1P_6>-1 && arg1>0 ], cost: 1
      6: f605_0_createIntList_LE -> f605_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg2>0 ], cost: 1
      8: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_9<=arg2 && 1+arg2P_9<=arg3 && 1+arg3P_9<=arg2 && 1+arg3P_9<=arg3 && arg2>0 && arg3>0 && arg2P_9>-1 && arg3P_9>-1 ], cost: 1
      9: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg2 && 1+arg2P_10<=arg3 && 1+arg3P_10<=arg2 && 1+arg3P_10<=arg3 && arg2>0 && arg3>0 && arg2P_10>-1 && arg3P_10>-1 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && -1+arg1P_3<=arg3 && arg1P_3<=arg4 && arg1P_3<=arg6 && arg3P_3<=arg3 && 1+arg4P_3<=arg4 && 1+arg4P_3<=arg6 && 1+arg6P_3<=arg4 && 1+arg6P_3<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 ], cost: 1
      3: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && arg5P_4>arg5 && -1+arg1P_4<=arg3 && arg1P_4<=arg4 && arg1P_4<=arg6 && arg3P_4<=arg3 && 1+arg4P_4<=arg4 && 1+arg4P_4<=arg6 && 1+arg6P_4<=arg4 && 1+arg6P_4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && 2+arg5P_4<=arg4 && 2+arg5P_4<=arg6 ], cost: 1
      4: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=1+arg2, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=0, arg6'=arg6P_5, [ arg5>=arg2 && arg1P_5<=arg1 && -1+arg1P_5<=arg3 && -1+arg1P_5<=arg4 && -1+arg1P_5<=arg6 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 2.
   Failed to prove monotonicity of the guard of rule 3.
   Failed to prove monotonicity of the guard of rule 4.
[accelerate] Nesting with 3 inner and 3 outer candidates

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

   Accelerated rule 6 with backward acceleration, yielding the new rule 11.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 6.

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

   Failed to prove monotonicity of the guard of rule 8.
   Failed to prove monotonicity of the guard of rule 9.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      2: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && -1+arg1P_3<=arg3 && arg1P_3<=arg4 && arg1P_3<=arg6 && arg3P_3<=arg3 && 1+arg4P_3<=arg4 && 1+arg4P_3<=arg6 && 1+arg6P_3<=arg4 && 1+arg6P_3<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 ], cost: 1
      3: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && arg5P_4>arg5 && -1+arg1P_4<=arg3 && arg1P_4<=arg4 && arg1P_4<=arg6 && arg3P_4<=arg3 && 1+arg4P_4<=arg4 && 1+arg4P_4<=arg6 && 1+arg6P_4<=arg4 && 1+arg6P_4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && 2+arg5P_4<=arg4 && 2+arg5P_4<=arg6 ], cost: 1
      4: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=1+arg2, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=0, arg6'=arg6P_5, [ arg5>=arg2 && arg1P_5<=arg1 && -1+arg1P_5<=arg3 && -1+arg1P_5<=arg4 && -1+arg1P_5<=arg6 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 ], cost: 1
      7: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>=arg2 && arg2P_8<=arg3 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg2P_8>-1 && arg3P_8>-1 ], cost: 1
      1: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=0, arg6'=arg6P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=arg1P_6, arg2'=1, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1P_6>-1 && arg1>0 ], cost: 1
     11: f605_0_createIntList_LE -> f605_0_createIntList_LE : arg1'=0, arg2'=arg2+arg1, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg2>0 && arg1>=1 ], cost: arg1
      8: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_9<=arg2 && 1+arg2P_9<=arg3 && 1+arg3P_9<=arg2 && 1+arg3P_9<=arg3 && arg2>0 && arg3>0 && arg2P_9>-1 && arg3P_9>-1 ], cost: 1
      9: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg2 && 1+arg2P_10<=arg3 && 1+arg3P_10<=arg2 && 1+arg3P_10<=arg3 && arg2>0 && arg3>0 && arg2P_10>-1 && arg3P_10>-1 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      7: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg5>=arg2 && arg2P_8<=arg3 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg2P_8>-1 && arg3P_8>-1 ], cost: 1
     16: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg5>=arg2 && arg1>0 && arg4>-1 && arg6>-1 && arg2P_9>-1 && arg3P_9>-1 && 1+arg2P_9<=arg3 && 1+arg3P_9<=arg3 && 1<=arg3 ], cost: 2
     17: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg5>=arg2 && arg1>0 && arg4>-1 && arg6>-1 && arg2P_10>-1 && arg3P_10>-1 && 1+arg2P_10<=arg3 && 1+arg3P_10<=arg3 && 1<=arg3 ], cost: 2
      1: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=0, arg6'=arg6P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=arg1P_6, arg2'=1, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1P_6>-1 && arg1>0 ], cost: 1
     12: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_3, arg2'=0, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=0, arg6'=arg6P_3, [ arg1>0 && arg1P_3>0 && arg3P_3>-1 && arg4P_3>-1 && arg6P_3>-1 && arg1P_3<=arg1 ], cost: 2
     13: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_4, arg2'=0, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1>0 && arg5P_4>0 && arg1P_4>0 && arg3P_4>-1 && arg4P_4>-1 && arg6P_4>-1 && arg1P_4<=arg1 ], cost: 2
     14: f1_0_main_Load -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=1, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=0, arg6'=arg6P_5, [ arg1>0 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 && arg1P_5<=arg1 ], cost: 2
     15: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_6, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg2>-1 && arg1>0 && arg1P_6>=1 ], cost: 1+arg1P_6
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     15: f1_0_main_Load -> f605_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_6, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg2>-1 && arg1>0 && arg1P_6>=1 ], cost: 1+arg1P_6
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     18: __init -> f605_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_6, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg2P_11>-1 && arg1P_11>0 && arg1P_6>=1 ], cost: 2+arg1P_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     18: __init -> f605_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_6, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg2P_11>-1 && arg1P_11>0 && arg1P_6>=1 ], cost: 2+arg1P_6

Computing asymptotic complexity for rule 18
   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),?)