WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      2: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg3P_3>0 && arg2>-1 && -2+arg1P_3<=arg1 && -2+arg2P_3<=arg1 && arg1>0 && arg1P_3>2 && arg2P_3>2 && 1==arg4P_3 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 && arg2==arg3P_10 && 1==arg4P_10 ], cost: 1
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 && arg3==arg4P_11 ], cost: 1
      1: f456_0_createTree_Return -> f1938_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1>=arg1P_2 && arg2>=2+arg1P_2 && arg2>=arg2P_2 && arg1>0 && arg2>2 && arg1P_2>0 && arg2P_2>2 && arg2>=2+arg4 && arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
      3: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>2 && arg2>2 && arg1P_4>2 && arg2P_4>0 && -1+arg3==arg3P_4 && 1+arg4==arg4P_4 ], cost: 1
      4: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && x30_1>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>2 && arg2>2 && arg1P_5>2 && arg2P_5>0 && -1+arg3==arg3P_5 && 1+arg4==arg4P_5 ], cost: 1
      5: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>0 && x37_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>2 && arg2>2 && arg1P_8>4 && arg2P_8>4 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>0 && x56_1>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>4 && arg2P_9>4 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, [ arg3>-1 && x75_1>41 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && x83_1<42 && x83_1>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && x90_1<42 && x90_1>-1 && 2+arg1P_14<=arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg1 && 2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>0 && arg2P_14>0 && arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      2: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg3P_3>0 && arg2>-1 && -2+arg1P_3<=arg1 && -2+arg2P_3<=arg1 && arg1>0 && arg1P_3>2 && arg2P_3>2 && 1==arg4P_3 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 && arg2==arg3P_10 && 1==arg4P_10 ], cost: 1
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 && arg3==arg4P_11 ], cost: 1
      3: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>2 && arg2>2 && arg1P_4>2 && arg2P_4>0 && -1+arg3==arg3P_4 && 1+arg4==arg4P_4 ], cost: 1
      4: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>0 && x30_1>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>2 && arg2>2 && arg1P_5>2 && arg2P_5>0 && -1+arg3==arg3P_5 && 1+arg4==arg4P_5 ], cost: 1
      5: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>0 && x37_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>2 && arg2>2 && arg1P_8>4 && arg2P_8>4 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>0 && x56_1>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>4 && arg2P_9>4 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, [ arg3>-1 && x75_1>41 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && x83_1<42 && x83_1>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && x90_1<42 && x90_1>-1 && 2+arg1P_14<=arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg1 && 2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>0 && arg2P_14>0 && arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 && arg3==arg3P_15 && arg4==arg4P_15 ], cost: 1
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      2: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, arg5'=arg5P_3, [ arg3P_3>0 && arg2>-1 && -2+arg1P_3<=arg1 && -2+arg2P_3<=arg1 && arg1>0 && arg1P_3>2 && arg2P_3>2 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
      3: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>2 && arg2>2 && arg1P_4>2 && arg2P_4>0 ], cost: 1
      4: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_5, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>2 && arg2>2 && arg1P_5>2 && arg2P_5>0 ], cost: 1
      5: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_6, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 ], cost: 1
      6: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 ], cost: 1
      7: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>2 && arg2>2 && arg1P_8>4 && arg2P_8>4 ], cost: 1
      8: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>4 && arg2P_9>4 ], cost: 1
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg4'=1+arg4, arg5'=arg5P_12, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg4'=1+arg4, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 ], cost: 1
     13: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=1+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && 2+arg1P_14<=arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg1 && 2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>0 && arg2P_14>0 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 ], cost: 1
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 3.
   Accelerating the following rules:
      3: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>2 && arg2>2 && arg1P_4>2 && arg2P_4>0 ], cost: 1
      4: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_5, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>2 && arg2>2 && arg1P_5>2 && arg2P_5>0 ], cost: 1
      5: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_6, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 ], cost: 1
      6: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 ], cost: 1
      7: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>2 && arg2>2 && arg1P_8>4 && arg2P_8>4 ], cost: 1
      8: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>4 && arg2P_9>4 ], cost: 1

   Failed to prove monotonicity of the guard of rule 3.
   Failed to prove monotonicity of the guard of rule 4.
   Accelerated rule 5 with backward acceleration, yielding the new rule 16.
   Accelerated rule 6 with backward acceleration, yielding the new rule 17.
   Failed to prove monotonicity of the guard of rule 7.
   Failed to prove monotonicity of the guard of rule 8.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 5 (outer loop) and 7 (inner loop) with Rule(3 | arg4>-1, arg1>2, arg2>2, arg1P_6>2, arg2P_6>2, k_4>=1, 1-2*k_4+arg3>0, | 2*k_4 || 3 | 0=arg1P_6, 1=arg2P_6, 2=-2*k_4+arg3, 3=2*k_4+arg4, 4=arg5P_6, ), resulting in the new rules: 18, 19.
   Nested simple loops 6 (outer loop) and 7 (inner loop) with Rule(3 | arg4>-1, arg1>2, arg2>2, arg1P_7>2, arg2P_7>2, k_5>=1, 1+arg3-2*k_5>0, | 2*k_5 || 3 | 0=arg1P_7, 1=arg2P_7, 2=arg3-2*k_5, 3=arg4+2*k_5, 4=arg5P_7, ), resulting in the new rules: 20, 21.
   Nested simple loops 5 (outer loop) and 8 (inner loop) with Rule(3 | arg4>-1, arg1>2, arg2>2, arg1P_6>2, arg2P_6>2, k_6>=1, 1+arg3-2*k_6>0, | 2*k_6 || 3 | 0=arg1P_6, 1=arg2P_6, 2=arg3-2*k_6, 3=2*k_6+arg4, 4=arg5P_6, ), resulting in the new rules: 22, 23.
   Nested simple loops 6 (outer loop) and 8 (inner loop) with Rule(3 | arg4>-1, arg1>2, arg2>2, arg1P_7>2, arg2P_7>2, k_7>=1, 1-2*k_7+arg3>0, | 2*k_7 || 3 | 0=arg1P_7, 1=arg2P_7, 2=-2*k_7+arg3, 3=2*k_7+arg4, 4=arg5P_7, ), resulting in the new rules: 24, 25.
   Removing the simple loops: 5 6.

Accelerating simple loops of location 4.
   Accelerating the following rules:
     13: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=1+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && 2+arg1P_14<=arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg1 && 2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>0 && arg2P_14>0 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      2: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, arg5'=arg5P_3, [ arg3P_3>0 && arg2>-1 && -2+arg1P_3<=arg1 && -2+arg2P_3<=arg1 && arg1>0 && arg1P_3>2 && arg2P_3>2 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
      3: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>2 && arg2>2 && arg1P_4>2 && arg2P_4>0 ], cost: 1
      4: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_5, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>2 && arg2>2 && arg1P_5>2 && arg2P_5>0 ], cost: 1
      7: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>2 && arg2>2 && arg1P_8>4 && arg2P_8>4 ], cost: 1
      8: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>4 && arg2P_9>4 ], cost: 1
     16: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_6, [ arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 && arg3>=1 ], cost: arg3
     17: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_7, [ arg4>-1 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 && arg3>=1 ], cost: arg3
     18: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-2*k_4+arg3, arg4'=2*k_4+arg4, arg5'=arg5P_6, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && 1-2*k_4+arg3>0 ], cost: 2*k_4
     19: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1-2*k_4+arg3, arg4'=1+2*k_4+arg4, arg5'=arg5P_6, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && -2*k_4+arg3>0 ], cost: 1+2*k_4
     20: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3-2*k_5, arg4'=arg4+2*k_5, arg5'=arg5P_7, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3-2*k_5>0 ], cost: 2*k_5
     21: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3-2*k_5, arg4'=1+arg4+2*k_5, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3-2*k_5>0 ], cost: 1+2*k_5
     22: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3-2*k_6, arg4'=2*k_6+arg4, arg5'=arg5P_6, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && 1+arg3-2*k_6>0 ], cost: 2*k_6
     23: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3-2*k_6, arg4'=1+2*k_6+arg4, arg5'=arg5P_6, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3-2*k_6>0 ], cost: 1+2*k_6
     24: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-2*k_7+arg3, arg4'=2*k_7+arg4, arg5'=arg5P_7, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1-2*k_7+arg3>0 ], cost: 2*k_7
     25: f1893_0_createTree_LE -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1-2*k_7+arg3, arg4'=1+2*k_7+arg4, arg5'=arg5P_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && -2*k_7+arg3>0 ], cost: 1+2*k_7
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg4'=1+arg4, arg5'=arg5P_12, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg4'=1+arg4, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 ], cost: 1
     13: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=1+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && 2+arg1P_14<=arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg1 && 2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>0 && arg2P_14>0 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 ], cost: 1
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      2: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, arg5'=arg5P_3, [ arg3P_3>0 && arg2>-1 && -2+arg1P_3<=arg1 && -2+arg2P_3<=arg1 && arg1>0 && arg1P_3>2 && arg2P_3>2 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     26: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3P_3, arg4'=2, arg5'=arg5P_4, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_4>2 && arg2P_4>0 && 2+arg2P_4<=2+arg1 && arg1P_4<=2+arg1 ], cost: 2
     27: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3P_3, arg4'=2, arg5'=arg5P_5, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_5>2 && arg2P_5>0 && 2+arg2P_5<=2+arg1 && arg1P_5<=2+arg1 ], cost: 2
     28: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_3, arg4'=2, arg5'=arg5P_8, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>4 && arg2P_8>4 && -2+arg1P_8<=2+arg1 && -2+arg2P_8<=2+arg1 ], cost: 2
     29: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_3, arg4'=2, arg5'=arg5P_9, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>4 && arg2P_9>4 && -2+arg1P_9<=2+arg1 && -2+arg2P_9<=2+arg1 ], cost: 2
     30: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 ], cost: 1+arg3P_3
     31: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 ], cost: 1+arg3P_3
     32: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_4, arg4'=1+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && 1+arg3P_3-2*k_4>0 ], cost: 1+2*k_4
     33: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_4, arg4'=2+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && arg3P_3-2*k_4>0 ], cost: 2+2*k_4
     34: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 1+2*k_5
     35: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     36: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_6, arg4'=1+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && 1+arg3P_3-2*k_6>0 ], cost: 1+2*k_6
     37: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 2+2*k_6
     38: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 1+2*k_7
     39: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     40: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2, arg4'=2, arg5'=arg5P_14, [ arg2>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1 && 2+arg2P_14<=-1+arg1 && 3<=-1+arg1 ], cost: 2
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg4'=1+arg4, arg5'=arg5P_12, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg4'=1+arg4, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 ], cost: 1
     42: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=1+arg4, arg5'=arg5P_14, [ 2+arg5<=arg1 && arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1 && 2+arg2P_14<=-2+arg1 && 3<=-2+arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 && 3<=arg2 ], cost: 2
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>2 ], cost: 1
      9: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     30: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 ], cost: 1+arg3P_3
     31: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 ], cost: 1+arg3P_3
     32: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_4, arg4'=1+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && 1+arg3P_3-2*k_4>0 ], cost: 1+2*k_4
     33: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_4, arg4'=2+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && arg3P_3-2*k_4>0 ], cost: 2+2*k_4
     34: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 1+2*k_5
     35: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     36: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_6, arg4'=1+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && 1+arg3P_3-2*k_6>0 ], cost: 1+2*k_6
     37: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 2+2*k_6
     38: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 1+2*k_7
     39: f1_0_main_Load -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     40: f1_0_main_Load -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2, arg4'=2, arg5'=arg5P_14, [ arg2>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1 && 2+arg2P_14<=-1+arg1 && 3<=-1+arg1 ], cost: 2
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     11: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg4'=1+arg4, arg5'=arg5P_12, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && arg1P_12>0 && arg2P_12>-1 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 ], cost: 1
     12: f1821_0_duplicateRandomPath_NULL -> f1989_0_duplicateRandomPath_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg4'=1+arg4, arg5'=arg5P_13, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>1 && arg2P_13>-1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 ], cost: 1
     14: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg5'=arg5P_15, [ 2+arg1P_15<=arg1 && arg1P_15<=arg2 && 2+arg2P_15<=arg1 && arg2P_15<=arg2 && arg1>2 && arg2>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5<=arg1 ], cost: 1
     42: f1989_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=1+arg4, arg5'=arg5P_14, [ 2+arg5<=arg1 && arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1 && 2+arg2P_14<=-2+arg1 && 3<=-2+arg1 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 && 3<=arg2 ], cost: 2
     15: __init -> f1_0_main_Load : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     56: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && 2+arg1P_15<=arg1P_12 && arg1P_15<=arg2P_12 && 2+arg2P_15<=arg1P_12 && arg2P_15<=arg2P_12 && arg1P_12>2 && arg2P_12>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5P_12<=arg1P_12 ], cost: 2
     57: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && 2+arg5P_12<=arg1P_12 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1P_12 && 2+arg2P_14<=-2+arg1P_12 && 3<=-2+arg1P_12 && 2+arg1P_14<=arg2P_12 && 2+arg2P_14<=arg2P_12 && 3<=arg2P_12 ], cost: 3
     58: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && 2+arg1P_15<=arg1P_13 && arg1P_15<=arg2P_13 && 2+arg2P_15<=arg1P_13 && arg2P_15<=arg2P_13 && arg1P_13>2 && arg2P_13>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5P_13<=arg1P_13 ], cost: 2
     59: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && 2+arg5P_13<=arg1P_13 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1P_13 && 2+arg2P_14<=-2+arg1P_13 && 3<=-2+arg1P_13 && 2+arg1P_14<=arg2P_13 && 2+arg2P_14<=arg2P_13 && 3<=arg2P_13 ], cost: 3
     43: __init -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1P_16 && arg1P_16>0 && arg1P_1>0 && arg2P_1>2 ], cost: 2
     44: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2P_16, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1P_16 && arg2P_16>0 && 1+arg2P_10<=arg1P_16 && arg1P_16>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 2
     45: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 ], cost: 2+arg3P_3
     46: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 ], cost: 2+arg3P_3
     47: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_4, arg4'=1+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && 1+arg3P_3-2*k_4>0 ], cost: 2+2*k_4
     48: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_4, arg4'=2+2*k_4, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_4>=1 && arg3P_3-2*k_4>0 ], cost: 3+2*k_4
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     51: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_3-2*k_6, arg4'=1+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && 1+arg3P_3-2*k_6>0 ], cost: 2+2*k_6
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1P_16 && 2+arg2P_14<=-1+arg1P_16 && 3<=-1+arg1P_16 ], cost: 3

Applied pruning (of leafs and parallel rules):
   Start location: __init
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     56: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && 2+arg1P_15<=arg1P_12 && arg1P_15<=arg2P_12 && 2+arg2P_15<=arg1P_12 && arg2P_15<=arg2P_12 && arg1P_12>2 && arg2P_12>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5P_12<=arg1P_12 ], cost: 2
     57: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_12<=arg1 && arg1P_12<=arg2 && 1+arg2P_12<=arg1 && 1+arg2P_12<=arg2 && arg1>0 && arg2>0 && 2+arg5P_12<=arg1 && 2+arg5P_12<=arg2 && 2+arg5P_12<=arg1P_12 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1P_12 && 2+arg2P_14<=-2+arg1P_12 && 3<=-2+arg1P_12 && 2+arg1P_14<=arg2P_12 && 2+arg2P_14<=arg2P_12 && 3<=arg2P_12 ], cost: 3
     58: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && 2+arg1P_15<=arg1P_13 && arg1P_15<=arg2P_13 && 2+arg2P_15<=arg1P_13 && arg2P_15<=arg2P_13 && arg1P_13>2 && arg2P_13>0 && arg1P_15>0 && arg2P_15>0 && 2+arg5P_13<=arg1P_13 ], cost: 2
     59: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_13<=arg1 && arg1P_13<=arg2 && 2+arg2P_13<=arg1 && 2+arg2P_13<=arg2 && arg1>1 && arg2>1 && 2+arg5P_13<=arg1 && 2+arg5P_13<=arg2 && 2+arg5P_13<=arg1P_13 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1P_13 && 2+arg2P_14<=-2+arg1P_13 && 3<=-2+arg1P_13 && 2+arg1P_14<=arg2P_13 && 2+arg2P_14<=arg2P_13 && 3<=arg2P_13 ], cost: 3
     43: __init -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1P_16 && arg1P_16>0 && arg1P_1>0 && arg2P_1>2 ], cost: 2
     44: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2P_16, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1P_16 && arg2P_16>0 && 1+arg2P_10<=arg1P_16 && arg1P_16>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 2
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1P_16 && 2+arg2P_14<=-1+arg1P_16 && 3<=-1+arg1P_16 ], cost: 3

Accelerating simple loops of location 4.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     56: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=arg1 && 2+arg2P_15<=arg1 && 3<=arg1 && 2+arg1P_15<=arg2 && 2+arg2P_15<=arg2 && 3<=arg2 ], cost: 2
     57: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 4+arg1P_14<=arg1 && 4+arg2P_14<=arg1 && 5<=arg1 && 4+arg1P_14<=arg2 && 4+arg2P_14<=arg2 && 5<=arg2 ], cost: 3
     58: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_15>0 && arg2P_15>0 && arg1P_15<=-2+arg1 && arg2P_15<=-2+arg1 && 1<=-2+arg1 && arg1P_15<=-2+arg2 && arg2P_15<=-2+arg2 && 1<=-2+arg2 ], cost: 2
     59: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1 && 2+arg2P_14<=-2+arg1 && 3<=-2+arg1 && 2+arg1P_14<=-2+arg2 && 2+arg2P_14<=-2+arg2 && 3<=-2+arg2 ], cost: 3

   Failed to prove monotonicity of the guard of rule 56.
   Failed to prove monotonicity of the guard of rule 57.
   Failed to prove monotonicity of the guard of rule 58.
   Failed to prove monotonicity of the guard of rule 59.
[accelerate] Nesting with 4 inner and 4 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     56: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=arg1 && 2+arg2P_15<=arg1 && 3<=arg1 && 2+arg1P_15<=arg2 && 2+arg2P_15<=arg2 && 3<=arg2 ], cost: 2
     57: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 4+arg1P_14<=arg1 && 4+arg2P_14<=arg1 && 5<=arg1 && 4+arg1P_14<=arg2 && 4+arg2P_14<=arg2 && 5<=arg2 ], cost: 3
     58: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg4'=1+arg4, arg5'=arg5P_15, [ arg3>-1 && arg4>-1 && arg1P_15>0 && arg2P_15>0 && arg1P_15<=-2+arg1 && arg2P_15<=-2+arg1 && 1<=-2+arg1 && arg1P_15<=-2+arg2 && arg2P_15<=-2+arg2 && 1<=-2+arg2 ], cost: 2
     59: f1821_0_duplicateRandomPath_NULL -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg4'=2+arg4, arg5'=arg5P_14, [ arg3>-1 && arg4>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-2+arg1 && 2+arg2P_14<=-2+arg1 && 3<=-2+arg1 && 2+arg1P_14<=-2+arg2 && 2+arg2P_14<=-2+arg2 && 3<=-2+arg2 ], cost: 3
     43: __init -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1P_16 && arg1P_16>0 && arg1P_1>0 && arg2P_1>2 ], cost: 2
     44: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2P_16, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1P_16 && arg2P_16>0 && 1+arg2P_10<=arg1P_16 && arg1P_16>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 2
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1P_16 && 2+arg2P_14<=-1+arg1P_16 && 3<=-1+arg1P_16 ], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     10: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg3, arg5'=arg5P_11, [ arg1P_11<=arg2 && arg3P_11>0 && arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>2 && arg2P_11>2 && 2+arg4<=arg2 ], cost: 1
     41: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=arg2 && 2+arg2P_14<=arg2 ], cost: 2
     60: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_15, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=arg2 && 2+arg2P_15<=arg2 ], cost: 3
     61: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_11, arg4'=2+arg3, arg5'=arg5P_15, [ arg3P_11>0 && arg1>0 && 2+arg4<=arg2 && arg3>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=-2+arg2 && 2+arg2P_15<=-2+arg2 && 3<=-2+arg2 ], cost: 4
     64: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=2+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 4+arg1P_14<=arg2 && 4+arg2P_14<=arg2 && 5<=arg2 ], cost: 4
     66: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_11, arg4'=1+arg3, arg5'=arg5P_15, [ arg3P_11>0 && arg1>0 && arg2>2 && 2+arg4<=arg2 && arg3>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=arg2 && 2+arg2P_15<=arg2 ], cost: 3
     67: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_11, arg4'=2+arg3, arg5'=arg5P_15, [ arg3P_11>0 && arg1>0 && 2+arg4<=arg2 && arg3>-1 && arg1P_15>0 && arg2P_15>0 && 2+arg1P_15<=-2+arg2 && 2+arg2P_15<=-2+arg2 && 3<=-2+arg2 ], cost: 4
     70: f1938_0_main_InvokeMethod -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_11, arg4'=2+arg3, arg5'=arg5P_14, [ arg3P_11>0 && arg1>0 && 2+arg4<=arg2 && arg3>-1 && arg1P_14>0 && arg2P_14>0 && 4+arg1P_14<=arg2 && 4+arg2P_14<=arg2 && 5<=arg2 ], cost: 4
     43: __init -> f1938_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg1P_1<=arg1P_16 && arg1P_16>0 && arg1P_1>0 && arg2P_1>2 ], cost: 2
     44: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg2P_16, arg4'=1, arg5'=arg5P_10, [ 1+arg1P_10<=arg1P_16 && arg2P_16>0 && 1+arg2P_10<=arg1P_16 && arg1P_16>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 2
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 && 2+arg1P_14<=-1+arg1P_16 && 2+arg2P_14<=-1+arg1P_16 && 3<=-1+arg1P_16 ], cost: 3
     62: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_15, [ arg2P_16>0 && arg1P_15>0 && arg2P_15>0 ], cost: 4
     63: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg2P_16, arg4'=3, arg5'=arg5P_15, [ arg2P_16>0 && arg1P_15>0 && arg2P_15>0 ], cost: 5
     65: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=3, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 ], cost: 5
     68: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg2P_16, arg4'=2, arg5'=arg5P_15, [ arg2P_16>0 && arg1P_15>0 && arg2P_15>0 ], cost: 4
     69: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg2P_16, arg4'=3, arg5'=arg5P_15, [ arg2P_16>0 && arg1P_15>0 && arg2P_15>0 ], cost: 5
     71: __init -> f1821_0_duplicateRandomPath_NULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg2P_16, arg4'=3, arg5'=arg5P_14, [ arg2P_16>0 && arg1P_14>0 && arg2P_14>0 ], cost: 5

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg3P_3>0 && arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7

Computing asymptotic complexity for rule 49
   Simplified the guard:
     49: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_5, arg4'=1+2*k_5, arg5'=arg5P_7, [ arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && 1+arg3P_3-2*k_5>0 ], cost: 2+2*k_5
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 50
   Simplified the guard:
     50: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_5, arg4'=2+2*k_5, arg5'=arg5P_7, [ arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_5>=1 && arg3P_3-2*k_5>0 ], cost: 3+2*k_5
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 52
   Simplified the guard:
     52: __init -> f1893_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_3-2*k_6, arg4'=2+2*k_6, arg5'=arg5P_6, [ arg2P_16>-1 && arg1P_16>0 && arg1P_6>2 && arg2P_6>2 && k_6>=1 && arg3P_3-2*k_6>0 ], cost: 3+2*k_6
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 53
   Simplified the guard:
     53: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_3-2*k_7, arg4'=1+2*k_7, arg5'=arg5P_7, [ arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && 1+arg3P_3-2*k_7>0 ], cost: 2+2*k_7
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 54
   Simplified the guard:
     54: __init -> f1893_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_3-2*k_7, arg4'=2+2*k_7, arg5'=arg5P_7, [ arg2P_16>-1 && arg1P_16>0 && arg1P_7>2 && arg2P_7>2 && k_7>=1 && arg3P_3-2*k_7>0 ], cost: 3+2*k_7
   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),?)