WORST_CASE(INF,?)

### 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

      During metering: Instantiating temporary variables by {arg3P_3==arg3,arg4P_3==-1+arg6,arg6P_3==-1+arg6,arg1P_3==arg4}
   Accelerated rule 2 with metering function -arg6+2*arg4, yielding the new rule 11.
      During metering: Instantiating temporary variables by {arg5P_4==-2+arg6,arg4P_4==-1+arg4,arg6P_4==-1+arg6,arg1P_4==arg1,arg3P_4==arg3}
   Accelerated rule 3 with metering function -arg6+arg4, yielding the new rule 12.
   Accelerated rule 4 with metering function -arg2 (after strengthening guard), yielding the new rule 13.
      During metering: Instantiating temporary variables by {arg5P_4==-2+arg4,arg6P_4==-1+arg6,arg3P_4==-1+arg6P_4}
   Nested simple loops 4 (outer loop) and 11 (inner loop) with metering function 1-arg1P_5, resulting in the new rules: 14.
      During metering: Instantiating temporary variables by {arg3P_5==arg6P_5,arg4P_5==arg3P_5,arg1P_5==1+arg3P_5,arg6P_5==-1+arg1P_5}
      During metering: Instantiating temporary variables by {arg3P_5==arg6P_5,arg4P_5==arg3P_5,arg1P_5==1+arg3P_5,arg6P_5==-1+arg1P_5}
   Removing the simple loops: 2 3 4.

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 metering function arg1, yielding the new rule 15.
   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

      During metering: Instantiating temporary variables by {arg3P_9==-1+arg3,arg2P_9==-1+arg2}
   Accelerated rule 8 with metering function -arg3+2*arg2, yielding the new rule 16.
      During metering: Instantiating temporary variables by {arg2P_10==-1+arg2,arg3P_10==-1+arg3}
   Accelerated rule 9 with metering function -arg3+2*arg2, yielding the new rule 17.
   Removing the simple loops: 8 9.

Accelerated all simple loops using metering functions (where possible):
   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
     11: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=1+2*arg6-2*arg4, arg3'=arg3, arg4'=2*arg6-2*arg4, arg6'=2*arg6-2*arg4, [ arg4<=arg1 && -1+arg4<=arg3 && arg4<=arg6 && arg6<=arg4 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && -arg6+2*arg4>=1 ], cost: -arg6+2*arg4
     12: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1, arg3'=arg3, arg4'=arg6, arg5'=-1+2*arg6-arg4, arg6'=2*arg6-arg4, [ -2+arg6>arg5 && -1+arg1<=arg3 && arg1<=arg4 && arg1<=arg6 && arg4<=arg6 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && -arg6+arg4>=1 ], cost: -arg6+arg4
     13: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=0, 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 && -1+arg1P_5<=arg3P_5 && arg4P_5<=arg3P_5 && arg6P_5<=arg3P_5 && -1+arg1P_5<=arg4P_5 && 0>=1+arg2 && -1+arg1P_5<=arg6P_5 ], cost: -arg2
     14: f1489_0_max_NULL -> f1489_0_max_NULL : arg1'=arg1P_5, arg2'=1-arg1P_5+arg2, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=0, arg6'=arg6P_5, [ arg4<=arg1 && -1+arg4<=arg3 && -arg6+arg4==0 && arg1>0 && arg3>-1 && arg4>0 && arg6>0 && -arg6+2*arg4>=1 && arg5>=arg2 && arg1P_5<=1+2*arg6-2*arg4 && -1+arg1P_5<=arg3 && arg3P_5<=arg3 && arg4P_5<=arg3 && arg6P_5<=arg3 && 1+2*arg6-2*arg4>0 && arg1P_5>0 && arg3P_5>-1 && arg4P_5>-1 && arg6P_5>-1 && 1-arg1P_5>=1 ], cost: 1+(-1+arg1P_5)*arg6P_5-arg1P_5-2*arg4P_5*(-1+arg1P_5)
      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
     15: f605_0_createIntList_LE -> f605_0_createIntList_LE : arg1'=0, arg2'=arg1+arg2, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg2>0 ], cost: arg1
     16: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg3-arg2, arg3'=2*arg3-2*arg2, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2<=arg3 && arg3<=arg2 && arg2>0 && arg3>0 && -arg3+2*arg2>=1 ], cost: -arg3+2*arg2
     17: f1214_0_member_NULL -> f1214_0_member_NULL : arg2'=arg3-arg2, arg3'=2*arg3-2*arg2, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2<=arg3 && arg3<=arg2 && arg2>0 && arg3>0 && -arg3+2*arg2>=1 ], cost: -arg3+2*arg2
     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
     20: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
     21: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
      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
     18: f1_0_main_Load -> f1489_0_max_NULL : arg1'=1, arg2'=0, arg3'=arg3P_2, arg4'=0, arg5'=0, arg6'=0, [ arg1>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1 ], cost: 1+arg6P_2
     19: 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>0 ], 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
     20: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
     21: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
      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
     18: f1_0_main_Load -> f1489_0_max_NULL : arg1'=1, arg2'=0, arg3'=arg3P_2, arg4'=0, arg5'=0, arg6'=0, [ arg1>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1 ], cost: 1+arg6P_2
     19: 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>0 ], 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 tree-shaped paths):
   Start location: __init
     20: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
     21: f1489_0_max_NULL -> f1214_0_member_NULL : arg1'=arg2, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg5>=arg2 && arg3P_8<=arg3 && arg1>0 && arg3>-1 && arg4>-1 && arg6>-1 && arg3P_8>0 ], cost: 1+arg3P_8
     22: __init -> f1489_0_max_NULL : arg1'=arg1P_2, arg2'=0, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=0, arg6'=arg6P_2, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 ], cost: 2
     23: __init -> f1489_0_max_NULL : arg1'=1, arg2'=0, arg3'=arg3P_2, arg4'=0, arg5'=0, arg6'=0, [ arg1P_11>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1P_11 ], cost: 2+arg6P_2
     24: __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>0 ], cost: 2+arg1P_6

Eliminated locations (on tree-shaped paths):
   Start location: __init
     24: __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>0 ], cost: 2+arg1P_6
     25: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg3P_8
     26: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg3P_8
     27: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg1P_11>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1P_11 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg6P_2+arg3P_8
     28: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_11>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1P_11 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg6P_2+arg3P_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     24: __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>0 ], cost: 2+arg1P_6
     26: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_2<=arg1P_11 && arg1P_11>0 && arg1P_2>0 && arg3P_2>-1 && arg4P_2>-1 && arg6P_2>-1 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg3P_8
     28: __init -> f1214_0_member_NULL : arg1'=0, arg2'=0, arg3'=0, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_11>0 && arg3P_2>-1 && -1+arg6P_2<=arg3P_2 && arg6P_2>0 && arg6P_2<=arg1P_11 && arg3P_8<=arg3P_2 && arg3P_8>0 ], cost: 3+arg6P_2+arg3P_8

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

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

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

   Solution:
      arg2P_11 / n
      arg1P_11 / n
      arg1P_6 / 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_6
   Rule guard:  [ arg2P_11>-1 && arg1P_11>0 && arg1P_6>0 ]

WORST_CASE(INF,?)