NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f55_0_main_GE : arg1'=arg1P_1, [ 0==arg1P_1 ], cost: 1
      1: f55_0_main_GE -> f55_0_main_GE : arg1'=arg1P_2, [ arg1<50 && arg1<100 && 1+arg1==arg1P_2 ], cost: 1
      2: f55_0_main_GE -> f55_0_main_GE : arg1'=arg1P_3, [ arg1>49 && arg1<100 && -1+arg1==arg1P_3 ], cost: 1
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_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, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f55_0_main_GE : arg1'=0, [], cost: 1
      1: f55_0_main_GE -> f55_0_main_GE : arg1'=1+arg1, [ arg1<50 ], cost: 1
      2: f55_0_main_GE -> f55_0_main_GE : arg1'=-1+arg1, [ arg1>49 && arg1<100 ], cost: 1
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f55_0_main_GE -> f55_0_main_GE : arg1'=1+arg1, [ arg1<50 ], cost: 1
      2: f55_0_main_GE -> f55_0_main_GE : arg1'=-1+arg1, [ arg1>49 && arg1<100 ], 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 | 50-arg1>=0, | NONTERM || 3 | ), resulting in the new rules: 6, 7.
   Nested simple loops 1 (outer loop) and 5 (inner loop) with Rule(1 | arg1<100, -49+arg1>=0, | 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 -> f55_0_main_GE : arg1'=0, [], cost: 1
      4: f55_0_main_GE -> f55_0_main_GE : arg1'=50, [ 50-arg1>=0 ], cost: 50-arg1
      5: f55_0_main_GE -> f55_0_main_GE : arg1'=49, [ arg1<100 && -49+arg1>=0 ], cost: -49+arg1
      6: f55_0_main_GE -> [3] : [ 50-arg1>=0 ], cost: NONTERM
      7: f55_0_main_GE -> [3] : [ arg1>49 && 51-arg1>=0 ], cost: NONTERM
      8: f55_0_main_GE -> [3] : [ arg1<100 && -49+arg1>=0 ], cost: NONTERM
      9: f55_0_main_GE -> [3] : [ arg1<50 && -48+arg1>=0 ], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f55_0_main_GE : arg1'=0, [], cost: 1
     10: f1_0_main_ConstantStackPush -> f55_0_main_GE : arg1'=50, [], cost: 51
     11: f1_0_main_ConstantStackPush -> [3] : [], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     11: f1_0_main_ConstantStackPush -> [3] : [], cost: NONTERM
      3: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_4, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     12: __init -> [3] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     12: __init -> [3] : [], cost: NONTERM

Computing asymptotic complexity for rule 12
   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