WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ x7_1>-1 && arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 && arg2==arg2P_3 && 1==arg3P_3 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ x34_1>0 && arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_7 ], cost: 1
      1: f1220_0_create_Return -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg1P_2<=arg1 && 3+arg1P_2<=arg2 && arg2P_2<=arg2 && arg1>0 && arg2>3 && arg1P_2>0 && arg2P_2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_2 && arg4==arg4P_2 && arg5==arg5P_2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>-1 && arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 && arg1==arg1P_4 && 0==arg2P_4 && arg2==arg4P_4 && 1+arg3==arg5P_4 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && -1+arg1==arg1P_5 && arg4==arg2P_5 && arg5==arg3P_5 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && arg1==arg1P_6 && 1+arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 && arg3==arg3P_8 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 && arg3==arg3P_9 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 && arg3==arg3P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ x7_1>-1 && arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 && arg2==arg2P_3 && 1==arg3P_3 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ x34_1>0 && arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 && arg3==arg3P_7 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg2>-1 && arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 && arg1==arg1P_4 && 0==arg2P_4 && arg2==arg4P_4 && 1+arg3==arg5P_4 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && -1+arg1==arg1P_5 && arg4==arg2P_5 && arg5==arg3P_5 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && -1+arg1<arg1 && arg1==arg1P_6 && 1+arg2==arg2P_6 && arg3==arg3P_6 && arg4==arg4P_6 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 && arg3==arg3P_8 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 && arg3==arg3P_9 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 && arg3==arg3P_10 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 4.
   Accelerating the following rules:
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1

   Accelerated rule 5 with metering function arg3-arg2 (after strengthening guard), yielding the new rule 11.
   Removing the simple loops:.

Accelerating simple loops of location 5.
   Accelerating the following rules:
      7: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=arg2P_8, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && 3+arg2P_8<=arg2 && arg1>0 && arg2>2 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      8: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2P_9, arg4'=arg4P_9, arg5'=arg5P_9, [ 2+arg2P_9<=arg2 && arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && arg2P_9>-1 ], cost: 1
      9: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg4'=arg4P_10, arg5'=arg5P_10, [ 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>2 && arg2P_10>-1 ], cost: 1

      During metering: Instantiating temporary variables by {arg2P_8==-3+arg2}
   Accelerated rule 7 with metering function meter (where 3*meter==-2+arg2), yielding the new rule 12.
      During metering: Instantiating temporary variables by {arg2P_9==-2+arg2}
   Accelerated rule 8 with metering function meter_1 (where 2*meter_1==-2+arg2), yielding the new rule 13.
      During metering: Instantiating temporary variables by {arg2P_10==-2+arg2}
   Accelerated rule 9 with metering function meter_2 (where 2*meter_2==-2+arg2), yielding the new rule 14.
   Removing the simple loops: 7 8 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
      5: f2072_0_create_GE -> f2072_0_create_GE : arg2'=1+arg2, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
     11: f2072_0_create_GE -> f2072_0_create_GE : arg2'=arg3, arg5'=arg5P_6, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 && arg5P_6>1 ], cost: arg3-arg2
     12: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=-3*meter+arg2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg1P_8<=arg1 && arg3>1 && arg1>0 && arg2>2 && arg1P_8>0 && 3*meter==-2+arg2 && meter>=1 ], cost: meter
     13: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=arg2-2*meter_1, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && arg1>0 && arg2>2 && arg1P_9>0 && 2*meter_1==-2+arg2 && meter_1>=1 ], cost: meter_1
     14: f2992_0_collectVariables_NULL -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=arg2-2*meter_2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg1>0 && arg2>2 && arg1P_10>2 && 2*meter_2==-2+arg2 && meter_2>=1 ], cost: meter_2
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
      6: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg4'=arg4P_7, arg5'=arg5P_7, [ arg3>1 && -1+arg1P_7<=arg1 && 2+arg1P_7<=arg2 && 3+arg2P_7<=arg2 && arg1>0 && arg2>3 && arg1P_7>1 && arg2P_7>0 && 5+arg5<=arg2 && 5+arg4<=arg2 ], cost: 1
     17: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && 5+3*meter<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 ], cost: 1+meter
     18: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && 5+2*meter_1<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 1+meter_1
     19: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && 5+2*meter_2<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 1+meter_2
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
     15: f804_0_create_GT -> f2072_0_create_GE : arg2'=1, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
     16: f804_0_create_GT -> f2072_0_create_GE : arg2'=arg3P_4, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 && arg5P_6>1 ], cost: 1+arg3P_4
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2>0 && arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>3 ], cost: 1
      2: f1_0_main_Load -> f804_0_create_GT : arg1'=arg1P_3, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2>0 && arg1>0 ], cost: 1
     17: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && 5+3*meter<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 ], cost: 1+meter
     18: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && 5+2*meter_1<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 1+meter_1
     19: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && 5+2*meter_2<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 1+meter_2
      3: f804_0_create_GT -> f2072_0_create_GE : arg2'=0, arg3'=arg3P_4, arg4'=arg2, arg5'=1+arg3, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>-1 ], cost: 1
     15: f804_0_create_GT -> f2072_0_create_GE : arg2'=1, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
     16: f804_0_create_GT -> f2072_0_create_GE : arg2'=arg3P_4, arg3'=arg3P_4, arg4'=arg2, arg5'=arg5P_6, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 && arg5P_6>1 ], cost: 1+arg3P_4
      4: f2072_0_create_GE -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg4, arg3'=arg5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg3>arg2 && arg1>1 && arg3>0 && arg5>1 ], cost: 1
     10: __init -> f1_0_main_Load : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     17: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && 5+3*meter<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 ], cost: 1+meter
     18: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && 5+2*meter_1<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 1+meter_1
     19: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && 5+2*meter_2<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 1+meter_2
     22: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 ], cost: 2
     23: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>1 && arg5P_6>1 ], cost: 3
     24: f804_0_create_GT -> [9] : [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 && arg5P_6>1 ], cost: 1+arg3P_4
     20: __init -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 ], cost: 2
     21: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2

Accelerating simple loops of location 3.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     22: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=1+arg3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 ], cost: 2
     23: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg5P_6>1 ], cost: 3

   Found no metering function for rule 22.
   Accelerated rule 23 with metering function -1+arg1 (after strengthening guard), yielding the new rule 25.
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     17: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && 5+3*meter<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 ], cost: 1+meter
     18: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && 5+2*meter_1<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 1+meter_1
     19: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && 5+2*meter_2<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 1+meter_2
     22: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=1+arg3, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 ], cost: 2
     23: f804_0_create_GT -> f804_0_create_GT : arg1'=-1+arg1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg5P_6>1 ], cost: 3
     24: f804_0_create_GT -> [9] : [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 && arg5P_6>1 ], cost: 1+arg3P_4
     25: f804_0_create_GT -> f804_0_create_GT : arg1'=1, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1>1 && arg3>0 && arg3<arg2 && arg5P_6>1 && arg5P_6<arg2 ], cost: -3+3*arg1
     20: __init -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 ], cost: 2
     21: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     17: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg4'=arg4P_8, arg5'=arg5P_8, [ arg3>1 && 5+3*meter<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1 && arg1P_8<=-2+arg2 ], cost: 1+meter
     18: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg4'=arg4P_9, arg5'=arg5P_9, [ arg3>1 && 5+2*meter_1<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 1+meter_1
     19: f2311_0_getVariables_InvokeMethod -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg4'=arg4P_10, arg5'=arg5P_10, [ arg3>1 && 5+2*meter_2<=arg2 && arg1>0 && arg2>3 && 5+arg5<=arg2 && 5+arg4<=arg2 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 1+meter_2
     24: f804_0_create_GT -> [9] : [ arg1>1 && arg3>0 && arg3<arg2 && arg3P_4>0 && arg5P_6>1 ], cost: 1+arg3P_4
     20: __init -> f2311_0_getVariables_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 ], cost: 2
     21: __init -> f804_0_create_GT : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_3>-1 && arg2P_11>0 && arg1P_11>0 ], cost: 2
     26: __init -> f804_0_create_GT : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=2, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>1 && 1<arg2P_11 ], cost: 4
     27: __init -> f804_0_create_GT : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>1 && 1<arg2P_11 && arg5P_6>1 ], cost: 5
     28: __init -> f804_0_create_GT : arg1'=1, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ arg1P_3>1 && 1<arg2P_11 && arg5P_6>1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+3*meter<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1P_1 && arg1P_8<=-2+arg2P_1 ], cost: 3+meter
     30: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_9, arg5'=arg5P_9, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+2*meter_1<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 3+meter_1
     31: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_10, arg5'=arg5P_10, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+2*meter_2<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 3+meter_2
     32: __init -> [9] : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_11>0 && arg1P_3>1 && 1<arg2P_11 && arg3P_4>0 && arg5P_6>1 ], cost: 3+arg3P_4
     33: __init -> [9] : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=2, arg4'=arg4P_5, arg5'=arg5P_5, [ -1+arg1P_3>1 && 2<arg2P_11 && arg3P_4>0 && arg5P_6>1 ], cost: 5+arg3P_4
     34: __init -> [9] : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ 1<arg2P_11 && arg5P_6>1 && -1+arg1P_3>1 && arg5P_6<arg2P_11 && arg3P_4>0 ], cost: 6+arg3P_4
     35: __init -> [11] : [ arg1P_3>1 && 1<arg2P_11 && arg5P_6>1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     29: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+3*meter<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+3*meter>2 && arg1P_8>0 && meter>=1 && arg1P_8<=1+arg1P_1 && arg1P_8<=-2+arg2P_1 ], cost: 3+meter
     30: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_9, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_9, arg5'=arg5P_9, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+2*meter_1<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+2*meter_1>2 && arg1P_9>0 && meter_1>=1 ], cost: 3+meter_1
     31: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_10, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_10, arg5'=arg5P_10, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg2P_1>3 && arg3P_1>1 && 5+2*meter_2<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+2*meter_2>2 && arg1P_10>2 && meter_2>=1 ], cost: 3+meter_2
     32: __init -> [9] : arg1'=arg1P_3, arg2'=arg2P_11, arg3'=1, arg4'=arg4P_3, arg5'=arg5P_3, [ arg1P_11>0 && arg1P_3>1 && 1<arg2P_11 && arg3P_4>0 && arg5P_6>1 ], cost: 3+arg3P_4
     33: __init -> [9] : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=2, arg4'=arg4P_5, arg5'=arg5P_5, [ -1+arg1P_3>1 && 2<arg2P_11 && arg3P_4>0 && arg5P_6>1 ], cost: 5+arg3P_4
     34: __init -> [9] : arg1'=-1+arg1P_3, arg2'=arg2P_11, arg3'=arg5P_6, arg4'=arg4P_5, arg5'=arg5P_5, [ 1<arg2P_11 && arg5P_6>1 && -1+arg1P_3>1 && arg5P_6<arg2P_11 && arg3P_4>0 ], cost: 6+arg3P_4
     35: __init -> [11] : [ arg1P_3>1 && 1<arg2P_11 && arg5P_6>1 && arg5P_6<arg2P_11 ], cost: -1+3*arg1P_3

Computing asymptotic complexity for rule 29
   Simplified the guard:
     29: __init -> f2992_0_collectVariables_NULL : arg1'=arg1P_8, arg2'=2, arg3'=arg3P_1, arg4'=arg4P_8, arg5'=arg5P_8, [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg3P_1>1 && 5+3*meter<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+3*meter>2 && arg1P_8>0 && arg1P_8<=1+arg1P_1 && arg1P_8<=-2+arg2P_1 ], cost: 3+meter
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      2-arg1P_8+arg1P_1 (+/+!), 3+meter (+), arg1P_11 (+/+!), 3*meter (+/+!), -4-arg4P_1+arg2P_1 (+/+!), 1+arg1P_11-arg1P_1 (+/+!), -4-arg5P_1+arg2P_1 (+/+!), -4-3*meter+arg2P_1 (+/+!), arg1P_8 (+/+!), -1+arg3P_1 (+/+!), arg2P_11 (+/+!), arg1P_1 (+/+!), -1+arg2P_1-arg1P_8 (+/+!) [not solved]

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

      applying transformation rule (C) using substitution {meter==-2+n,arg3P_1==n,arg5P_1==-5+3*n,arg1P_11==1,arg4P_1==-5+3*n,arg2P_1==3*n,arg1P_8==1,arg2P_11==n,arg1P_1==1}
      resulting limit problem:
      [solved]

   Solution:
      meter / -2+n
      arg3P_1 / n
      arg5P_1 / -5+3*n
      arg1P_11 / 1
      arg4P_1 / -5+3*n
      arg2P_1 / 3*n
      arg1P_8 / 1
      arg2P_11 / n
      arg1P_1 / 1
   Resulting cost 1+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 1+n
   Rule cost:   3+meter
   Rule guard:  [ arg2P_11>0 && arg1P_1<=arg1P_11 && arg1P_11>0 && arg1P_1>0 && arg3P_1>1 && 5+3*meter<=arg2P_1 && 5+arg5P_1<=arg2P_1 && 5+arg4P_1<=arg2P_1 && 2+3*meter>2 && arg1P_8>0 && arg1P_8<=1+arg1P_1 && arg1P_8<=-2+arg2P_1 ]

WORST_CASE(INF,?)