WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg1P_1>-1 ], cost: 1
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
     14: f1_0_main_Load -> f973_0_random_ArrayAccess : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1P_15<=arg1 && arg2>-1 && arg2P_15<=arg1 && arg1>0 && arg1P_15>0 && arg2P_15>0 && 0==arg3P_15 ], cost: 1
      2: f1317_0_mirror_NULL -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 1+arg1P_3<=arg1 && arg1>0 && arg1P_3>-1 ], cost: 1
      1: f322_0_createTree_Return -> f1317_0_mirror_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>-1 && arg1P_2>-1 ], cost: 1
      3: f477_0_createNode_Return -> f731_0_random_ArrayAccess : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4>0 ], cost: 1
      8: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ x27_1>0 && arg2P_9>-1 && -1+arg1P_9<=arg1 && arg1>0 && arg1P_9>1 && 1+x27_1==arg4P_9 ], cost: 1
      5: f512_0_createNode_Return -> f750_0_random_ArrayAccess : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_6>0 ], cost: 1
      7: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x22_1>0 && arg2P_8>-1 && -3+arg1P_8<=arg1 && arg1>0 && arg1P_8>3 && 1+x22_1==arg4P_8 ], cost: 1
      9: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg2>0 && arg1>1 && arg1P_10>-1 && -1+arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>0 && arg4>0 && x42_1>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 && -1+arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     11: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>0 && arg4>0 && x49_1>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 && -1+arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     12: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && arg4>0 && x56_1>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 && -1+arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
     13: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>0 && arg4>0 && x63_1>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 && -1+arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     15: f1551_0_createTree_LE -> f973_0_random_ArrayAccess : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg2>0 && arg4>0 && arg3>-1 && 2+arg2P_16<=arg1 && arg1>2 && arg2P_16>0 && arg4==arg3P_16 ], cost: 1
     16: f1551_0_createTree_LE -> f973_0_random_ArrayAccess : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && arg4>0 && arg3P_17>0 && arg3>-1 && 2+arg2P_17<=arg1 && arg1>2 && arg2P_17>0 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg1P_1>-1 ], cost: 1
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
      2: f1317_0_mirror_NULL -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 1+arg1P_3<=arg1 && arg1>0 && arg1P_3>-1 ], cost: 1
      8: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ x27_1>0 && arg2P_9>-1 && -1+arg1P_9<=arg1 && arg1>0 && arg1P_9>1 && 1+x27_1==arg4P_9 ], cost: 1
      7: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x22_1>0 && arg2P_8>-1 && -3+arg1P_8<=arg1 && arg1>0 && arg1P_8>3 && 1+x22_1==arg4P_8 ], cost: 1
      9: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg2>0 && arg1>1 && arg1P_10>-1 && -1+arg2==arg2P_10 && arg3==arg3P_10 && arg4==arg4P_10 ], cost: 1
     10: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg2>0 && arg4>0 && x42_1>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 && -1+arg2==arg2P_11 && arg3==arg3P_11 ], cost: 1
     11: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>0 && arg4>0 && x49_1>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 && -1+arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     12: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && arg4>0 && x56_1>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 && -1+arg2==arg2P_13 && arg3==arg3P_13 ], cost: 1
     13: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg2>0 && arg4>0 && x63_1>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 && -1+arg2==arg2P_14 && arg3==arg3P_14 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg1P_1>-1 ], cost: 1
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
      2: f1317_0_mirror_NULL -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 1+arg1P_3<=arg1 && arg1>0 && arg1P_3>-1 ], cost: 1
      8: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=1+x27_1, [ x27_1>0 && arg2P_9>-1 && -1+arg1P_9<=arg1 && arg1>0 && arg1P_9>1 ], cost: 1
      7: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+x22_1, [ x22_1>0 && arg2P_8>-1 && -3+arg1P_8<=arg1 && arg1>0 && arg1P_8>3 ], cost: 1
      9: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=-1+arg2, [ 2+arg1P_10<=arg1 && arg2>0 && arg1>1 && arg1P_10>-1 ], cost: 1
     10: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=-1+arg2, arg4'=arg4P_11, [ arg2>0 && arg4>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 ], cost: 1
     11: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=-1+arg2, arg4'=arg4P_12, [ arg2>0 && arg4>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 ], cost: 1
     12: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=-1+arg2, arg4'=arg4P_13, [ arg2>0 && arg4>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 ], cost: 1
     13: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=-1+arg2, arg4'=arg4P_14, [ arg2>0 && arg4>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f1317_0_mirror_NULL -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 1+arg1P_3<=arg1 && arg1>0 && arg1P_3>-1 ], cost: 1

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

Accelerating simple loops of location 7.
   Accelerating the following rules:
      9: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=-1+arg2, [ 2+arg1P_10<=arg1 && arg2>0 && arg1>1 && arg1P_10>-1 ], cost: 1
     10: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=-1+arg2, arg4'=arg4P_11, [ arg2>0 && arg4>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 ], cost: 1
     11: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=-1+arg2, arg4'=arg4P_12, [ arg2>0 && arg4>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 ], cost: 1
     12: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=-1+arg2, arg4'=arg4P_13, [ arg2>0 && arg4>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 ], cost: 1
     13: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=-1+arg2, arg4'=arg4P_14, [ arg2>0 && arg4>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 ], cost: 1

   Failed to prove monotonicity of the guard of rule 9.
[test] deduced pseudo-invariant -arg4P_11+arg4<=0, also trying arg4P_11-arg4<=-1
   Accelerated rule 10 with backward acceleration, yielding the new rule 18.
[test] deduced pseudo-invariant -arg4P_12+arg4<=0, also trying arg4P_12-arg4<=-1
   Accelerated rule 11 with backward acceleration, yielding the new rule 19.
[test] deduced pseudo-invariant -arg4P_13+arg4<=0, also trying arg4P_13-arg4<=-1
   Accelerated rule 12 with backward acceleration, yielding the new rule 20.
[test] deduced pseudo-invariant -arg4P_14+arg4<=0, also trying arg4P_14-arg4<=-1
   Accelerated rule 13 with backward acceleration, yielding the new rule 21.
[accelerate] Nesting with 5 inner and 5 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg1P_1>-1 ], cost: 1
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
      2: f1317_0_mirror_NULL -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 1+arg1P_3<=arg1 && arg1>0 && arg1P_3>-1 ], cost: 1
      8: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=1+x27_1, [ x27_1>0 && arg2P_9>-1 && -1+arg1P_9<=arg1 && arg1>0 && arg1P_9>1 ], cost: 1
      7: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+x22_1, [ x22_1>0 && arg2P_8>-1 && -3+arg1P_8<=arg1 && arg1>0 && arg1P_8>3 ], cost: 1
      9: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=-1+arg2, [ 2+arg1P_10<=arg1 && arg2>0 && arg1>1 && arg1P_10>-1 ], cost: 1
     10: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=-1+arg2, arg4'=arg4P_11, [ arg2>0 && arg4>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 ], cost: 1
     11: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=-1+arg2, arg4'=arg4P_12, [ arg2>0 && arg4>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 ], cost: 1
     12: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=-1+arg2, arg4'=arg4P_13, [ arg2>0 && arg4>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 ], cost: 1
     13: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=-1+arg2, arg4'=arg4P_14, [ arg2>0 && arg4>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 ], cost: 1
     18: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg4'=arg4P_11, [ arg4>0 && -2+arg1P_11<=arg1 && arg1>2 && arg1P_11>3 && -arg4P_11+arg4<=0 && arg2>=1 ], cost: arg2
     19: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg4'=arg4P_12, [ arg4>0 && -2+arg1P_12<=arg1 && arg1>2 && arg1P_12>3 && -arg4P_12+arg4<=0 && arg2>=1 ], cost: arg2
     20: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg4'=arg4P_13, [ arg4>0 && -3+arg1P_13<=arg1 && arg1>2 && arg1P_13>5 && -arg4P_13+arg4<=0 && arg2>=1 ], cost: arg2
     21: f1551_0_createTree_LE -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg4'=arg4P_14, [ arg4>0 && -3+arg1P_14<=arg1 && arg1>2 && arg1P_14>5 && -arg4P_14+arg4<=0 && arg2>=1 ], cost: arg2
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg1P_1>-1 ], cost: 1
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
     22: f1_0_main_Load -> f1317_0_mirror_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>0 && arg1P_3>-1 ], cost: 2
      8: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=1+x27_1, [ x27_1>0 && arg2P_9>-1 && -1+arg1P_9<=arg1 && arg1>0 && arg1P_9>1 ], cost: 1
     24: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=-1+arg2P_9, arg3'=arg3P_9, arg4'=1+x27_1, [ x27_1>0 && arg1>0 && arg2P_9>0 && arg1P_10>-1 && 2+arg1P_10<=1+arg1 ], cost: 2
     26: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=-1+arg2P_9, arg3'=arg3P_9, arg4'=arg4P_11, [ arg2P_9>0 && arg1P_11>3 && -2+arg1P_11<=1+arg1 && 3<=1+arg1 ], cost: 2
     28: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=-1+arg2P_9, arg3'=arg3P_9, arg4'=arg4P_12, [ arg2P_9>0 && arg1P_12>3 && -2+arg1P_12<=1+arg1 && 3<=1+arg1 ], cost: 2
     30: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=-1+arg2P_9, arg3'=arg3P_9, arg4'=arg4P_13, [ arg2P_9>0 && arg1P_13>5 && -3+arg1P_13<=1+arg1 && 3<=1+arg1 ], cost: 2
     32: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=-1+arg2P_9, arg3'=arg3P_9, arg4'=arg4P_14, [ arg2P_9>0 && arg1P_14>5 && -3+arg1P_14<=1+arg1 && 3<=1+arg1 ], cost: 2
     34: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_11, [ arg1P_11>3 && arg2P_9>=1 && -2+arg1P_11<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_11 ], cost: 1+arg2P_9
     36: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_12, [ arg1P_12>3 && arg2P_9>=1 && -2+arg1P_12<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_12 ], cost: 1+arg2P_9
     38: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_13, [ arg1P_13>5 && arg2P_9>=1 && -3+arg1P_13<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_13 ], cost: 1+arg2P_9
     40: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_14, [ arg1P_14>5 && arg2P_9>=1 && -3+arg1P_14<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_14 ], cost: 1+arg2P_9
      7: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+x22_1, [ x22_1>0 && arg2P_8>-1 && -3+arg1P_8<=arg1 && arg1>0 && arg1P_8>3 ], cost: 1
     23: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_10, arg2'=-1+arg2P_8, arg3'=arg3P_8, arg4'=1+x22_1, [ x22_1>0 && arg1>0 && arg2P_8>0 && arg1P_10>-1 && 2+arg1P_10<=3+arg1 ], cost: 2
     25: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=-1+arg2P_8, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1>0 && arg2P_8>0 && arg1P_11>3 && -2+arg1P_11<=3+arg1 ], cost: 2
     27: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=-1+arg2P_8, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1>0 && arg2P_8>0 && arg1P_12>3 && -2+arg1P_12<=3+arg1 ], cost: 2
     29: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=-1+arg2P_8, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1>0 && arg2P_8>0 && arg1P_13>5 && -3+arg1P_13<=3+arg1 ], cost: 2
     31: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=-1+arg2P_8, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1>0 && arg2P_8>0 && arg1P_14>5 && -3+arg1P_14<=3+arg1 ], cost: 2
     33: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1>0 && arg1P_11>3 && arg2P_8>=1 && 1<=-1+arg4P_11 && -2+arg1P_11<=3+arg1 ], cost: 1+arg2P_8
     35: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1>0 && arg1P_12>3 && arg2P_8>=1 && 1<=-1+arg4P_12 && -2+arg1P_12<=3+arg1 ], cost: 1+arg2P_8
     37: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1>0 && arg1P_13>5 && arg2P_8>=1 && 1<=-1+arg4P_13 && -3+arg1P_13<=3+arg1 ], cost: 1+arg2P_8
     39: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1>0 && arg1P_14>5 && arg2P_8>=1 && 1<=-1+arg4P_14 && -3+arg1P_14<=3+arg1 ], cost: 1+arg2P_8
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      4: f1_0_main_Load -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      6: f1_0_main_Load -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1 && arg1>0 && arg1P_7>0 ], cost: 1
     34: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_11, [ arg1P_11>3 && arg2P_9>=1 && -2+arg1P_11<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_11 ], cost: 1+arg2P_9
     36: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_12, [ arg1P_12>3 && arg2P_9>=1 && -2+arg1P_12<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_12 ], cost: 1+arg2P_9
     38: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_13, [ arg1P_13>5 && arg2P_9>=1 && -3+arg1P_13<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_13 ], cost: 1+arg2P_9
     40: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_14, [ arg1P_14>5 && arg2P_9>=1 && -3+arg1P_14<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_14 ], cost: 1+arg2P_9
     33: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1>0 && arg1P_11>3 && arg2P_8>=1 && 1<=-1+arg4P_11 && -2+arg1P_11<=3+arg1 ], cost: 1+arg2P_8
     35: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1>0 && arg1P_12>3 && arg2P_8>=1 && 1<=-1+arg4P_12 && -2+arg1P_12<=3+arg1 ], cost: 1+arg2P_8
     37: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1>0 && arg1P_13>5 && arg2P_8>=1 && 1<=-1+arg4P_13 && -3+arg1P_13<=3+arg1 ], cost: 1+arg2P_8
     39: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1>0 && arg1P_14>5 && arg2P_8>=1 && 1<=-1+arg4P_14 && -3+arg1P_14<=3+arg1 ], cost: 1+arg2P_8
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     34: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_11, [ arg1P_11>3 && arg2P_9>=1 && -2+arg1P_11<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_11 ], cost: 1+arg2P_9
     36: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_12, [ arg1P_12>3 && arg2P_9>=1 && -2+arg1P_12<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_12 ], cost: 1+arg2P_9
     38: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_13, [ arg1P_13>5 && arg2P_9>=1 && -3+arg1P_13<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_13 ], cost: 1+arg2P_9
     40: f731_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_14, [ arg1P_14>5 && arg2P_9>=1 && -3+arg1P_14<=1+arg1 && 3<=1+arg1 && 1<=-1+arg4P_14 ], cost: 1+arg2P_9
     33: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1>0 && arg1P_11>3 && arg2P_8>=1 && 1<=-1+arg4P_11 && -2+arg1P_11<=3+arg1 ], cost: 1+arg2P_8
     35: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1>0 && arg1P_12>3 && arg2P_8>=1 && 1<=-1+arg4P_12 && -2+arg1P_12<=3+arg1 ], cost: 1+arg2P_8
     37: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1>0 && arg1P_13>5 && arg2P_8>=1 && 1<=-1+arg4P_13 && -3+arg1P_13<=3+arg1 ], cost: 1+arg2P_8
     39: f750_0_random_ArrayAccess -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1>0 && arg1P_14>5 && arg2P_8>=1 && 1<=-1+arg4P_14 && -3+arg1P_14<=3+arg1 ], cost: 1+arg2P_8
     41: __init -> f731_0_random_ArrayAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_5>0 ], cost: 2
     42: __init -> f750_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     43: __init -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_11, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_11>3 && arg2P_9>=1 && -2+arg1P_11<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_11 ], cost: 3+arg2P_9
     44: __init -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_12, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_12>3 && arg2P_9>=1 && -2+arg1P_12<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_12 ], cost: 3+arg2P_9
     45: __init -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_13, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_13>5 && arg2P_9>=1 && -3+arg1P_13<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_13 ], cost: 3+arg2P_9
     46: __init -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_14, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_14>5 && arg2P_9>=1 && -3+arg1P_14<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_14 ], cost: 3+arg2P_9
     47: __init -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_11>3 && arg2P_8>=1 && 1<=-1+arg4P_11 && -2+arg1P_11<=3+arg1P_7 ], cost: 3+arg2P_8
     48: __init -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_12>3 && arg2P_8>=1 && 1<=-1+arg4P_12 && -2+arg1P_12<=3+arg1P_7 ], cost: 3+arg2P_8
     49: __init -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_13>5 && arg2P_8>=1 && 1<=-1+arg4P_13 && -3+arg1P_13<=3+arg1P_7 ], cost: 3+arg2P_8
     50: __init -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_14>5 && arg2P_8>=1 && 1<=-1+arg4P_14 && -3+arg1P_14<=3+arg1P_7 ], cost: 3+arg2P_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     43: __init -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_11, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_11>3 && arg2P_9>=1 && -2+arg1P_11<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_11 ], cost: 3+arg2P_9
     44: __init -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_12, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_12>3 && arg2P_9>=1 && -2+arg1P_12<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_12 ], cost: 3+arg2P_9
     45: __init -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_13, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_13>5 && arg2P_9>=1 && -3+arg1P_13<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_13 ], cost: 3+arg2P_9
     46: __init -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_9, arg4'=arg4P_14, [ arg1P_5<=arg1P_18 && arg1P_18>0 && arg1P_14>5 && arg2P_9>=1 && -3+arg1P_14<=1+arg1P_5 && 3<=1+arg1P_5 && 1<=-1+arg4P_14 ], cost: 3+arg2P_9
     47: __init -> f1551_0_createTree_LE : arg1'=arg1P_11, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_11, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_11>3 && arg2P_8>=1 && 1<=-1+arg4P_11 && -2+arg1P_11<=3+arg1P_7 ], cost: 3+arg2P_8
     48: __init -> f1551_0_createTree_LE : arg1'=arg1P_12, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_12, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_12>3 && arg2P_8>=1 && 1<=-1+arg4P_12 && -2+arg1P_12<=3+arg1P_7 ], cost: 3+arg2P_8
     49: __init -> f1551_0_createTree_LE : arg1'=arg1P_13, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_13, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_13>5 && arg2P_8>=1 && 1<=-1+arg4P_13 && -3+arg1P_13<=3+arg1P_7 ], cost: 3+arg2P_8
     50: __init -> f1551_0_createTree_LE : arg1'=arg1P_14, arg2'=0, arg3'=arg3P_8, arg4'=arg4P_14, [ arg1P_7<=arg1P_18 && arg1P_18>0 && arg1P_7>0 && arg1P_14>5 && arg2P_8>=1 && 1<=-1+arg4P_14 && -3+arg1P_14<=3+arg1P_7 ], cost: 3+arg2P_8

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

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

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

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

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

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

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

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