NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=arg1P_1, arg2'=arg2P_1, [ 0==arg1P_1 && 100==arg2P_1 ], cost: 1
      1: f79_0_main_GE -> f79_0_main_GE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg2<52 && arg2>arg1 && -1+arg1==arg1P_2 && 1+arg2==arg2P_2 ], cost: 1
      2: f79_0_main_GE -> f79_0_main_GE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>51 && arg2>arg1 && 1+arg1==arg1P_3 && -1+arg2==arg2P_3 ], cost: 1
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=0, arg2'=100, [], cost: 1
      1: f79_0_main_GE -> f79_0_main_GE : arg1'=-1+arg1, arg2'=1+arg2, [ arg2<52 && arg2>arg1 ], cost: 1
      2: f79_0_main_GE -> f79_0_main_GE : arg1'=1+arg1, arg2'=-1+arg2, [ arg2>51 && arg2>arg1 ], cost: 1
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f79_0_main_GE -> f79_0_main_GE : arg1'=-1+arg1, arg2'=1+arg2, [ arg2<52 && arg2>arg1 ], cost: 1
      2: f79_0_main_GE -> f79_0_main_GE : arg1'=1+arg1, arg2'=-1+arg2, [ arg2>51 && arg2>arg1 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 4.
   Accelerated rule 2 with backward acceleration, yielding the new rule 5.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 2 (outer loop) and 4 (inner loop) with Rule(1 | arg2>51, 53-arg2>=0, k_2>=1, 51>1+arg1, | 2*k_2 || 1 | 0=arg1, 1=52, ), resulting in the new rules: 6, 7.
   Nested simple loops 1 (outer loop) and 5 (inner loop) with Rule(1 | -51+arg2>=0, 51>-51+arg2+arg1, | NONTERM || 3 | ), resulting in the new rules: 8, 9.
   Removing the simple loops: 1 2.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=0, arg2'=100, [], cost: 1
      4: f79_0_main_GE -> f79_0_main_GE : arg1'=-52+arg2+arg1, arg2'=52, [ arg2>arg1 && 52-arg2>=0 ], cost: 52-arg2
      5: f79_0_main_GE -> f79_0_main_GE : arg1'=k_1+arg1, arg2'=arg2-k_1, [ k_1>=0 && 1+arg2-k_1>51 && 1+arg2-k_1>-1+k_1+arg1 ], cost: k_1
      6: f79_0_main_GE -> f79_0_main_GE : arg1'=arg1, arg2'=52, [ arg2>51 && 53-arg2>=0 && k_2>=1 && 51>1+arg1 ], cost: 2*k_2
      7: f79_0_main_GE -> f79_0_main_GE : arg1'=-52+arg2+arg1, arg2'=52, [ arg2>arg1 && 52-arg2>=0 && k_2>=1 && 51>-51+arg2+arg1 ], cost: 52-arg2+2*k_2
      8: f79_0_main_GE -> [3] : [ -51+arg2>=0 && 51>-51+arg2+arg1 ], cost: NONTERM
      9: f79_0_main_GE -> [3] : [ arg2<52 && arg2>arg1 && -50+arg2>=0 && 51>-51+arg2+arg1 ], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=0, arg2'=100, [], cost: 1
     10: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=k_1, arg2'=100-k_1, [ k_1>=0 && 101-k_1>51 && 101-k_1>-1+k_1 ], cost: 1+k_1
     11: f1_0_main_ConstantStackPush -> [3] : [], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     10: f1_0_main_ConstantStackPush -> f79_0_main_GE : arg1'=k_1, arg2'=100-k_1, [ k_1>=0 && 101-k_1>51 && 101-k_1>-1+k_1 ], cost: 1+k_1
     11: f1_0_main_ConstantStackPush -> [3] : [], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     12: __init -> f79_0_main_GE : arg1'=k_1, arg2'=100-k_1, [ k_1>=0 && 101-k_1>51 && 101-k_1>-1+k_1 ], cost: 2+k_1
     13: __init -> [3] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     12: __init -> f79_0_main_GE : arg1'=k_1, arg2'=100-k_1, [ k_1>=0 && 101-k_1>51 && 101-k_1>-1+k_1 ], cost: 2+k_1
     13: __init -> [3] : [], cost: NONTERM

Computing asymptotic complexity for rule 13
   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:  []

NO