YES(?,POLY)
* Step 1: UnsatPaths WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f4(A,1 + B,C) [A >= 1 + B]           (?,1)
          1. f4(A,B,C) -> f4(1 + A,0,C) [C >= 2 + A && B >= A] (?,1)
          2. f0(A,B,C) -> f4(0,0,C)     [C >= 1]               (1,1)
        Signature:
          {(f0,3);(f4,3)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,0)]
* Step 2: AddSinks WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f4(A,1 + B,C) [A >= 1 + B]           (?,1)
          1. f4(A,B,C) -> f4(1 + A,0,C) [C >= 2 + A && B >= A] (?,1)
          2. f0(A,B,C) -> f4(0,0,C)     [C >= 1]               (1,1)
        Signature:
          {(f0,3);(f4,3)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{1}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: UnsatPaths WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f4(A,1 + B,C)    [A >= 1 + B]           (?,1)
          1. f4(A,B,C) -> f4(1 + A,0,C)    [C >= 2 + A && B >= A] (?,1)
          2. f0(A,B,C) -> f4(0,0,C)        [C >= 1]               (1,1)
          3. f4(A,B,C) -> exitus616(A,B,C) True                   (?,1)
        Signature:
          {(exitus616,3);(f0,3);(f4,3)}
        Flow Graph:
          [0->{0,1,3},1->{0,1,3},2->{0,1,3},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,0)]
* Step 4: LooptreeTransformer WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f4(A,1 + B,C)    [A >= 1 + B]           (?,1)
          1. f4(A,B,C) -> f4(1 + A,0,C)    [C >= 2 + A && B >= A] (?,1)
          2. f0(A,B,C) -> f4(0,0,C)        [C >= 1]               (1,1)
          3. f4(A,B,C) -> exitus616(A,B,C) True                   (?,1)
        Signature:
          {(exitus616,3);(f0,3);(f4,3)}
        Flow Graph:
          [0->{0,1,3},1->{0,1,3},2->{1,3},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[0,1] c: [1]
             |
             `- p:[0] c: [0]
* Step 5: SizeAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        (Rules:
          0. f4(A,B,C) -> f4(A,1 + B,C)    [A >= 1 + B]           (?,1)
          1. f4(A,B,C) -> f4(1 + A,0,C)    [C >= 2 + A && B >= A] (?,1)
          2. f0(A,B,C) -> f4(0,0,C)        [C >= 1]               (1,1)
          3. f4(A,B,C) -> exitus616(A,B,C) True                   (?,1)
        Signature:
          {(exitus616,3);(f0,3);(f4,3)}
        Flow Graph:
          [0->{0,1,3},1->{0,1,3},2->{1,3},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[0,1] c: [1]
             |
             `- p:[0] c: [0])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 6: FlowAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [A,B,C,0.0,0.0.0]
           f4  ~>  f4          [A <= A, B <= A + B, C <= C]
           f4  ~>  f4          [A <= K + A, B <= 0*K, C <= C]
           f0  ~>  f4          [A <= 0*K, B <= 0*K, C <= C]
           f4  ~>  exitus616   [A <= A, B <= B, C <= C]
          + Loop: [0.0 <= A + C]
               f4  ~>  f4   [A <= A, B <= A + B, C <= C]
               f4  ~>  f4   [A <= K + A, B <= 0*K, C <= C]
            + Loop: [0.0.0 <= A + B]
                 f4  ~>  f4   [A <= A, B <= A + B, C <= C]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 7: LareProcessor WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,C,0.0,0.0.0]
           f4  ~>  f4          [A ~+> B,B ~+> B]
           f4  ~>  f4          [K ~=> B,A ~+> A,K ~+> A]
           f0  ~>  f4          [K ~=> A,K ~=> B]
           f4  ~>  exitus616   []
          + Loop: [A ~+> 0.0,C ~+> 0.0]
               f4  ~>  f4   [A ~+> B,B ~+> B]
               f4  ~>  f4   [K ~=> B,A ~+> A,K ~+> A]
            + Loop: [A ~+> 0.0.0,B ~+> 0.0.0]
                 f4  ~>  f4   [A ~+> B,B ~+> B]
    + Applied Processor:
        LareProcessor
    + Details:
         f0  ~>  exitus616   [K ~=> A
                             ,K ~=> B
                             ,C ~+> 0.0
                             ,C ~+> tick
                             ,tick ~+> tick
                             ,K ~+> A
                             ,K ~+> B
                             ,K ~+> 0.0
                             ,K ~+> 0.0.0
                             ,K ~+> tick
                             ,C ~*> A
                             ,C ~*> B
                             ,C ~*> tick
                             ,K ~*> A
                             ,K ~*> B
                             ,K ~*> 0.0.0
                             ,K ~*> tick
                             ,C ~^> B
                             ,K ~^> B]
        + <f4  ~>  f4>  [K ~=> B
                        ,A ~+> A
                        ,A ~+> B
                        ,A ~+> 0.0
                        ,A ~+> 0.0.0
                        ,A ~+> tick
                        ,B ~+> B
                        ,B ~+> 0.0.0
                        ,B ~+> tick
                        ,C ~+> 0.0
                        ,C ~+> tick
                        ,tick ~+> tick
                        ,K ~+> A
                        ,K ~+> B
                        ,K ~+> 0.0.0
                        ,K ~+> tick
                        ,A ~*> A
                        ,A ~*> B
                        ,A ~*> 0.0.0
                        ,A ~*> tick
                        ,B ~*> B
                        ,B ~*> 0.0.0
                        ,B ~*> tick
                        ,C ~*> A
                        ,C ~*> B
                        ,C ~*> tick
                        ,K ~*> A
                        ,K ~*> B
                        ,K ~*> 0.0.0
                        ,K ~*> tick
                        ,A ~^> B
                        ,C ~^> B]
          + <f4  ~>  f4>  [A ~+> B
                          ,A ~+> 0.0.0
                          ,A ~+> tick
                          ,B ~+> B
                          ,B ~+> 0.0.0
                          ,B ~+> tick
                          ,tick ~+> tick
                          ,A ~*> B
                          ,B ~*> B]

YES(?,POLY)