NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f111_0_fib_EQ : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 && 0==arg2P_1 && 1==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg4>arg3 && arg2>-1 && arg3>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg3==arg2P_2 && arg2+arg3==arg3P_2 && arg4==arg4P_2 ], cost: 1
      2: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg4<arg3 && arg2>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg3==arg2P_3 && arg2+arg3==arg3P_3 && arg4==arg4P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f111_0_fib_EQ : arg1'=arg1P_1, arg2'=0, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_2, arg2'=arg3, arg3'=arg2+arg3, [ arg4>arg3 && arg2>-1 && arg3>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_3, arg2'=arg3, arg3'=arg2+arg3, [ arg4<arg3 && arg2>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_2, arg2'=arg3, arg3'=arg2+arg3, [ arg4>arg3 && arg2>-1 && arg3>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_3, arg2'=arg3, arg3'=arg2+arg3, [ arg4<arg3 && arg2>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1

   Found no closed form for 1.
   Accelerated rule 2 with non-termination, yielding the new rule 4.
[accelerate] Nesting with 0 inner and 1 outer candidates
   Removing the simple loops: 2.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f111_0_fib_EQ : arg1'=arg1P_1, arg2'=0, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f111_0_fib_EQ -> f111_0_fib_EQ : arg1'=arg1P_2, arg2'=arg3, arg3'=arg2+arg3, [ arg4>arg3 && arg2>-1 && arg3>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f111_0_fib_EQ -> [3] : [ arg4<arg3 && arg2>-1 && arg3>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg4<arg2+arg3 && arg2+arg3>0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f111_0_fib_EQ : arg1'=arg1P_1, arg2'=0, arg3'=1, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      5: f1_0_main_Load -> f111_0_fib_EQ : arg1'=arg1P_2, arg2'=1, arg3'=1, arg4'=arg2, [ arg1>0 && arg2>1 && arg1P_2>0 && arg1P_2<=arg1 ], cost: 2
      6: f1_0_main_Load -> [3] : [ -arg2==0 && arg1>0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      6: f1_0_main_Load -> [3] : [ -arg2==0 && arg1>0 ], cost: NONTERM
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      7: __init -> [3] : [ -arg2P_4==0 && arg1P_4>0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
      7: __init -> [3] : [ -arg2P_4==0 && arg1P_4>0 ], cost: NONTERM

Computing asymptotic complexity for rule 7
   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:  [ -arg2P_4==0 && arg1P_4>0 ]

NO