NO

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

Initial linear ITS problem
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      9: f2 -> f3 : arg1'=arg1P_10, [ arg1<0 && arg1==arg1P_10 ], cost: 1
     10: f2 -> f3 : arg1'=arg1P_11, [ arg1>0 && arg1==arg1P_11 ], cost: 1
     12: f2 -> f11 : arg1'=arg1P_13, [ arg1==0 && arg1==arg1P_13 ], cost: 1
      1: f4 -> f7 : arg1'=arg1P_2, [ arg1P_2==-1+arg1 ], cost: 1
      2: f7 -> f8 : arg1'=arg1P_3, [ arg1P_3==-arg1 ], cost: 1
      7: f8 -> f6 : arg1'=arg1P_8, [ arg1==arg1P_8 ], cost: 1
      3: f5 -> f9 : arg1'=arg1P_4, [ arg1P_4==1+arg1 ], cost: 1
      4: f9 -> f10 : arg1'=arg1P_5, [ arg1P_5==-arg1 ], cost: 1
      8: f10 -> f6 : arg1'=arg1P_9, [ arg1==arg1P_9 ], cost: 1
      5: f3 -> f4 : arg1'=arg1P_6, [ arg1<0 && arg1==arg1P_6 ], cost: 1
      6: f3 -> f5 : arg1'=arg1P_7, [ arg1>=0 && arg1==arg1P_7 ], cost: 1
     11: f6 -> f2 : arg1'=arg1P_12, [ arg1==arg1P_12 ], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     13: __init -> f1 : arg1'=arg1P_14, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      9: f2 -> f3 : arg1'=arg1P_10, [ arg1<0 && arg1==arg1P_10 ], cost: 1
     10: f2 -> f3 : arg1'=arg1P_11, [ arg1>0 && arg1==arg1P_11 ], cost: 1
      1: f4 -> f7 : arg1'=arg1P_2, [ arg1P_2==-1+arg1 ], cost: 1
      2: f7 -> f8 : arg1'=arg1P_3, [ arg1P_3==-arg1 ], cost: 1
      7: f8 -> f6 : arg1'=arg1P_8, [ arg1==arg1P_8 ], cost: 1
      3: f5 -> f9 : arg1'=arg1P_4, [ arg1P_4==1+arg1 ], cost: 1
      4: f9 -> f10 : arg1'=arg1P_5, [ arg1P_5==-arg1 ], cost: 1
      8: f10 -> f6 : arg1'=arg1P_9, [ arg1==arg1P_9 ], cost: 1
      5: f3 -> f4 : arg1'=arg1P_6, [ arg1<0 && arg1==arg1P_6 ], cost: 1
      6: f3 -> f5 : arg1'=arg1P_7, [ arg1>=0 && arg1==arg1P_7 ], cost: 1
     11: f6 -> f2 : arg1'=arg1P_12, [ arg1==arg1P_12 ], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1 -> f2 : arg1'=arg1P_1, [], cost: 1
      9: f2 -> f3 : [ arg1<0 ], cost: 1
     10: f2 -> f3 : [ arg1>0 ], cost: 1
      1: f4 -> f7 : arg1'=-1+arg1, [], cost: 1
      2: f7 -> f8 : arg1'=-arg1, [], cost: 1
      7: f8 -> f6 : [], cost: 1
      3: f5 -> f9 : arg1'=1+arg1, [], cost: 1
      4: f9 -> f10 : arg1'=-arg1, [], cost: 1
      8: f10 -> f6 : [], cost: 1
      5: f3 -> f4 : [ arg1<0 ], cost: 1
      6: f3 -> f5 : [ arg1>=0 ], cost: 1
     11: f6 -> f2 : [], cost: 1
     13: __init -> f1 : arg1'=arg1P_14, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      9: f2 -> f3 : [ arg1<0 ], cost: 1
     10: f2 -> f3 : [ arg1>0 ], cost: 1
     19: f3 -> f6 : arg1'=1-arg1, [ arg1<0 ], cost: 4
     20: f3 -> f6 : arg1'=-1-arg1, [ arg1>=0 ], cost: 4
     11: f6 -> f2 : [], cost: 1
     14: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     21: f2 -> f6 : arg1'=1-arg1, [ arg1<0 ], cost: 5
     22: f2 -> f6 : arg1'=-1-arg1, [ arg1>0 ], cost: 5
     11: f6 -> f2 : [], cost: 1
     14: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     23: f2 -> f2 : arg1'=1-arg1, [ arg1<0 ], cost: 6
     24: f2 -> f2 : arg1'=-1-arg1, [ arg1>0 ], cost: 6
     14: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     23: f2 -> f2 : arg1'=1-arg1, [ arg1<0 ], cost: 6
     24: f2 -> f2 : arg1'=-1-arg1, [ arg1>0 ], cost: 6

   Failed to prove monotonicity of the guard of rule 23.
   Failed to prove monotonicity of the guard of rule 24.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 24 (outer loop) and 23 (inner loop) with Rule(1 | arg1<0, | NONTERM || 12 | ), resulting in the new rules: 25, 26.
   Nested simple loops 23 (outer loop) and 24 (inner loop) with Rule(1 | arg1>0, | NONTERM || 12 | ), resulting in the new rules: 27, 28.
   Removing the simple loops: 23 24.
   Also removing duplicate rules: 25 26.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     27: f2 -> [12] : [ arg1>0 ], cost: NONTERM
     28: f2 -> [12] : [ arg1<0 ], cost: NONTERM
     14: __init -> f2 : arg1'=arg1P_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     14: __init -> f2 : arg1'=arg1P_1, [], cost: 2
     29: __init -> [12] : [], cost: NONTERM
     30: __init -> [12] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     29: __init -> [12] : [], cost: NONTERM
     30: __init -> [12] : [], cost: NONTERM

### Computing asymptotic complexity ###

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

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