MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0.  evalfstart(A,B,C,D,E,F,G)    -> evalfentryin(A,B,C,D,E,F,G)     True         (1,1)
          1.  evalfentryin(A,B,C,D,E,F,G)  -> evalfbb10in(B,C,D,A,E,F,G)      True         (?,1)
          2.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfbb8in(A,B,C,D,1,F,G)       [D >= 1]     (?,1)
          3.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfreturnin(A,B,C,D,E,F,G)    [0 >= D]     (?,1)
          4.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,D,G)       [A >= E]     (?,1)
          5.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb9in(A,B,C,D,E,F,G)       [E >= 1 + A] (?,1)
          6.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,C)       [B >= F]     (?,1)
          7.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb7in(A,B,C,D,E,F,G)       [F >= 1 + B] (?,1)
          8.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb3in(A,B,C,D,E,F,G)       [E >= G]     (?,1)
          9.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb5in(A,B,C,D,E,F,G)       [G >= 1 + E] (?,1)
          10. evalfbb3in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,-1 + G)  True         (?,1)
          11. evalfbb5in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,1 + F,G)   True         (?,1)
          12. evalfbb7in(A,B,C,D,E,F,G)    -> evalfbb8in(A,B,C,D,1 + E,F,G)   True         (?,1)
          13. evalfbb9in(A,B,C,D,E,F,G)    -> evalfbb10in(A,B,C,-1 + D,E,F,G) True         (?,1)
          14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G)        True         (?,1)
        Signature:
          {(evalfbb10in,7)
          ;(evalfbb3in,7)
          ;(evalfbb4in,7)
          ;(evalfbb5in,7)
          ;(evalfbb6in,7)
          ;(evalfbb7in,7)
          ;(evalfbb8in,7)
          ;(evalfbb9in,7)
          ;(evalfentryin,7)
          ;(evalfreturnin,7)
          ;(evalfstart,7)
          ;(evalfstop,7)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7}
          ,12->{4,5},13->{2,3},14->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0.  evalfstart(A,B,C,D,E,F,G)    -> evalfentryin(A,B,C,D,E,F,G)     True         (1,1)
          1.  evalfentryin(A,B,C,D,E,F,G)  -> evalfbb10in(B,C,D,A,E,F,G)      True         (1,1)
          2.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfbb8in(A,B,C,D,1,F,G)       [D >= 1]     (?,1)
          3.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfreturnin(A,B,C,D,E,F,G)    [0 >= D]     (1,1)
          4.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,D,G)       [A >= E]     (?,1)
          5.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb9in(A,B,C,D,E,F,G)       [E >= 1 + A] (?,1)
          6.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,C)       [B >= F]     (?,1)
          7.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb7in(A,B,C,D,E,F,G)       [F >= 1 + B] (?,1)
          8.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb3in(A,B,C,D,E,F,G)       [E >= G]     (?,1)
          9.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb5in(A,B,C,D,E,F,G)       [G >= 1 + E] (?,1)
          10. evalfbb3in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,-1 + G)  True         (?,1)
          11. evalfbb5in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,1 + F,G)   True         (?,1)
          12. evalfbb7in(A,B,C,D,E,F,G)    -> evalfbb8in(A,B,C,D,1 + E,F,G)   True         (?,1)
          13. evalfbb9in(A,B,C,D,E,F,G)    -> evalfbb10in(A,B,C,-1 + D,E,F,G) True         (?,1)
          14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G)        True         (1,1)
        Signature:
          {(evalfbb10in,7)
          ;(evalfbb3in,7)
          ;(evalfbb4in,7)
          ;(evalfbb5in,7)
          ;(evalfbb6in,7)
          ;(evalfbb7in,7)
          ;(evalfbb8in,7)
          ;(evalfbb9in,7)
          ;(evalfentryin,7)
          ;(evalfreturnin,7)
          ;(evalfstart,7)
          ;(evalfstop,7)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7}
          ,12->{4,5},13->{2,3},14->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  evalfstart(A,B,C,D,E,F,G)    -> evalfentryin(A,B,C,D,E,F,G)     True         (1,1)
        1.  evalfentryin(A,B,C,D,E,F,G)  -> evalfbb10in(B,C,D,A,E,F,G)      True         (?,1)
        2.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfbb8in(A,B,C,D,1,F,G)       [D >= 1]     (?,1)
        3.  evalfbb10in(A,B,C,D,E,F,G)   -> evalfreturnin(A,B,C,D,E,F,G)    [0 >= D]     (?,1)
        4.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,D,G)       [A >= E]     (?,1)
        5.  evalfbb8in(A,B,C,D,E,F,G)    -> evalfbb9in(A,B,C,D,E,F,G)       [E >= 1 + A] (?,1)
        6.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,C)       [B >= F]     (?,1)
        7.  evalfbb6in(A,B,C,D,E,F,G)    -> evalfbb7in(A,B,C,D,E,F,G)       [F >= 1 + B] (?,1)
        8.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb3in(A,B,C,D,E,F,G)       [E >= G]     (?,1)
        9.  evalfbb4in(A,B,C,D,E,F,G)    -> evalfbb5in(A,B,C,D,E,F,G)       [G >= 1 + E] (?,1)
        10. evalfbb3in(A,B,C,D,E,F,G)    -> evalfbb4in(A,B,C,D,E,F,-1 + G)  True         (?,1)
        11. evalfbb5in(A,B,C,D,E,F,G)    -> evalfbb6in(A,B,C,D,E,1 + F,G)   True         (?,1)
        12. evalfbb7in(A,B,C,D,E,F,G)    -> evalfbb8in(A,B,C,D,1 + E,F,G)   True         (?,1)
        13. evalfbb9in(A,B,C,D,E,F,G)    -> evalfbb10in(A,B,C,-1 + D,E,F,G) True         (?,1)
        14. evalfreturnin(A,B,C,D,E,F,G) -> evalfstop(A,B,C,D,E,F,G)        True         (?,1)
        15. evalfreturnin(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)        True         (?,1)
      Signature:
        {(evalfbb10in,7)
        ;(evalfbb3in,7)
        ;(evalfbb4in,7)
        ;(evalfbb5in,7)
        ;(evalfbb6in,7)
        ;(evalfbb7in,7)
        ;(evalfbb8in,7)
        ;(evalfbb9in,7)
        ;(evalfentryin,7)
        ;(evalfreturnin,7)
        ;(evalfstart,7)
        ;(evalfstop,7)
        ;(exitus616,7)}
      Flow Graph:
        [0->{1},1->{2,3},2->{4,5},3->{14,15},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7}
        ,12->{4,5},13->{2,3},14->{},15->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15]
        |
        `- p:[2,13,5,12,7,4,11,9,6,10,8] c: [2]
           |
           `- p:[4,12,7,11,9,6,10,8] c: [4]
              |
              `- p:[6,11,9,10,8] c: [6]
                 |
                 `- p:[8,10] c: []
MAYBE