YES(?,O(1))
* Step 1: ArgumentFilter WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f12(A,B,C,D,E) -> f12(1 + A,B,C,D,E) [A >= 0 && 9 >= A]                                      (?,1)
          1. f25(A,B,C,D,E) -> f25(A,1 + B,C,D,E) [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]  (?,1)
          2. f25(A,B,C,D,E) -> f36(A,B,C,D,E)     [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10] (?,1)
          3. f12(A,B,C,D,E) -> f25(A,0,F,D,E)     [A >= 0 && A >= 10]                                     (?,1)
          4. f0(A,B,C,D,E)  -> f12(0,B,C,F,G)     True                                                    (1,1)
        Signature:
          {(f0,5);(f12,5);(f25,5);(f36,5)}
        Flow Graph:
          [0->{0,3},1->{1,2},2->{},3->{1,2},4->{0,3}]
        
    + Applied Processor:
        ArgumentFilter [2,3,4]
    + Details:
        We remove following argument positions: [2,3,4].
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f12(A,B) -> f12(1 + A,B) [A >= 0 && 9 >= A]                                      (?,1)
          1. f25(A,B) -> f25(A,1 + B) [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]  (?,1)
          2. f25(A,B) -> f36(A,B)     [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10] (?,1)
          3. f12(A,B) -> f25(A,0)     [A >= 0 && A >= 10]                                     (?,1)
          4. f0(A,B)  -> f12(0,B)     True                                                    (1,1)
        Signature:
          {(f0,5);(f12,5);(f25,5);(f36,5)}
        Flow Graph:
          [0->{0,3},1->{1,2},2->{},3->{1,2},4->{0,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(3,2),(4,3)]
* Step 3: FromIts WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f12(A,B) -> f12(1 + A,B) [A >= 0 && 9 >= A]                                      (?,1)
          1. f25(A,B) -> f25(A,1 + B) [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]  (?,1)
          2. f25(A,B) -> f36(A,B)     [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10] (?,1)
          3. f12(A,B) -> f25(A,0)     [A >= 0 && A >= 10]                                     (?,1)
          4. f0(A,B)  -> f12(0,B)     True                                                    (1,1)
        Signature:
          {(f0,5);(f12,5);(f25,5);(f36,5)}
        Flow Graph:
          [0->{0,3},1->{1,2},2->{},3->{1},4->{0}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f12(A,B) -> f12(1 + A,B)  [A >= 0 && 9 >= A]
          f25(A,B) -> f25(A,1 + B)  [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]
          f25(A,B) -> f36(A,B)      [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10]
          f12(A,B) -> f25(A,0)      [A >= 0 && A >= 10]
          f0(A,B)  -> f12(0,B)      True
        Signature:
          {(f0,5);(f12,5);(f25,5);(f36,5)}
        Rule Graph:
          [0->{0,3},1->{1,2},2->{},3->{1},4->{0}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f12(A,B) -> f12(1 + A,B)    [A >= 0 && 9 >= A]
          f25(A,B) -> f25(A,1 + B)    [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]
          f25(A,B) -> f36(A,B)        [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10]
          f12(A,B) -> f25(A,0)        [A >= 0 && A >= 10]
          f0(A,B)  -> f12(0,B)        True
          f36(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f0,5);(f12,5);(f25,5);(f36,5)}
        Rule Graph:
          [0->{0,3},1->{1,2},2->{5},3->{1},4->{0}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          +- p:[0] c: [0]
          |
          `- p:[1] c: [1]
* Step 6: AbstractSize WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          f12(A,B) -> f12(1 + A,B)    [A >= 0 && 9 >= A]
          f25(A,B) -> f25(A,1 + B)    [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && 9 >= B]
          f25(A,B) -> f36(A,B)        [B >= 0 && -10 + A + B >= 0 && -10 + A >= 0 && B >= 10]
          f12(A,B) -> f25(A,0)        [A >= 0 && A >= 10]
          f0(A,B)  -> f12(0,B)        True
          f36(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f0,5);(f12,5);(f25,5);(f36,5)}
        Rule Graph:
          [0->{0,3},1->{1,2},2->{5},3->{1},4->{0}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          +- p:[0] c: [0]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 7: AbstractFlow WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0,0.1]
           f12  ~>  f12         [A <= 10*K, B <= B]
           f25  ~>  f25         [A <= A, B <= 10*K]
           f25  ~>  f36         [A <= A, B <= B]
           f12  ~>  f25         [A <= A, B <= 0*K]
           f0   ~>  f12         [A <= 0*K, B <= B]
           f36  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= 9*K + A]
               f12  ~>  f12   [A <= 10*K, B <= B]
          + Loop: [0.1 <= 9*K + B]
               f25  ~>  f25   [A <= A, B <= 10*K]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Lare WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0,0.1]
           f12  ~>  f12         [K ~=> A]
           f25  ~>  f25         [K ~=> B]
           f25  ~>  f36         []
           f12  ~>  f25         [K ~=> B]
           f0   ~>  f12         [K ~=> A]
           f36  ~>  exitus616   []
          + Loop: [A ~+> 0.0,K ~*> 0.0]
               f12  ~>  f12   [K ~=> A]
          + Loop: [B ~+> 0.1,K ~*> 0.1]
               f25  ~>  f25   [K ~=> B]
    + Applied Processor:
        Lare
    + Details:
         f0  ~>  exitus616   [K ~=> A
                             ,K ~=> B
                             ,tick ~+> tick
                             ,K ~+> 0.0
                             ,K ~+> 0.1
                             ,K ~+> tick
                             ,K ~*> 0.0
                             ,K ~*> 0.1
                             ,K ~*> tick]
        + <f12  ~>  f12>  [K ~=> A,A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f25  ~>  f25>  [K ~=> B,B ~+> 0.1,B ~+> tick,tick ~+> tick,K ~*> 0.1,K ~*> tick]

YES(?,O(1))