YES(?,O(n^1))
* Step 1: ArgumentFilter WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F) -> f4(A,B,C,D,E,H)                [B >= 1 && 0 >= A] (?,1)
          1. f2(A,B,C,D,E,F) -> f4(A,G,C,D,E,H)                [0 >= B && 0 >= G] (?,1)
          2. f3(A,B,C,D,E,F) -> f2(A,B,C,D,E,F)                True               (1,1)
          3. f2(A,B,C,D,E,F) -> f2(-1 + A,-1 + B,A,B,-2 + A,F) [A >= 1 && B >= 1] (?,1)
        Signature:
          {(f2,6);(f3,6);(f4,6)}
        Flow Graph:
          [0->{},1->{},2->{0,1,3},3->{0,1,3}]
        
    + Applied Processor:
        ArgumentFilter [2,3,4,5]
    + Details:
        We remove following argument positions: [2,3,4,5].
* Step 2: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f4(A,B)           [B >= 1 && 0 >= A] (?,1)
          1. f2(A,B) -> f4(A,G)           [0 >= B && 0 >= G] (?,1)
          2. f3(A,B) -> f2(A,B)           True               (1,1)
          3. f2(A,B) -> f2(-1 + A,-1 + B) [A >= 1 && B >= 1] (?,1)
        Signature:
          {(f2,6);(f3,6);(f4,6)}
        Flow Graph:
          [0->{},1->{},2->{0,1,3},3->{0,1,3}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f2(A,B) -> f4(A,B)            [B >= 1 && 0 >= A]
          f2(A,B) -> f4(A,G)            [0 >= B && 0 >= G]
          f3(A,B) -> f2(A,B)            True
          f2(A,B) -> f2(-1 + A,-1 + B)  [A >= 1 && B >= 1]
        Signature:
          {(f2,6);(f3,6);(f4,6)}
        Rule Graph:
          [0->{},1->{},2->{0,1,3},3->{0,1,3}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f2(A,B) -> f4(A,B)            [B >= 1 && 0 >= A]
          f2(A,B) -> f4(A,G)            [0 >= B && 0 >= G]
          f3(A,B) -> f2(A,B)            True
          f2(A,B) -> f2(-1 + A,-1 + B)  [A >= 1 && B >= 1]
          f4(A,B) -> exitus616(A,B)     True
          f4(A,B) -> exitus616(A,B)     True
        Signature:
          {(exitus616,2);(f2,6);(f3,6);(f4,6)}
        Rule Graph:
          [0->{5},1->{4},2->{0,1,3},3->{0,1,3}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[3] c: [3]
* Step 5: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          f2(A,B) -> f4(A,B)            [B >= 1 && 0 >= A]
          f2(A,B) -> f4(A,G)            [0 >= B && 0 >= G]
          f3(A,B) -> f2(A,B)            True
          f2(A,B) -> f2(-1 + A,-1 + B)  [A >= 1 && B >= 1]
          f4(A,B) -> exitus616(A,B)     True
          f4(A,B) -> exitus616(A,B)     True
        Signature:
          {(exitus616,2);(f2,6);(f3,6);(f4,6)}
        Rule Graph:
          [0->{5},1->{4},2->{0,1,3},3->{0,1,3}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[3] c: [3])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 6: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f2  ~>  f4          [A <= A, B <= B]
           f2  ~>  f4          [A <= A, B <= unknown]
           f3  ~>  f2          [A <= A, B <= B]
           f2  ~>  f2          [A <= A, B <= B]
           f4  ~>  exitus616   [A <= A, B <= B]
           f4  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= K + B]
               f2  ~>  f2   [A <= A, B <= B]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 7: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f2  ~>  f4          []
           f2  ~>  f4          [huge ~=> B]
           f3  ~>  f2          []
           f2  ~>  f2          []
           f4  ~>  exitus616   []
           f4  ~>  exitus616   []
          + Loop: [B ~+> 0.0,K ~+> 0.0]
               f2  ~>  f2   []
    + Applied Processor:
        Lare
    + Details:
         f3  ~>  exitus616   [huge ~=> B,B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick]
        + <f2  ~>  f2>  [B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick]

YES(?,O(n^1))