NO

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

Initial linear ITS problem
   Start location: __init
      0: f193_0_createTree_Return -> f295_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2==arg2P_1 ], cost: 1
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x35_1>-1 && arg2>0 && arg1>0 ], cost: 1
     16: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x92_1>0 && arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && x38_1>-1 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     18: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && x108_1>0 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1
     19: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1
      3: f511_0_createTree_Return -> f2344_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg1 && 1+arg1P_4<=arg2 && arg2P_4<=arg2 && arg1>0 && arg2>1 && arg1P_4>0 && arg2P_4>1 && 2+arg4<=arg2 && arg3==arg3P_4 && arg4==arg4P_4 ], cost: 1
     17: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1
      5: f512_0_createTree_Return -> f2354_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_6<=arg1 && 1+arg1P_6<=arg2 && arg2P_6<=arg2 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>1 && 2+arg3<=arg2 && arg3==arg3P_6 ], cost: 1
      9: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 && 1+x43_1==arg4P_10 ], cost: 1
     10: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     11: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 && -1+arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1
     14: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && -1+arg3==arg3P_15 && 1+arg4==arg4P_15 ], cost: 1
     15: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && -1+arg3==arg3P_16 && 1+arg4==arg4P_16 ], cost: 1
     20: f1431_0_samefringe_NULL -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 1
     21: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1P_22<=arg1 && arg1P_22<=arg3 && arg2P_22<=arg1 && arg2P_22<=arg3 && 1+arg3P_22<=arg1 && 1+arg3P_22<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>0 && arg2P_22>0 && arg3P_22>-1 ], cost: 1
     22: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1P_23<=arg2 && arg2P_23<=arg2 && 1+arg3P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>0 && arg3P_23>-1 ], cost: 1
     23: f1838_0_gopher_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg1 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 1+arg3P_24<=arg3 && arg1>0 && arg2>2 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 ], cost: 1
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x35_1>-1 && arg2>0 && arg1>0 ], cost: 1
     16: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x92_1>0 && arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && x38_1>-1 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     18: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && x108_1>0 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1
     19: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1
     17: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1
      9: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 && 1+x43_1==arg4P_10 ], cost: 1
     10: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     11: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 && -1+arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1
     14: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && -1+arg3==arg3P_15 && 1+arg4==arg4P_15 ], cost: 1
     15: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && -1+arg3==arg3P_16 && 1+arg4==arg4P_16 ], cost: 1
     20: f1431_0_samefringe_NULL -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 1
     21: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1P_22<=arg1 && arg1P_22<=arg3 && arg2P_22<=arg1 && arg2P_22<=arg3 && 1+arg3P_22<=arg1 && 1+arg3P_22<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>0 && arg2P_22>0 && arg3P_22>-1 ], cost: 1
     22: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1P_23<=arg2 && arg2P_23<=arg2 && 1+arg3P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>0 && arg3P_23>-1 ], cost: 1
     23: f1838_0_gopher_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg1 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 1+arg3P_24<=arg3 && arg1>0 && arg2>2 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 ], cost: 1
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     16: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     18: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1
     19: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1
     17: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1
      9: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1
     10: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     12: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 ], cost: 1
     13: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 ], cost: 1
     14: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1
     15: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1
     20: f1431_0_samefringe_NULL -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 1
     21: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1P_22<=arg1 && arg1P_22<=arg3 && arg2P_22<=arg1 && arg2P_22<=arg3 && 1+arg3P_22<=arg1 && 1+arg3P_22<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>0 && arg2P_22>0 && arg3P_22>-1 ], cost: 1
     22: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1P_23<=arg2 && arg2P_23<=arg2 && 1+arg3P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>0 && arg3P_23>-1 ], cost: 1
     23: f1838_0_gopher_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg1 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 1+arg3P_24<=arg3 && arg1>0 && arg2>2 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 ], cost: 1
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 8.
   Accelerating the following rules:
     10: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     12: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 ], cost: 1
     13: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 ], cost: 1
     14: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1
     15: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1

   Failed to prove monotonicity of the guard of rule 10.
   Failed to prove monotonicity of the guard of rule 11.
[test] deduced pseudo-invariant -arg2+arg2P_13<=0, also trying arg2-arg2P_13<=-1
   Accelerated rule 12 with backward acceleration, yielding the new rule 25.
[test] deduced pseudo-invariant -arg2+arg2P_14<=0, also trying arg2-arg2P_14<=-1
   Accelerated rule 13 with backward acceleration, yielding the new rule 26.
   Failed to prove monotonicity of the guard of rule 14.
   Failed to prove monotonicity of the guard of rule 15.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 12 (outer loop) and 14 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_15>3, arg2P_15>3, k_7>=1, 1+arg3-2*k_7>0, | 2*k_7 || 8 | 0=arg1P_15, 1=arg2P_15, 2=arg3-2*k_7, 3=2*k_7+arg4, ), resulting in the new rules: 27, 28.
   Nested simple loops 13 (outer loop) and 14 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_15>3, arg2P_15>3, k_8>=1, 1+arg3-2*k_8>0, | 2*k_8 || 8 | 0=arg1P_15, 1=arg2P_15, 2=arg3-2*k_8, 3=arg4+2*k_8, ), resulting in the new rules: 29, 30.
   Nested simple loops 12 (outer loop) and 15 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_16>3, arg2P_16>3, k_9>=1, 1+arg3-2*k_9>0, | 2*k_9 || 8 | 0=arg1P_16, 1=arg2P_16, 2=arg3-2*k_9, 3=arg4+2*k_9, ), resulting in the new rules: 31, 32.
   Nested simple loops 13 (outer loop) and 15 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_16>3, arg2P_16>3, k_10>=1, 1-2*k_10+arg3>0, | 2*k_10 || 8 | 0=arg1P_16, 1=arg2P_16, 2=-2*k_10+arg3, 3=2*k_10+arg4, ), resulting in the new rules: 33, 34.
   Removing the simple loops: 12 13.

Accelerating simple loops of location 9.
   Accelerating the following rules:
     20: f1431_0_samefringe_NULL -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 1

[test] deduced invariant -1-arg2<=0
[test] deduced pseudo-invariant arg3-arg3P_21<=0, also trying -arg3+arg3P_21<=-1
[test] deduced pseudo-invariant 1-arg2P_21<=0, also trying -1+arg2P_21<=-1
   Accelerated rule 20 with non-termination, yielding the new rule 35.
   Accelerated rule 20 with non-termination, yielding the new rule 36.
   Accelerated rule 20 with non-termination, yielding the new rule 37.
[accelerate] Nesting with 0 inner and 1 outer candidates

Accelerating simple loops of location 10.
   Accelerating the following rules:
     23: f1838_0_gopher_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg1 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 1+arg3P_24<=arg3 && arg1>0 && arg2>2 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     16: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     18: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1
     19: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1
     17: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1
      9: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1
     10: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     14: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1
     15: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1
     25: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_13>0 && -arg2+arg2P_13<=0 && arg3>=1 && arg2P_13>1 ], cost: arg3
     26: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_14>0 && -arg2+arg2P_14<=0 && arg3>=1 && arg2P_14>1 ], cost: arg3
     27: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3-2*k_7, arg4'=2*k_7+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1+arg3-2*k_7>0 ], cost: 2*k_7
     28: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3-2*k_7, arg4'=1+2*k_7+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3-2*k_7>0 ], cost: 1+2*k_7
     29: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3-2*k_8, arg4'=arg4+2*k_8, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3-2*k_8>0 ], cost: 2*k_8
     30: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3-2*k_8, arg4'=1+arg4+2*k_8, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3-2*k_8>0 ], cost: 1+2*k_8
     31: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3-2*k_9, arg4'=arg4+2*k_9, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3-2*k_9>0 ], cost: 2*k_9
     32: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3-2*k_9, arg4'=1+arg4+2*k_9, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3-2*k_9>0 ], cost: 1+2*k_9
     33: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-2*k_10+arg3, arg4'=2*k_10+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1-2*k_10+arg3>0 ], cost: 2*k_10
     34: f2326_0_createTree_LE -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1-2*k_10+arg3, arg4'=1+2*k_10+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && -2*k_10+arg3>0 ], cost: 1+2*k_10
     20: f1431_0_samefringe_NULL -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 1
     21: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1P_22<=arg1 && arg1P_22<=arg3 && arg2P_22<=arg1 && arg2P_22<=arg3 && 1+arg3P_22<=arg1 && 1+arg3P_22<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>0 && arg2P_22>0 && arg3P_22>-1 ], cost: 1
     22: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1P_23<=arg2 && arg2P_23<=arg2 && 1+arg3P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>0 && arg3P_23>-1 ], cost: 1
     35: f1431_0_samefringe_NULL -> [13] : [ arg1>0 && arg2>0 && arg3>0 && arg1P_21>0 && arg2P_21>0 && arg3P_21>0 ], cost: NONTERM
     36: f1431_0_samefringe_NULL -> [13] : [ arg1>0 && arg2>0 && arg3>0 && arg3-arg3P_21<=0 && arg1P_21>0 && arg2P_21>0 && arg3P_21>0 ], cost: NONTERM
     37: f1431_0_samefringe_NULL -> [13] : [ arg1>0 && arg2>0 && arg3>0 && arg3-arg3P_21<=0 && 1-arg2P_21<=0 && arg1P_21>0 && arg3P_21>0 ], cost: NONTERM
     23: f1838_0_gopher_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg1 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 1+arg3P_24<=arg3 && arg1>0 && arg2>2 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 ], cost: 1
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     16: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1
     52: f295_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg2>0 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 && 1<=-1+arg1 ], cost: 2
     56: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     60: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     64: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     18: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1
     19: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1
     54: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 2+arg4<=arg2 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: 2
     55: f2344_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ arg1>0 && arg2>0 && 2+arg4<=arg2 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 ], cost: 2
     58: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     59: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     62: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     63: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     66: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     67: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     17: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1
     53: f2354_0_main_InvokeMethod -> f1431_0_samefringe_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 2+arg3<=arg2 && arg1P_21>-1 && arg2P_21>-1 && arg3P_21>-1 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: 2
     57: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     61: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     65: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
      9: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1
     38: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_11>0 && arg2P_11>0 ], cost: 2
     39: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_12>0 && arg2P_12>0 ], cost: 2
     40: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 ], cost: 2
     41: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 ], cost: 2
     42: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10
     43: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10
     44: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_7, arg4'=1+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1+arg3P_10-2*k_7>0 ], cost: 1+2*k_7
     45: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 2+2*k_7
     46: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8
     47: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8
     48: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9
     49: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9
     50: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10
     51: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10
     21: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ arg1P_22<=arg1 && arg1P_22<=arg3 && arg2P_22<=arg1 && arg2P_22<=arg3 && 1+arg3P_22<=arg1 && 1+arg3P_22<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>0 && arg2P_22>0 && arg3P_22>-1 ], cost: 1
     22: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ arg1P_23<=arg2 && arg2P_23<=arg2 && 1+arg3P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>0 && arg3P_23>-1 ], cost: 1
     68: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg2>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 && arg1P_24<=arg1 && arg1P_24<=arg3 && -2+arg2P_24<=arg1 && 3+arg3P_24<=arg1 && 3<=arg1 && -2+arg2P_24<=arg3 && 3+arg3P_24<=arg3 && 3<=arg3 ], cost: 2
     69: f1431_0_samefringe_NULL -> f1838_0_gopher_NULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1>0 && arg3>0 && arg1P_24>0 && arg2P_24>2 && arg3P_24>-1 && arg1P_24<=arg2 && -2+arg2P_24<=arg2 && 3+arg3P_24<=arg2 && 3<=arg2 ], cost: 2
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      4: f295_0_main_InvokeMethod -> f2354_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     56: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     60: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     64: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
      1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f1_0_main_Load -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      6: f1_0_main_Load -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     58: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     59: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     62: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     63: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     66: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     67: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     57: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     61: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     65: f2354_0_main_InvokeMethod -> [13] : [ 2+arg3<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     42: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10
     43: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10
     44: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_7, arg4'=1+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1+arg3P_10-2*k_7>0 ], cost: 1+2*k_7
     45: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 2+2*k_7
     46: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8
     47: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8
     48: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9
     49: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9
     50: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10
     51: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10
     24: __init -> f1_0_main_Load : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     56: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     60: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     64: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     73: f295_0_main_InvokeMethod -> [13] : [ arg1P_5<=arg1 && arg2>0 && arg1>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
     74: f295_0_main_InvokeMethod -> [13] : [ arg1P_5<=arg1 && arg2>0 && arg1>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
     75: f295_0_main_InvokeMethod -> [13] : [ arg1P_5<=arg1 && arg2>0 && arg1>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     58: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     59: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     62: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     63: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     66: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     67: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     42: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10
     43: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10
     44: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_7, arg4'=1+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1+arg3P_10-2*k_7>0 ], cost: 1+2*k_7
     45: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 2+2*k_7
     46: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8
     47: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8
     48: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9
     49: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9
     50: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10
     51: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10
     70: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 ], cost: 2
     71: __init -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2
     72: __init -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_25>0 && arg2P_25>-1 ], cost: 2

Merged rules:
   Start location: __init
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     77: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     79: f295_0_main_InvokeMethod -> [13] : [ arg1P_5<=arg1 && arg2>0 && arg1>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     82: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     83: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     42: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10
     43: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10
     44: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_7, arg4'=1+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1+arg3P_10-2*k_7>0 ], cost: 1+2*k_7
     45: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 2+2*k_7
     46: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8
     47: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8
     48: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9
     49: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9
     50: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10
     51: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10
     70: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 ], cost: 2
     71: __init -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2
     72: __init -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_25>0 && arg2P_25>-1 ], cost: 2

Applied pruning (of leafs and parallel rules):
   Start location: __init
      7: f295_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1
     77: f295_0_main_InvokeMethod -> [13] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM
     79: f295_0_main_InvokeMethod -> [13] : [ arg1P_5<=arg1 && arg2>0 && arg1>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
      8: f2344_0_main_InvokeMethod -> f551_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1
     82: f2344_0_main_InvokeMethod -> [13] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM
     83: f2344_0_main_InvokeMethod -> [13] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM
     45: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 2+2*k_7
     46: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8
     47: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8
     49: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9
     51: f551_0_random_ArrayAccess -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10
     70: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 ], cost: 2
     71: __init -> f2344_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2
     72: __init -> f551_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_25>0 && arg2P_25>-1 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     85: __init -> [13] : [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM
     86: __init -> [13] : [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg1P_5<=arg1P_2 && arg2P_2>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
     88: __init -> [13] : [ arg1P_25>=arg1P_3 && arg1P_25>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM
     89: __init -> [13] : [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM
     90: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 4+2*k_7
     91: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 3+2*k_8
     92: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 4+2*k_8
     93: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 4+2*k_9
     94: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 4+2*k_10
     95: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 5+2*k_7
     96: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8
     97: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 5+2*k_8
     98: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9
     99: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 5+2*k_10
    100: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 5+2*k_7
    101: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8
    102: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 5+2*k_8
    103: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9
    104: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 5+2*k_10

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     85: __init -> [13] : [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM
     86: __init -> [13] : [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg1P_5<=arg1P_2 && arg2P_2>0 && 2+arg3P_5<=arg2P_5 && 1<=-1+arg1P_5 && 1<=-1+arg2P_5 ], cost: NONTERM
     88: __init -> [13] : [ arg1P_25>=arg1P_3 && arg1P_25>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM
     89: __init -> [13] : [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM
     90: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 4+2*k_7
     91: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 3+2*k_8
     92: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 4+2*k_8
     93: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 4+2*k_9
     94: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_25>0 && arg2P_25>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 4+2*k_10
     95: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 5+2*k_7
     96: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8
     97: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 5+2*k_8
     98: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9
     99: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 5+2*k_10
    100: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_7, arg4'=2+x43_1+2*k_7, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && arg3P_10-2*k_7>0 ], cost: 5+2*k_7
    101: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8
    102: __init -> f2326_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 5+2*k_8
    103: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+x43_1+2*k_9, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9
    104: __init -> f2326_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+2*k_10+x43_1, [ arg1P_25>=arg1P_3 && arg1P_25>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 5+2*k_10

Computing asymptotic complexity for rule 85
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ arg1P_2<=arg1P_25 && arg1P_25>0 && arg2P_2>0 && 1<=-1+arg1P_2 ]

NO