WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f265_0_createMetaList_Return -> f724_0_countMetaList_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>-1 && arg1P_1>-1 ], cost: 1
      2: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 2+arg1P_3<=arg1 && arg1>2 && arg1P_3>-1 ], cost: 1
      3: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg1P_5 && arg1>2 && arg1P_5>0 ], cost: 1
      1: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 && 0==arg1P_6 && 1==arg3P_6 ], cost: 1
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3P_7>-1 && arg2>arg1 && arg3>0 && arg2==arg1P_7 && arg1==arg2P_7 && 1+arg3==arg4P_7 ], cost: 1
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 0==arg3 && 1+arg2==arg1P_8 && arg1==arg2P_8 && arg4==arg3P_8 ], cost: 1
      8: f932_0_createMetaList_LE -> f932_0_createMetaList_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg3>0 && arg1==arg1P_9 && arg2==arg2P_9 && -1+arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      2: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 2+arg1P_3<=arg1 && arg1>2 && arg1P_3>-1 ], cost: 1
      3: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg1P_5 && arg1>2 && arg1P_5>0 ], cost: 1
      1: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 && 0==arg1P_6 && 1==arg3P_6 ], cost: 1
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3P_7>-1 && arg2>arg1 && arg3>0 && arg2==arg1P_7 && arg1==arg2P_7 && 1+arg3==arg4P_7 ], cost: 1
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 0==arg3 && 1+arg2==arg1P_8 && arg1==arg2P_8 && arg4==arg3P_8 ], cost: 1
      8: f932_0_createMetaList_LE -> f932_0_createMetaList_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg3>0 && arg1==arg1P_9 && arg2==arg2P_9 && -1+arg3==arg3P_9 && arg4==arg4P_9 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      2: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 2+arg1P_3<=arg1 && arg1>2 && arg1P_3>-1 ], cost: 1
      3: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg1P_5 && arg1>2 && arg1P_5>0 ], cost: 1
      1: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 ], cost: 1
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_7, arg4'=1+arg3, [ arg3P_7>-1 && arg2>arg1 && arg3>0 ], cost: 1
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_8, [ 0==arg3 ], cost: 1
      8: f932_0_createMetaList_LE -> f932_0_createMetaList_LE : arg3'=-1+arg3, [ arg3>0 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ 2+arg1P_3<=arg1 && arg1>2 && arg1P_3>-1 ], cost: 1
      3: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg1P_5 && arg1>2 && arg1P_5>0 ], cost: 1

      During metering: Instantiating temporary variables by {arg1P_3==-2+arg1}
   Accelerated rule 2 with metering function meter (where 2*meter==-2+arg1), yielding the new rule 10.
      During metering: Instantiating temporary variables by {arg1P_4==-2+arg1}
   Accelerated rule 3 with metering function meter_1 (where 2*meter_1==-1+arg1), yielding the new rule 11.
   Accelerated rule 4 with NONTERM (after strengthening guard), yielding the new rule 12.
   Nested simple loops 3 (outer loop) and 10 (inner loop) with metering function -arg1P_4, resulting in the new rules: 13.
   Removing the simple loops: 2 3.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f932_0_createMetaList_LE -> f932_0_createMetaList_LE : arg3'=-1+arg3, [ arg3>0 ], cost: 1

   Accelerated rule 8 with metering function arg3, yielding the new rule 14.
   Removing the simple loops: 8.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      4: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>=arg1P_5 && arg1>2 && arg1P_5>0 ], cost: 1
     10: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1-2*meter, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>2 && 2*meter==-2+arg1 && meter>=1 ], cost: meter
     11: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=-2*meter_1+arg1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>1 && 2*meter_1==-1+arg1 && meter_1>=1 ], cost: meter_1
     12: f724_0_countMetaList_NULL -> [6] : [ arg1>=arg1P_5 && arg1>2 && arg1P_5>2 ], cost: NONTERM
     13: f724_0_countMetaList_NULL -> f724_0_countMetaList_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>2 && 2*meter==-2+arg1 && meter>=1 && 2+arg1P_4<=arg1-2*meter && arg1P_4>-1 && -arg1P_4>=1 ], cost: -arg1P_4-meter*arg1P_4
      1: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 ], cost: 1
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_7, arg4'=1+arg3, [ arg3P_7>-1 && arg2>arg1 && arg3>0 ], cost: 1
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_8, [ 0==arg3 ], cost: 1
     14: f932_0_createMetaList_LE -> f932_0_createMetaList_LE : arg3'=0, [ arg3>0 ], cost: arg3
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      1: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 ], cost: 1
     15: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1>0 && arg1P_5>0 ], cost: 2
     16: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>0 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     17: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 1+meter_1
     18: f1_0_main_Load -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>2 ], cost: NONTERM
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_7, arg4'=1+arg3, [ arg3P_7>-1 && arg2>arg1 && arg3>0 ], cost: 1
     19: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=0, arg4'=1+arg3, [ arg2>arg1 && arg3>0 && arg3P_7>0 ], cost: 1+arg3P_7
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_8, [ 0==arg3 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      5: f1_0_main_Load -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2>-1 && arg2P_6>-1 && arg1>0 ], cost: 1
     16: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>0 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     17: f1_0_main_Load -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 1+meter_1
     18: f1_0_main_Load -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg1P_2>2 ], cost: NONTERM
      6: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=arg3P_7, arg4'=1+arg3, [ arg3P_7>-1 && arg2>arg1 && arg3>0 ], cost: 1
     19: f693_0_createMetaList_GE -> f932_0_createMetaList_LE : arg1'=arg2, arg2'=arg1, arg3'=0, arg4'=1+arg3, [ arg2>arg1 && arg3>0 && arg3P_7>0 ], cost: 1+arg3P_7
      7: f932_0_createMetaList_LE -> f693_0_createMetaList_GE : arg1'=1+arg2, arg2'=arg1, arg3'=arg4, arg4'=arg4P_8, [ 0==arg3 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     24: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 && 0==arg3P_7 ], cost: 2
     25: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 && arg3P_7>0 ], cost: 2+arg3P_7
     20: __init -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2P_10>-1 && arg2P_6>-1 && arg1P_10>0 ], cost: 2
     21: __init -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_10>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     22: __init -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_10>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 2+meter_1
     23: __init -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_10>0 && arg1P_2>2 ], cost: NONTERM

Accelerating simple loops of location 3.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     24: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=1+arg1, arg3'=1+arg3, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 ], cost: 2
     25: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=1+arg1, arg3'=1+arg3, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 && arg3P_7>0 ], cost: 2+arg3P_7

   Accelerated rule 24 with metering function -arg1+arg2, yielding the new rule 26.
   Accelerated rule 25 with metering function -arg1+arg2, yielding the new rule 27.
   Removing the simple loops: 24 25.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     26: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=arg2, arg3'=arg3-arg1+arg2, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 ], cost: -2*arg1+2*arg2
     27: f693_0_createMetaList_GE -> f693_0_createMetaList_GE : arg1'=arg2, arg3'=arg3-arg1+arg2, arg4'=arg4P_8, [ arg2>arg1 && arg3>0 && arg3P_7>0 ], cost: -2*arg1-arg3P_7*(arg1-arg2)+2*arg2
     20: __init -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2P_10>-1 && arg2P_6>-1 && arg1P_10>0 ], cost: 2
     21: __init -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_10>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     22: __init -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_10>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 2+meter_1
     23: __init -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_10>0 && arg1P_2>2 ], cost: NONTERM

Chained accelerated rules (with incoming rules):
   Start location: __init
     20: __init -> f693_0_createMetaList_GE : arg1'=0, arg2'=arg2P_6, arg3'=1, arg4'=arg4P_6, [ arg2P_10>-1 && arg2P_6>-1 && arg1P_10>0 ], cost: 2
     21: __init -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_10>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     22: __init -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_10>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 2+meter_1
     23: __init -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_10>0 && arg1P_2>2 ], cost: NONTERM
     28: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 ], cost: 2+2*arg2P_6
     29: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 && arg3P_7>0 ], cost: 2+arg2P_6*arg3P_7+2*arg2P_6

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     21: __init -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_10>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     22: __init -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_10>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 2+meter_1
     23: __init -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_10>0 && arg1P_2>2 ], cost: NONTERM
     28: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 ], cost: 2+2*arg2P_6
     29: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 && arg3P_7>0 ], cost: 2+arg2P_6*arg3P_7+2*arg2P_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     21: __init -> f724_0_countMetaList_NULL : arg1'=2, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_10>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     22: __init -> f724_0_countMetaList_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_10>0 && 1+2*meter_1>1 && meter_1>=1 ], cost: 2+meter_1
     23: __init -> [6] : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_10>0 && arg1P_2>2 ], cost: NONTERM
     28: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 ], cost: 2+2*arg2P_6
     29: __init -> f693_0_createMetaList_GE : arg1'=arg2P_6, arg2'=arg2P_6, arg3'=1+arg2P_6, arg4'=arg4P_8, [ arg2P_6>0 && arg3P_7>0 ], cost: 2+arg2P_6*arg3P_7+2*arg2P_6

Computing asymptotic complexity for rule 21
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg1P_10 (+/+!), 2+meter (+), 2*meter (+/+!) [not solved]

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

      applying transformation rule (C) using substitution {arg1P_10==1,meter==n}
      resulting limit problem:
      [solved]

   Solution:
      arg1P_10 / 1
      meter / n
   Resulting cost 2+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 2+n
   Rule cost:   2+meter
   Rule guard:  [ arg1P_10>0 && 2+2*meter>2 ]

WORST_CASE(INF,?)