YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. start(A,B,C) -> eval(A,B,C)          True                 (1,1)
          1. eval(A,B,C)  -> eval(C,-1 + B,1 + A) [100 >= A && B >= C] (?,1)
        Signature:
          {(eval,3);(start,3)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B,C) -> eval(A,B,C)           True
          eval(A,B,C)  -> eval(C,-1 + B,1 + A)  [100 >= A && B >= C]
        Signature:
          {(eval,3);(start,3)}
        Rule Graph:
          [0->{1},1->{1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B,C) -> eval(A,B,C)           True
          eval(A,B,C)  -> eval(C,-1 + B,1 + A)  [100 >= A && B >= C]
          eval(A,B,C)  -> exitus616(A,B,C)      True
        Signature:
          {(eval,3);(exitus616,3);(start,3)}
        Rule Graph:
          [0->{1},1->{1,2}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1]
* Step 4: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          start(A,B,C) -> eval(A,B,C)           True
          eval(A,B,C)  -> eval(C,-1 + B,1 + A)  [100 >= A && B >= C]
          eval(A,B,C)  -> exitus616(A,B,C)      True
        Signature:
          {(eval,3);(exitus616,3);(start,3)}
        Rule Graph:
          [0->{1},1->{1,2}]
        ,We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,C,0.0]
           start  ~>  eval        [A <= A, B <= B, C <= C]
           eval   ~>  eval        [A <= C, B <= K + B, C <= K + A]
           eval   ~>  exitus616   [A <= A, B <= B, C <= C]
          + Loop: [0.0 <= 100*K + A + B + C]
               eval  ~>  eval   [A <= C, B <= K + B, C <= K + A]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,C,0.0]
           start  ~>  eval        []
           eval   ~>  eval        [C ~=> A,A ~+> C,B ~+> B,K ~+> B,K ~+> C]
           eval   ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0,K ~*> 0.0]
               eval  ~>  eval   [C ~=> A,A ~+> C,B ~+> B,K ~+> B,K ~+> C]
    + Applied Processor:
        Lare
    + Details:
         start  ~>  exitus616   [C ~=> A
                                ,A ~+> A
                                ,A ~+> C
                                ,A ~+> 0.0
                                ,A ~+> tick
                                ,B ~+> B
                                ,B ~+> 0.0
                                ,B ~+> tick
                                ,C ~+> A
                                ,C ~+> C
                                ,C ~+> 0.0
                                ,C ~+> tick
                                ,tick ~+> tick
                                ,K ~+> A
                                ,K ~+> B
                                ,K ~+> C
                                ,A ~*> A
                                ,A ~*> B
                                ,A ~*> C
                                ,B ~*> A
                                ,B ~*> B
                                ,B ~*> C
                                ,C ~*> A
                                ,C ~*> B
                                ,C ~*> C
                                ,K ~*> A
                                ,K ~*> B
                                ,K ~*> C
                                ,K ~*> 0.0
                                ,K ~*> tick]
        + <eval  ~>  eval>  [C ~=> A
                            ,A ~+> A
                            ,A ~+> C
                            ,A ~+> 0.0
                            ,A ~+> tick
                            ,B ~+> B
                            ,B ~+> 0.0
                            ,B ~+> tick
                            ,C ~+> A
                            ,C ~+> C
                            ,C ~+> 0.0
                            ,C ~+> tick
                            ,tick ~+> tick
                            ,K ~+> A
                            ,K ~+> B
                            ,K ~+> C
                            ,A ~*> A
                            ,A ~*> B
                            ,A ~*> C
                            ,B ~*> A
                            ,B ~*> B
                            ,B ~*> C
                            ,C ~*> A
                            ,C ~*> B
                            ,C ~*> C
                            ,K ~*> A
                            ,K ~*> B
                            ,K ~*> C
                            ,K ~*> 0.0
                            ,K ~*> tick]

YES(?,O(n^1))