MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(B)     [B >= 1]                 (1,1)
          1. f5(A) -> f5(1 + A) [-1 + A >= 0 && 19 >= A] (?,1)
          2. f0(A) -> f12(B)    [0 >= B]                 (1,1)
          3. f5(A) -> f12(A)    [-1 + A >= 0 && A >= 20] (?,1)
        Signature:
          {(f0,1);(f12,1);(f5,1)}
        Flow Graph:
          [0->{1,3},1->{1,3},2->{},3->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(B)     [B >= 1]                 (1,1)
          1. f5(A) -> f5(1 + A) [-1 + A >= 0 && 19 >= A] (?,1)
          2. f0(A) -> f12(B)    [0 >= B]                 (1,1)
          3. f5(A) -> f12(A)    [-1 + A >= 0 && A >= 20] (1,1)
        Signature:
          {(f0,1);(f12,1);(f5,1)}
        Flow Graph:
          [0->{1,3},1->{1,3},2->{},3->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: LooptreeTransformer MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(B)        [B >= 1]                 (1,1)
          1. f5(A) -> f5(1 + A)    [-1 + A >= 0 && 19 >= A] (?,1)
          2. f0(A) -> f12(B)       [0 >= B]                 (1,1)
          3. f5(A) -> f12(A)       [-1 + A >= 0 && A >= 20] (?,1)
          4. f0(A) -> exitus616(A) True                     (1,1)
          5. f5(A) -> exitus616(A) True                     (?,1)
        Signature:
          {(exitus616,1);(f0,1);(f12,1);(f5,1)}
        Flow Graph:
          [0->{1,3,5},1->{1,3,5},2->{},3->{},4->{},5->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1]
* Step 4: SizeAbstraction MAYBE
    + Considered Problem:
        (Rules:
          0. f0(A) -> f5(B)        [B >= 1]                 (1,1)
          1. f5(A) -> f5(1 + A)    [-1 + A >= 0 && 19 >= A] (?,1)
          2. f0(A) -> f12(B)       [0 >= B]                 (1,1)
          3. f5(A) -> f12(A)       [-1 + A >= 0 && A >= 20] (?,1)
          4. f0(A) -> exitus616(A) True                     (1,1)
          5. f5(A) -> exitus616(A) True                     (?,1)
        Signature:
          {(exitus616,1);(f0,1);(f12,1);(f5,1)}
        Flow Graph:
          [0->{1,3,5},1->{1,3,5},2->{},3->{},4->{},5->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 5: FlowAbstraction MAYBE
    + Considered Problem:
        Program:
          Domain: [A,0.0]
           f0  ~>  f5          [A <= unknown]
           f5  ~>  f5          [A <= 20*K]
           f0  ~>  f12         [A <= unknown]
           f5  ~>  f12         [A <= A]
           f0  ~>  exitus616   [A <= A]
           f5  ~>  exitus616   [A <= A]
          + Loop: [0.0 <= 20*K + A]
               f5  ~>  f5   [A <= 20*K]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 6: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,0.0]
         f0  ~>  f5          [huge ~=> A]
         f5  ~>  f5          [K ~=> A]
         f0  ~>  f12         [huge ~=> A]
         f5  ~>  f12         []
         f0  ~>  exitus616   []
         f5  ~>  exitus616   []
        + Loop: [A ~+> 0.0,K ~*> 0.0]
             f5  ~>  f5   [K ~=> A]
  + Applied Processor:
      LareProcessor
  + Details:
      Unknown bound.
MAYBE