MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0.  evalEx5start(A,B,C,D,E)    -> evalEx5entryin(A,B,C,D,E)    True                   (1,1)
          1.  evalEx5entryin(A,B,C,D,E)  -> evalEx5bb6in(0,A,C,D,E)      True                   (?,1)
          2.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5bb3in(A,B,0,B,E)      [B >= 1 + A]           (?,1)
          3.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5returnin(A,B,C,D,E)   [A >= B]               (?,1)
          4.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [0 >= 1 + F]           (?,1)
          5.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [F >= 1]               (?,1)
          6.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb4in(A,B,C,D,E)      True                   (?,1)
          7.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F]           (?,1)
          8.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F && F >= 1] (?,1)
          9.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [F >= 1]               (?,1)
          10. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,-1 + D,E) [0 >= 1]               (?,1)
          11. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,-1 + D,E) [0 >= 1]               (?,1)
          12. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,D)      [0 >= 1]               (?,1)
          13. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,D)      [0 >= 1]               (?,1)
          14. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,D,E)      True                   (?,1)
          15. evalEx5bb2in(A,B,C,D,E)    -> evalEx5bb3in(A,B,1,E,E)      True                   (?,1)
          16. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(1 + A,D,C,D,E)  [C = 0]                (?,1)
          17. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [0 >= 1 + C]           (?,1)
          18. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [C >= 1]               (?,1)
          19. evalEx5returnin(A,B,C,D,E) -> evalEx5stop(A,B,C,D,E)       True                   (?,1)
        Signature:
          {(evalEx5bb1in,5)
          ;(evalEx5bb2in,5)
          ;(evalEx5bb3in,5)
          ;(evalEx5bb4in,5)
          ;(evalEx5bb6in,5)
          ;(evalEx5entryin,5)
          ;(evalEx5returnin,5)
          ;(evalEx5start,5)
          ;(evalEx5stop,5)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{19},4->{7,8,9,10,11,12,13,14},5->{7,8,9,10,11,12,13,14},6->{16,17,18}
          ,7->{15},8->{15},9->{15},10->{4,5,6},11->{4,5,6},12->{15},13->{15},14->{4,5,6},15->{4,5,6},16->{2,3},17->{2
          ,3},18->{2,3},19->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatRules MAYBE
    + Considered Problem:
        Rules:
          0.  evalEx5start(A,B,C,D,E)    -> evalEx5entryin(A,B,C,D,E)    True                   (1,1)
          1.  evalEx5entryin(A,B,C,D,E)  -> evalEx5bb6in(0,A,C,D,E)      True                   (1,1)
          2.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5bb3in(A,B,0,B,E)      [B >= 1 + A]           (?,1)
          3.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5returnin(A,B,C,D,E)   [A >= B]               (1,1)
          4.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [0 >= 1 + F]           (?,1)
          5.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [F >= 1]               (?,1)
          6.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb4in(A,B,C,D,E)      True                   (?,1)
          7.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F]           (?,1)
          8.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F && F >= 1] (?,1)
          9.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [F >= 1]               (?,1)
          10. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,-1 + D,E) [0 >= 1]               (?,1)
          11. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,-1 + D,E) [0 >= 1]               (?,1)
          12. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,D)      [0 >= 1]               (?,1)
          13. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,D)      [0 >= 1]               (?,1)
          14. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,D,E)      True                   (?,1)
          15. evalEx5bb2in(A,B,C,D,E)    -> evalEx5bb3in(A,B,1,E,E)      True                   (?,1)
          16. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(1 + A,D,C,D,E)  [C = 0]                (?,1)
          17. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [0 >= 1 + C]           (?,1)
          18. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [C >= 1]               (?,1)
          19. evalEx5returnin(A,B,C,D,E) -> evalEx5stop(A,B,C,D,E)       True                   (1,1)
        Signature:
          {(evalEx5bb1in,5)
          ;(evalEx5bb2in,5)
          ;(evalEx5bb3in,5)
          ;(evalEx5bb4in,5)
          ;(evalEx5bb6in,5)
          ;(evalEx5entryin,5)
          ;(evalEx5returnin,5)
          ;(evalEx5start,5)
          ;(evalEx5stop,5)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{19},4->{7,8,9,10,11,12,13,14},5->{7,8,9,10,11,12,13,14},6->{16,17,18}
          ,7->{15},8->{15},9->{15},10->{4,5,6},11->{4,5,6},12->{15},13->{15},14->{4,5,6},15->{4,5,6},16->{2,3},17->{2
          ,3},18->{2,3},19->{}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [8,10,11,12,13]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0.  evalEx5start(A,B,C,D,E)    -> evalEx5entryin(A,B,C,D,E)    True         (1,1)
          1.  evalEx5entryin(A,B,C,D,E)  -> evalEx5bb6in(0,A,C,D,E)      True         (1,1)
          2.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5bb3in(A,B,0,B,E)      [B >= 1 + A] (?,1)
          3.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5returnin(A,B,C,D,E)   [A >= B]     (1,1)
          4.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [0 >= 1 + F] (?,1)
          5.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [F >= 1]     (?,1)
          6.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb4in(A,B,C,D,E)      True         (?,1)
          7.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F] (?,1)
          9.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [F >= 1]     (?,1)
          14. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,D,E)      True         (?,1)
          15. evalEx5bb2in(A,B,C,D,E)    -> evalEx5bb3in(A,B,1,E,E)      True         (?,1)
          16. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(1 + A,D,C,D,E)  [C = 0]      (?,1)
          17. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [0 >= 1 + C] (?,1)
          18. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [C >= 1]     (?,1)
          19. evalEx5returnin(A,B,C,D,E) -> evalEx5stop(A,B,C,D,E)       True         (1,1)
        Signature:
          {(evalEx5bb1in,5)
          ;(evalEx5bb2in,5)
          ;(evalEx5bb3in,5)
          ;(evalEx5bb4in,5)
          ;(evalEx5bb6in,5)
          ;(evalEx5entryin,5)
          ;(evalEx5returnin,5)
          ;(evalEx5start,5)
          ;(evalEx5stop,5)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{19},4->{7,9,14},5->{7,9,14},6->{16,17,18},7->{15},9->{15},14->{4,5,6}
          ,15->{4,5,6},16->{2,3},17->{2,3},18->{2,3},19->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        0.  evalEx5start(A,B,C,D,E)    -> evalEx5entryin(A,B,C,D,E)    True         (1,1)
        1.  evalEx5entryin(A,B,C,D,E)  -> evalEx5bb6in(0,A,C,D,E)      True         (?,1)
        2.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5bb3in(A,B,0,B,E)      [B >= 1 + A] (?,1)
        3.  evalEx5bb6in(A,B,C,D,E)    -> evalEx5returnin(A,B,C,D,E)   [A >= B]     (?,1)
        4.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [0 >= 1 + F] (?,1)
        5.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb1in(A,B,C,D,E)      [F >= 1]     (?,1)
        6.  evalEx5bb3in(A,B,C,D,E)    -> evalEx5bb4in(A,B,C,D,E)      True         (?,1)
        7.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [0 >= 1 + F] (?,1)
        9.  evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb2in(A,B,C,D,-1 + D) [F >= 1]     (?,1)
        14. evalEx5bb1in(A,B,C,D,E)    -> evalEx5bb3in(A,B,C,D,E)      True         (?,1)
        15. evalEx5bb2in(A,B,C,D,E)    -> evalEx5bb3in(A,B,1,E,E)      True         (?,1)
        16. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(1 + A,D,C,D,E)  [C = 0]      (?,1)
        17. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [0 >= 1 + C] (?,1)
        18. evalEx5bb4in(A,B,C,D,E)    -> evalEx5bb6in(A,D,C,D,E)      [C >= 1]     (?,1)
        19. evalEx5returnin(A,B,C,D,E) -> evalEx5stop(A,B,C,D,E)       True         (?,1)
        20. evalEx5returnin(A,B,C,D,E) -> exitus616(A,B,C,D,E)         True         (?,1)
      Signature:
        {(evalEx5bb1in,5)
        ;(evalEx5bb2in,5)
        ;(evalEx5bb3in,5)
        ;(evalEx5bb4in,5)
        ;(evalEx5bb6in,5)
        ;(evalEx5entryin,5)
        ;(evalEx5returnin,5)
        ;(evalEx5start,5)
        ;(evalEx5stop,5)
        ;(exitus616,5)}
      Flow Graph:
        [0->{1},1->{2,3},2->{4,5,6},3->{19,20},4->{7,9,14},5->{7,9,14},6->{16,17,18},7->{15},9->{15},14->{4,5,6}
        ,15->{4,5,6},16->{2,3},17->{2,3},18->{2,3},19->{},20->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,9,14,15,16,17,18,19,20]
        |
        `- p:[2,16,6,14,4,15,7,5,9,17,18] c: []
MAYBE