WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            dfsAcc#3(Leaf(x8),x16) -> Cons(x8,x16)
            dfsAcc#3(Node(x6,x4),x2) -> dfsAcc#3(x4,dfsAcc#3(x6,x2))
            main(x1) -> revApp#2(dfsAcc#3(x1,Nil()),Nil())
            revApp#2(Cons(x6,x4),x2) -> revApp#2(x4,Cons(x6,x2))
            revApp#2(Nil(),x16) -> x16
        - Signature:
            {dfsAcc#3/2,main/1,revApp#2/2} / {Cons/2,Leaf/1,Nil/0,Node/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {dfsAcc#3,main,revApp#2} and constructors {Cons,Leaf,Nil
            ,Node}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          Cons :: ["A"(0) x "A"(13)] -(13)-> "A"(13)
          Cons :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
          Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          Leaf :: ["A"(14)] -(14)-> "A"(14)
          Nil :: [] -(0)-> "A"(13)
          Nil :: [] -(0)-> "A"(15)
          Nil :: [] -(0)-> "A"(7)
          Node :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
          dfsAcc#3 :: ["A"(14) x "A"(15)] -(2)-> "A"(15)
          main :: ["A"(14)] -(16)-> "A"(0)
          revApp#2 :: ["A"(13) x "A"(0)] -(2)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "Leaf_A" :: ["A"(1)] -(1)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
          "Node_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))