WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f31_0_main_Cmp : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 && arg2==arg1P_1 ], cost: 1
      1: f31_0_main_Cmp -> f43_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1==arg1P_2 && arg1==arg2P_2 && arg1==arg3P_2 ], cost: 1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 && -1+arg1==arg1P_3 ], cost: 1
      3: f43_0_main_GE -> f43_0_main_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg2>0 && arg2<100 && arg2==arg3 && arg1==arg1P_4 && 1+arg2==arg2P_4 && 1+arg2==arg3P_4 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2>0 && arg2<100 && arg2==arg3 && arg2==arg1P_5 && arg2==arg2P_5 && arg2==arg3P_5 ], cost: 1
      5: f64_0_test_LE -> f64_0_test_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg2>0 && arg2==arg3 && arg1==arg1P_6 && -1+arg2==arg2P_6 && -1+arg2==arg3P_6 ], cost: 1
      6: f64_0_test_LE -> f78_0_test_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ 0==arg2 && 0==arg3 && arg1==arg1P_7 && arg1==arg2P_7 && arg1==arg3P_7 ], cost: 1
      7: f78_0_test_LE -> f78_0_test_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg2>0 && arg2==arg3 && arg1==arg1P_8 && -1+arg2==arg2P_8 && -1+arg2==arg3P_8 ], cost: 1
      8: f78_0_test_LE -> f92_0_test_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ 0==arg2 && 0==arg3 && arg1==arg1P_9 && arg1==arg2P_9 && arg1==arg3P_9 ], cost: 1
      9: f92_0_test_LE -> f92_0_test_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [ arg2>0 && arg2==arg3 && arg1==arg1P_10 && -1+arg2==arg2P_10 && -1+arg2==arg3P_10 ], cost: 1
     10: f92_0_test_LE -> f106_0_test_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, [ 0==arg2 && 0==arg3 && arg1==arg1P_11 && arg1==arg2P_11 && arg1==arg3P_11 ], cost: 1
     11: f106_0_test_LE -> f106_0_test_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, [ arg2>0 && arg2==arg3 && arg1==arg1P_12 && -1+arg2==arg2P_12 && -1+arg2==arg3P_12 ], cost: 1
     12: f106_0_test_LE -> f120_0_test_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, [ 0==arg2 && 0==arg3 && arg1==arg1P_13 && arg1==arg2P_13 && arg1==arg3P_13 ], cost: 1
     13: f120_0_test_LE -> f120_0_test_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, [ arg2>0 && arg2==arg3 && arg1==arg1P_14 && -1+arg2==arg2P_14 && -1+arg2==arg3P_14 ], cost: 1
     14: f120_0_test_LE -> f134_0_test_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, [ 0==arg2 && 0==arg3 && arg1==arg1P_15 && arg1==arg2P_15 && arg1==arg3P_15 ], cost: 1
     15: f134_0_test_LE -> f134_0_test_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, [ arg2>0 && arg2==arg3 && arg1==arg1P_16 && -1+arg2==arg2P_16 && -1+arg2==arg3P_16 ], cost: 1
     16: f134_0_test_LE -> f148_0_test_LE : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, [ 0==arg2 && 0==arg3 && arg1==arg1P_17 && arg1==arg2P_17 && arg1==arg3P_17 ], cost: 1
     17: f148_0_test_LE -> f148_0_test_LE : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, [ arg2>0 && arg2==arg3 && arg1==arg1P_18 && -1+arg2==arg2P_18 && -1+arg2==arg3P_18 ], cost: 1
     18: f148_0_test_LE -> f162_0_test_LE : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, [ 0==arg2 && 0==arg3 && arg1==arg1P_19 && arg1==arg2P_19 && arg1==arg3P_19 ], cost: 1
     19: f162_0_test_LE -> f162_0_test_LE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, [ arg2>0 && arg2==arg3 && arg1==arg1P_20 && -1+arg2==arg2P_20 && -1+arg2==arg3P_20 ], cost: 1
     20: f162_0_test_LE -> f176_0_test_LE : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, [ 0==arg2 && 0==arg3 && arg1==arg1P_21 && arg1==arg2P_21 && arg1==arg3P_21 ], cost: 1
     21: f176_0_test_LE -> f176_0_test_LE : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, [ arg2>0 && arg2==arg3 && arg1==arg1P_22 && -1+arg2==arg2P_22 && -1+arg2==arg3P_22 ], cost: 1
     22: f176_0_test_LE -> f190_0_test_LE : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, [ 0==arg2 && 0==arg3 && arg1==arg1P_23 && arg1==arg2P_23 && arg1==arg3P_23 ], cost: 1
     23: f190_0_test_LE -> f190_0_test_LE : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, [ arg2>0 && arg2==arg3 && arg1==arg1P_24 && -1+arg2==arg2P_24 && -1+arg2==arg3P_24 ], cost: 1
     24: f190_0_test_LE -> f204_0_test_LE : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, [ 0==arg2 && 0==arg3 && arg1==arg1P_25 && arg1==arg2P_25 && arg1==arg3P_25 ], cost: 1
     25: f204_0_test_LE -> f204_0_test_LE : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, [ arg2>0 && arg2==arg3 && arg1==arg1P_26 && -1+arg2==arg2P_26 && -1+arg2==arg3P_26 ], cost: 1
     26: f204_0_test_LE -> f218_0_test_LE : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, [ 0==arg2 && 0==arg3 && arg1==arg1P_27 ], cost: 1
     27: f218_0_test_LE -> f218_0_test_LE : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1>0 && -1+arg1==arg1P_28 ], cost: 1
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f31_0_main_Cmp : arg1'=arg2, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f31_0_main_Cmp -> f43_0_main_GE : arg2'=arg1, arg3'=arg1, [], cost: 1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 ], cost: 1
      3: f43_0_main_GE -> f43_0_main_GE : arg2'=1+arg2, arg3'=1+arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg3'=arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
      5: f64_0_test_LE -> f64_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
      6: f64_0_test_LE -> f78_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
      7: f78_0_test_LE -> f78_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
      8: f78_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
      9: f92_0_test_LE -> f92_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     10: f92_0_test_LE -> f106_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     11: f106_0_test_LE -> f106_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     12: f106_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     13: f120_0_test_LE -> f120_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     14: f120_0_test_LE -> f134_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     15: f134_0_test_LE -> f134_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     16: f134_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     17: f148_0_test_LE -> f148_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     18: f148_0_test_LE -> f162_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     19: f162_0_test_LE -> f162_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     20: f162_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     21: f176_0_test_LE -> f176_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     22: f176_0_test_LE -> f190_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     23: f190_0_test_LE -> f190_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     24: f190_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     25: f204_0_test_LE -> f204_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1
     26: f204_0_test_LE -> f218_0_test_LE : arg2'=arg2P_27, arg3'=arg3P_27, [ 0==arg2 && 0==arg3 ], cost: 1
     27: f218_0_test_LE -> f218_0_test_LE : arg1'=-1+arg1, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1>0 ], cost: 1
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f43_0_main_GE -> f43_0_main_GE : arg2'=1+arg2, arg3'=1+arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1

   Accelerated rule 3 with backward acceleration, yielding the new rule 29.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 3.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      5: f64_0_test_LE -> f64_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 5 with backward acceleration, yielding the new rule 30.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 5.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      7: f78_0_test_LE -> f78_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 7 with backward acceleration, yielding the new rule 31.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 7.

Accelerating simple loops of location 5.
   Accelerating the following rules:
      9: f92_0_test_LE -> f92_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 9 with backward acceleration, yielding the new rule 32.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 9.

Accelerating simple loops of location 6.
   Accelerating the following rules:
     11: f106_0_test_LE -> f106_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 11 with backward acceleration, yielding the new rule 33.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 11.

Accelerating simple loops of location 7.
   Accelerating the following rules:
     13: f120_0_test_LE -> f120_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 13 with backward acceleration, yielding the new rule 34.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 13.

Accelerating simple loops of location 8.
   Accelerating the following rules:
     15: f134_0_test_LE -> f134_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 15 with backward acceleration, yielding the new rule 35.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 15.

Accelerating simple loops of location 9.
   Accelerating the following rules:
     17: f148_0_test_LE -> f148_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 17 with backward acceleration, yielding the new rule 36.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 17.

Accelerating simple loops of location 10.
   Accelerating the following rules:
     19: f162_0_test_LE -> f162_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 19 with backward acceleration, yielding the new rule 37.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 19.

Accelerating simple loops of location 11.
   Accelerating the following rules:
     21: f176_0_test_LE -> f176_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 21 with backward acceleration, yielding the new rule 38.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 21.

Accelerating simple loops of location 12.
   Accelerating the following rules:
     23: f190_0_test_LE -> f190_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 23 with backward acceleration, yielding the new rule 39.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 23.

Accelerating simple loops of location 13.
   Accelerating the following rules:
     25: f204_0_test_LE -> f204_0_test_LE : arg2'=-1+arg2, arg3'=-1+arg2, [ arg2>0 && arg2==arg3 ], cost: 1

   Accelerated rule 25 with backward acceleration, yielding the new rule 40.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 25.

Accelerating simple loops of location 14.
   Accelerating the following rules:
     27: f218_0_test_LE -> f218_0_test_LE : arg1'=-1+arg1, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1>0 ], cost: 1

   Accelerated rule 27 with backward acceleration, yielding the new rule 41.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 27.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f31_0_main_Cmp : arg1'=arg2, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f31_0_main_Cmp -> f43_0_main_GE : arg2'=arg1, arg3'=arg1, [], cost: 1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg3'=arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
     29: f43_0_main_GE -> f43_0_main_GE : arg2'=100, arg3'=100, [ arg2>0 && arg2==arg3 && 100-arg2>=1 ], cost: 100-arg2
      6: f64_0_test_LE -> f78_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     30: f64_0_test_LE -> f64_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
      8: f78_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     31: f78_0_test_LE -> f78_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     10: f92_0_test_LE -> f106_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     32: f92_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     12: f106_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     33: f106_0_test_LE -> f106_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     14: f120_0_test_LE -> f134_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     34: f120_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     16: f134_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     35: f134_0_test_LE -> f134_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     18: f148_0_test_LE -> f162_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     36: f148_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     20: f162_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     37: f162_0_test_LE -> f162_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     22: f176_0_test_LE -> f190_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     38: f176_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     24: f190_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     39: f190_0_test_LE -> f190_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     26: f204_0_test_LE -> f218_0_test_LE : arg2'=arg2P_27, arg3'=arg3P_27, [ 0==arg2 && 0==arg3 ], cost: 1
     40: f204_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ arg2==arg3 && arg2>=1 ], cost: arg2
     41: f218_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1>=1 ], cost: arg1
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f31_0_main_Cmp : arg1'=arg2, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f31_0_main_Cmp -> f43_0_main_GE : arg2'=arg1, arg3'=arg1, [], cost: 1
     42: f31_0_main_Cmp -> f43_0_main_GE : arg2'=100, arg3'=100, [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg3'=arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
     43: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg2'=0, arg3'=0, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1+arg2
      6: f64_0_test_LE -> f78_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     44: f64_0_test_LE -> f78_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
      8: f78_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     45: f78_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     10: f92_0_test_LE -> f106_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     46: f92_0_test_LE -> f106_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     12: f106_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     47: f106_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     14: f120_0_test_LE -> f134_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     48: f120_0_test_LE -> f134_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     16: f134_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     49: f134_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     18: f148_0_test_LE -> f162_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     50: f148_0_test_LE -> f162_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     20: f162_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     51: f162_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     22: f176_0_test_LE -> f190_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     52: f176_0_test_LE -> f190_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     24: f190_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     53: f190_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     26: f204_0_test_LE -> f218_0_test_LE : arg2'=arg2P_27, arg3'=arg3P_27, [ 0==arg2 && 0==arg3 ], cost: 1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f31_0_main_Cmp : arg1'=arg2, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f31_0_main_Cmp -> f43_0_main_GE : arg2'=arg1, arg3'=arg1, [], cost: 1
     42: f31_0_main_Cmp -> f43_0_main_GE : arg2'=100, arg3'=100, [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg3'=arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
     43: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg2'=0, arg3'=0, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1+arg2
      6: f64_0_test_LE -> f78_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     44: f64_0_test_LE -> f78_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
      8: f78_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     45: f78_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     10: f92_0_test_LE -> f106_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     46: f92_0_test_LE -> f106_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     12: f106_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     47: f106_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     14: f120_0_test_LE -> f134_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     48: f120_0_test_LE -> f134_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     16: f134_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     49: f134_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     18: f148_0_test_LE -> f162_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     50: f148_0_test_LE -> f162_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     20: f162_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     51: f162_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     22: f176_0_test_LE -> f190_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     52: f176_0_test_LE -> f190_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     24: f190_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     53: f190_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      1: f31_0_main_Cmp -> f43_0_main_GE : arg2'=arg1, arg3'=arg1, [], cost: 1
     42: f31_0_main_Cmp -> f43_0_main_GE : arg2'=100, arg3'=100, [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
      2: f43_0_main_GE -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg2>99 && arg2==arg3 ], cost: 1
      4: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg3'=arg2, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1
     43: f43_0_main_GE -> f64_0_test_LE : arg1'=arg2, arg2'=0, arg3'=0, [ arg2>0 && arg2<100 && arg2==arg3 ], cost: 1+arg2
      6: f64_0_test_LE -> f78_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     44: f64_0_test_LE -> f78_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
      8: f78_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     45: f78_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     10: f92_0_test_LE -> f106_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     46: f92_0_test_LE -> f106_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     12: f106_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     47: f106_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     14: f120_0_test_LE -> f134_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     48: f120_0_test_LE -> f134_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     16: f134_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     49: f134_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     18: f148_0_test_LE -> f162_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     50: f148_0_test_LE -> f162_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     20: f162_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     51: f162_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     22: f176_0_test_LE -> f190_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     52: f176_0_test_LE -> f190_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     24: f190_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 ], cost: 1
     53: f190_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     55: __init -> f31_0_main_Cmp : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     56: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>99 ], cost: 2
     57: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=arg1, arg3'=arg1, [ arg1>0 && arg1<100 ], cost: 2
     58: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=0, arg3'=0, [ arg1>0 && arg1<100 ], cost: 2+arg1
     59: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && 100-arg1>=1 ], cost: 102-arg1
     60: f31_0_main_Cmp -> [29] : [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
     61: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     62: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     63: f64_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     64: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     65: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     66: f92_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     67: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     68: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     69: f120_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     70: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     71: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     72: f148_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     73: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     74: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     75: f176_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     55: __init -> f31_0_main_Cmp : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     56: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>99 ], cost: 2
     59: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=-1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && 100-arg1>=1 ], cost: 102-arg1

   Accelerated rule 56 with backward acceleration, yielding the new rule 76.
   Accelerated rule 59 with backward acceleration, yielding the new rule 77.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 56 59.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     57: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=arg1, arg3'=arg1, [ arg1>0 && arg1<100 ], cost: 2
     58: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=0, arg3'=0, [ arg1>0 && arg1<100 ], cost: 2+arg1
     60: f31_0_main_Cmp -> [29] : [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
     76: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg1>=1 ], cost: -198+2*arg1
     77: f31_0_main_Cmp -> f31_0_main_Cmp : arg1'=0, arg2'=arg2P_3, arg3'=arg3P_3, [ 100-arg1>=1 && arg1>=1 ], cost: -1/2*arg1^2+203/2*arg1
     61: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     62: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     63: f64_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     64: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     65: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     66: f92_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     67: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     68: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     69: f120_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     70: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     71: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     72: f148_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     73: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     74: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     75: f176_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     55: __init -> f31_0_main_Cmp : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     57: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=arg1, arg3'=arg1, [ arg1>0 && arg1<100 ], cost: 2
     58: f31_0_main_Cmp -> f64_0_test_LE : arg1'=arg1, arg2'=0, arg3'=0, [ arg1>0 && arg1<100 ], cost: 2+arg1
     60: f31_0_main_Cmp -> [29] : [ arg1>0 && 100-arg1>=1 ], cost: 101-arg1
     61: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     62: f64_0_test_LE -> f92_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     63: f64_0_test_LE -> f92_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     64: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     65: f92_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     66: f92_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     67: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     68: f120_0_test_LE -> f148_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     69: f120_0_test_LE -> f148_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     70: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     71: f148_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     72: f148_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     73: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 2
     74: f176_0_test_LE -> f204_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     75: f176_0_test_LE -> f204_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     54: f204_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 1+arg1
     55: __init -> f31_0_main_Cmp : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2
     78: __init -> f31_0_main_Cmp : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg2P_29>=1 ], cost: -196+2*arg2P_29
     79: __init -> f31_0_main_Cmp : arg1'=0, arg2'=arg2P_3, arg3'=arg3P_3, [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     87: f64_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 4
     88: f64_0_test_LE -> f120_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+3*arg1
     89: f64_0_test_LE -> f120_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+4*arg1
     90: f64_0_test_LE -> [32] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     91: f64_0_test_LE -> [32] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     92: f120_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && 0==arg1 ], cost: 4
     93: f120_0_test_LE -> f176_0_test_LE : arg2'=arg1, arg3'=arg1, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+3*arg1
     94: f120_0_test_LE -> f176_0_test_LE : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+4*arg1
     95: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     96: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
     97: f176_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 3+3*arg1
     98: f176_0_test_LE -> [34] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     80: __init -> f64_0_test_LE : arg1'=arg2P_29, arg2'=arg2P_29, arg3'=arg2P_29, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4
     81: __init -> f64_0_test_LE : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4+arg2P_29
     82: __init -> [29] : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>0 && 100-arg2P_29>=1 ], cost: 103-arg2P_29
     83: __init -> f64_0_test_LE : arg1'=99, arg2'=99, arg3'=99, [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
     84: __init -> f64_0_test_LE : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: -95+2*arg2P_29
     85: __init -> [29] : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
     86: __init -> [31] : [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     95: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     96: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
    110: f120_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 7+7*arg1
    111: f120_0_test_LE -> [34] : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 6+5*arg1
    112: f120_0_test_LE -> [36] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+3*arg1
     82: __init -> [29] : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>0 && 100-arg2P_29>=1 ], cost: 103-arg2P_29
     85: __init -> [29] : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
     86: __init -> [31] : [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2
     99: __init -> f120_0_test_LE : arg1'=arg2P_29, arg2'=arg2P_29, arg3'=arg2P_29, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+4*arg2P_29
    100: __init -> f120_0_test_LE : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+5*arg2P_29
    101: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+2*arg2P_29
    102: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+3*arg2P_29
    103: __init -> f120_0_test_LE : arg1'=99, arg2'=99, arg3'=99, [ -99+arg2P_29>=1 ], cost: 206+2*arg2P_29
    104: __init -> f120_0_test_LE : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 305+2*arg2P_29
    105: __init -> [32] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 6+2*arg2P_29
    106: __init -> [32] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 105+2*arg2P_29
    107: __init -> [35] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4+arg2P_29
    108: __init -> [35] : [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
    109: __init -> [35] : [ -99+arg2P_29>=1 ], cost: -95+2*arg2P_29

Merged rules:
   Start location: __init
     95: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+arg1
     96: f120_0_test_LE -> [33] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 2+2*arg1
    110: f120_0_test_LE -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 7+7*arg1
    111: f120_0_test_LE -> [34] : arg2'=0, arg3'=0, [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 6+5*arg1
    112: f120_0_test_LE -> [36] : [ 0==arg2 && 0==arg3 && arg1>=1 ], cost: 4+3*arg1
     82: __init -> [29] : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>0 && 100-arg2P_29>=1 ], cost: 103-arg2P_29
     85: __init -> [29] : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
     86: __init -> [31] : [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2
     99: __init -> f120_0_test_LE : arg1'=arg2P_29, arg2'=arg2P_29, arg3'=arg2P_29, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+4*arg2P_29
    100: __init -> f120_0_test_LE : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+5*arg2P_29
    101: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+2*arg2P_29
    102: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+3*arg2P_29
    103: __init -> f120_0_test_LE : arg1'=99, arg2'=99, arg3'=99, [ -99+arg2P_29>=1 ], cost: 206+2*arg2P_29
    104: __init -> f120_0_test_LE : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 305+2*arg2P_29
    107: __init -> [35] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4+arg2P_29
    113: __init -> [32] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 105+2*arg2P_29
    114: __init -> [35] : [ -99+arg2P_29>=1 ], cost: -95+2*arg2P_29

Eliminated locations (on tree-shaped paths):
   Start location: __init
     82: __init -> [29] : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>0 && 100-arg2P_29>=1 ], cost: 103-arg2P_29
     85: __init -> [29] : arg1'=99, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg2P_29>=1 ], cost: -194+2*arg2P_29
     86: __init -> [31] : [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2
    101: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+2*arg2P_29
    102: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+3*arg2P_29
    107: __init -> [35] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4+arg2P_29
    113: __init -> [32] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 105+2*arg2P_29
    114: __init -> [35] : [ -99+arg2P_29>=1 ], cost: -95+2*arg2P_29
    115: __init -> [33] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 10+6*arg2P_29
    116: __init -> [33] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 10+7*arg2P_29
    117: __init -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 15+12*arg2P_29
    118: __init -> [34] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 14+10*arg2P_29
    119: __init -> [36] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 12+8*arg2P_29
    120: __init -> [33] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 406+2*arg2P_29
    121: __init -> [33] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 505+2*arg2P_29
    122: __init -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ -99+arg2P_29>=1 ], cost: 1005+2*arg2P_29
    123: __init -> [34] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 806+2*arg2P_29
    124: __init -> [36] : arg1'=99, arg2'=0, arg3'=0, [ -99+arg2P_29>=1 ], cost: 606+2*arg2P_29
    125: __init -> [37] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+4*arg2P_29
    126: __init -> [37] : [ -99+arg2P_29>=1 ], cost: 206+2*arg2P_29

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     82: __init -> [29] : arg1'=arg2P_29, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_29>0 && arg2P_29>0 && 100-arg2P_29>=1 ], cost: 103-arg2P_29
     86: __init -> [31] : [ 100-arg2P_29>=1 && arg2P_29>=1 ], cost: 2+203/2*arg2P_29-1/2*arg2P_29^2
    101: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+2*arg2P_29
    102: __init -> [32] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 6+3*arg2P_29
    107: __init -> [35] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 4+arg2P_29
    115: __init -> [33] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 10+6*arg2P_29
    116: __init -> [33] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 10+7*arg2P_29
    117: __init -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 15+12*arg2P_29
    118: __init -> [34] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 14+10*arg2P_29
    119: __init -> [36] : arg1'=arg2P_29, arg2'=0, arg3'=0, [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 12+8*arg2P_29
    122: __init -> f218_0_test_LE : arg1'=0, arg2'=arg2P_28, arg3'=arg3P_28, [ -99+arg2P_29>=1 ], cost: 1005+2*arg2P_29
    125: __init -> [37] : [ arg1P_29>0 && arg2P_29>0 && arg2P_29<100 ], cost: 8+4*arg2P_29

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

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

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

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

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

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

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

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

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

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

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

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

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)