YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f6(C,0)     True      (1,1)
          1. f6(A,B) -> f6(A,1 + B) [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)    [B >= 10] (?,1)
        Signature:
          {(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f6(C,0)     True      (1,1)
          1. f6(A,B) -> f6(A,1 + B) [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)    [B >= 10] (1,1)
        Signature:
          {(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 3: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f6(C,0)     True      (1,1)
          1. f6(A,B) -> f6(A,1 + B) [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)    [B >= 10] (1,1)
        Signature:
          {(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1},1->{1,2},2->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f6(C,0)        True      (1,1)
          1. f6(A,B) -> f6(A,1 + B)    [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)       [B >= 10] (?,1)
          3. f6(A,B) -> exitus616(A,B) True      (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 5: LooptreeTransformer WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f6(C,0)        True      (1,1)
          1. f6(A,B) -> f6(A,1 + B)    [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)       [B >= 10] (?,1)
          3. f6(A,B) -> exitus616(A,B) True      (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1,3},1->{1,2,3},2->{},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1]
* Step 6: SizeAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          0. f0(A,B) -> f6(C,0)        True      (1,1)
          1. f6(A,B) -> f6(A,1 + B)    [9 >= B]  (?,1)
          2. f6(A,B) -> f15(A,B)       [B >= 10] (?,1)
          3. f6(A,B) -> exitus616(A,B) True      (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f15,2);(f6,2)}
        Flow Graph:
          [0->{1,3},1->{1,2,3},2->{},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 7: FlowAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f0  ~>  f6          [A <= unknown, B <= 0*K]
           f6  ~>  f6          [A <= A, B <= K + B]
           f6  ~>  f15         [A <= A, B <= B]
           f6  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= 10*K + B]
               f6  ~>  f6   [A <= A, B <= K + B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 8: LareProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f0  ~>  f6          [K ~=> B,huge ~=> A]
           f6  ~>  f6          [B ~+> B,K ~+> B]
           f6  ~>  f15         []
           f6  ~>  exitus616   []
          + Loop: [B ~+> 0.0,K ~*> 0.0]
               f6  ~>  f6   [B ~+> B,K ~+> B]
    + Applied Processor:
        LareProcessor
    + Details:
         f0  ~>  exitus616   [K ~=> B
                             ,huge ~=> A
                             ,tick ~+> tick
                             ,K ~+> B
                             ,K ~+> 0.0
                             ,K ~+> tick
                             ,K ~*> B
                             ,K ~*> 0.0
                             ,K ~*> tick]
         f0  ~>  f15         [K ~=> B
                             ,huge ~=> A
                             ,tick ~+> tick
                             ,K ~+> B
                             ,K ~+> 0.0
                             ,K ~+> tick
                             ,K ~*> B
                             ,K ~*> 0.0
                             ,K ~*> tick]
        + <f6  ~>  f6>  [B ~+> B,B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~+> B,B ~*> B,K ~*> B,K ~*> 0.0,K ~*> tick]

YES(?,O(1))