/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(n^1), O(n^10))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^10).

(0) CpxTRS
(1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
(2) CpxWeightedTrs
    (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
    (4) CpxTypedWeightedTrs
    (5) CompletionProof [UPPER BOUND(ID), 0 ms]
    (6) CpxTypedWeightedCompleteTrs
    (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (8) CpxTypedWeightedCompleteTrs
    (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
    (10) CpxRNTS
    (11) InliningProof [UPPER BOUND(ID), 18 ms]
    (12) CpxRNTS
    (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
    (14) CpxRNTS
    (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
    (16) CpxRNTS
    (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (18) CpxRNTS
    (19) IntTrsBoundProof [UPPER BOUND(ID), 142 ms]
    (20) CpxRNTS
    (21) IntTrsBoundProof [UPPER BOUND(ID), 76 ms]
    (22) CpxRNTS
    (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (24) CpxRNTS
    (25) IntTrsBoundProof [UPPER BOUND(ID), 57 ms]
    (26) CpxRNTS
    (27) IntTrsBoundProof [UPPER BOUND(ID), 42 ms]
    (28) CpxRNTS
    (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (30) CpxRNTS
    (31) IntTrsBoundProof [UPPER BOUND(ID), 127 ms]
    (32) CpxRNTS
    (33) IntTrsBoundProof [UPPER BOUND(ID), 52 ms]
    (34) CpxRNTS
    (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (36) CpxRNTS
    (37) IntTrsBoundProof [UPPER BOUND(ID), 188 ms]
    (38) CpxRNTS
    (39) IntTrsBoundProof [UPPER BOUND(ID), 114 ms]
    (40) CpxRNTS
    (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (42) CpxRNTS
    (43) IntTrsBoundProof [UPPER BOUND(ID), 95 ms]
    (44) CpxRNTS
    (45) IntTrsBoundProof [UPPER BOUND(ID), 2 ms]
    (46) CpxRNTS
    (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (48) CpxRNTS
    (49) IntTrsBoundProof [UPPER BOUND(ID), 98 ms]
    (50) CpxRNTS
    (51) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (52) CpxRNTS
    (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (54) CpxRNTS
    (55) IntTrsBoundProof [UPPER BOUND(ID), 115 ms]
    (56) CpxRNTS
    (57) IntTrsBoundProof [UPPER BOUND(ID), 2 ms]
    (58) CpxRNTS
    (59) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (60) CpxRNTS
    (61) IntTrsBoundProof [UPPER BOUND(ID), 126 ms]
    (62) CpxRNTS
    (63) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (64) CpxRNTS
    (65) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (66) CpxRNTS
    (67) IntTrsBoundProof [UPPER BOUND(ID), 106 ms]
    (68) CpxRNTS
    (69) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (70) CpxRNTS
    (71) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (72) CpxRNTS
    (73) IntTrsBoundProof [UPPER BOUND(ID), 108 ms]
    (74) CpxRNTS
    (75) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (76) CpxRNTS
    (77) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (78) CpxRNTS
    (79) IntTrsBoundProof [UPPER BOUND(ID), 77 ms]
    (80) CpxRNTS
    (81) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (82) CpxRNTS
    (83) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (84) CpxRNTS
    (85) IntTrsBoundProof [UPPER BOUND(ID), 156 ms]
    (86) CpxRNTS
    (87) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
    (88) CpxRNTS
    (89) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (90) CpxRNTS
    (91) IntTrsBoundProof [UPPER BOUND(ID), 67 ms]
    (92) CpxRNTS
    (93) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (94) CpxRNTS
    (95) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (96) CpxRNTS
    (97) IntTrsBoundProof [UPPER BOUND(ID), 145 ms]
    (98) CpxRNTS
    (99) IntTrsBoundProof [UPPER BOUND(ID), 2 ms]
    (100) CpxRNTS
    (101) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (102) CpxRNTS
    (103) IntTrsBoundProof [UPPER BOUND(ID), 103 ms]
    (104) CpxRNTS
    (105) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (106) CpxRNTS
    (107) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (108) CpxRNTS
    (109) IntTrsBoundProof [UPPER BOUND(ID), 156 ms]
    (110) CpxRNTS
    (111) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (112) CpxRNTS
    (113) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (114) CpxRNTS
    (115) IntTrsBoundProof [UPPER BOUND(ID), 87 ms]
    (116) CpxRNTS
    (117) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (118) CpxRNTS
    (119) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (120) CpxRNTS
    (121) IntTrsBoundProof [UPPER BOUND(ID), 207 ms]
    (122) CpxRNTS
    (123) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (124) CpxRNTS
    (125) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (126) CpxRNTS
    (127) IntTrsBoundProof [UPPER BOUND(ID), 87 ms]
    (128) CpxRNTS
    (129) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (130) CpxRNTS
    (131) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (132) CpxRNTS
    (133) IntTrsBoundProof [UPPER BOUND(ID), 197 ms]
    (134) CpxRNTS
    (135) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
    (136) CpxRNTS
    (137) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
    (138) CpxRNTS
    (139) IntTrsBoundProof [UPPER BOUND(ID), 65 ms]
    (140) CpxRNTS
    (141) IntTrsBoundProof [UPPER BOUND(ID), 2 ms]
    (142) CpxRNTS
    (143) FinalProof [FINISHED, 0 ms]
    (144) BOUNDS(1, n^10)
(145) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(146) TRS for Loop Detection
    (147) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (148) BEST
        (149) proven lower bound
            (150) LowerBoundPropagationProof [FINISHED, 0 ms]
            (151) BOUNDS(n^1, INF)
        (152) TRS for Loop Detection


----------------------------------------

(0)
Obligation:
The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^10).


The TRS R consists of the following rules:

   f_0(x) -> a
   f_1(x) -> g_1(x, x)
   g_1(s(x), y) -> b(f_0(y), g_1(x, y))
   f_2(x) -> g_2(x, x)
   g_2(s(x), y) -> b(f_1(y), g_2(x, y))
   f_3(x) -> g_3(x, x)
   g_3(s(x), y) -> b(f_2(y), g_3(x, y))
   f_4(x) -> g_4(x, x)
   g_4(s(x), y) -> b(f_3(y), g_4(x, y))
   f_5(x) -> g_5(x, x)
   g_5(s(x), y) -> b(f_4(y), g_5(x, y))
   f_6(x) -> g_6(x, x)
   g_6(s(x), y) -> b(f_5(y), g_6(x, y))
   f_7(x) -> g_7(x, x)
   g_7(s(x), y) -> b(f_6(y), g_7(x, y))
   f_8(x) -> g_8(x, x)
   g_8(s(x), y) -> b(f_7(y), g_8(x, y))
   f_9(x) -> g_9(x, x)
   g_9(s(x), y) -> b(f_8(y), g_9(x, y))
   f_10(x) -> g_10(x, x)
   g_10(s(x), y) -> b(f_9(y), g_10(x, y))

S is empty.
Rewrite Strategy: INNERMOST
----------------------------------------

(1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID))
Transformed relative TRS to weighted TRS
----------------------------------------

(2)
Obligation:
The Runtime Complexity (innermost) of the given CpxWeightedTrs could be proven to be BOUNDS(1, n^10).


The TRS R consists of the following rules:

   f_0(x) -> a [1]
   f_1(x) -> g_1(x, x) [1]
   g_1(s(x), y) -> b(f_0(y), g_1(x, y)) [1]
   f_2(x) -> g_2(x, x) [1]
   g_2(s(x), y) -> b(f_1(y), g_2(x, y)) [1]
   f_3(x) -> g_3(x, x) [1]
   g_3(s(x), y) -> b(f_2(y), g_3(x, y)) [1]
   f_4(x) -> g_4(x, x) [1]
   g_4(s(x), y) -> b(f_3(y), g_4(x, y)) [1]
   f_5(x) -> g_5(x, x) [1]
   g_5(s(x), y) -> b(f_4(y), g_5(x, y)) [1]
   f_6(x) -> g_6(x, x) [1]
   g_6(s(x), y) -> b(f_5(y), g_6(x, y)) [1]
   f_7(x) -> g_7(x, x) [1]
   g_7(s(x), y) -> b(f_6(y), g_7(x, y)) [1]
   f_8(x) -> g_8(x, x) [1]
   g_8(s(x), y) -> b(f_7(y), g_8(x, y)) [1]
   f_9(x) -> g_9(x, x) [1]
   g_9(s(x), y) -> b(f_8(y), g_9(x, y)) [1]
   f_10(x) -> g_10(x, x) [1]
   g_10(s(x), y) -> b(f_9(y), g_10(x, y)) [1]

Rewrite Strategy: INNERMOST
----------------------------------------

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID))
Infered types.
----------------------------------------

(4)
Obligation:
Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f_0(x) -> a [1]
   f_1(x) -> g_1(x, x) [1]
   g_1(s(x), y) -> b(f_0(y), g_1(x, y)) [1]
   f_2(x) -> g_2(x, x) [1]
   g_2(s(x), y) -> b(f_1(y), g_2(x, y)) [1]
   f_3(x) -> g_3(x, x) [1]
   g_3(s(x), y) -> b(f_2(y), g_3(x, y)) [1]
   f_4(x) -> g_4(x, x) [1]
   g_4(s(x), y) -> b(f_3(y), g_4(x, y)) [1]
   f_5(x) -> g_5(x, x) [1]
   g_5(s(x), y) -> b(f_4(y), g_5(x, y)) [1]
   f_6(x) -> g_6(x, x) [1]
   g_6(s(x), y) -> b(f_5(y), g_6(x, y)) [1]
   f_7(x) -> g_7(x, x) [1]
   g_7(s(x), y) -> b(f_6(y), g_7(x, y)) [1]
   f_8(x) -> g_8(x, x) [1]
   g_8(s(x), y) -> b(f_7(y), g_8(x, y)) [1]
   f_9(x) -> g_9(x, x) [1]
   g_9(s(x), y) -> b(f_8(y), g_9(x, y)) [1]
   f_10(x) -> g_10(x, x) [1]
   g_10(s(x), y) -> b(f_9(y), g_10(x, y)) [1]

The TRS has the following type information:
f_0 :: s -> a:b
a :: a:b
f_1 :: s -> a:b
g_1 :: s -> s -> a:b
s :: s -> s
b :: a:b -> a:b -> a:b
f_2 :: s -> a:b
g_2 :: s -> s -> a:b
f_3 :: s -> a:b
g_3 :: s -> s -> a:b
f_4 :: s -> a:b
g_4 :: s -> s -> a:b
f_5 :: s -> a:b
g_5 :: s -> s -> a:b
f_6 :: s -> a:b
g_6 :: s -> s -> a:b
f_7 :: s -> a:b
g_7 :: s -> s -> a:b
f_8 :: s -> a:b
g_8 :: s -> s -> a:b
f_9 :: s -> a:b
g_9 :: s -> s -> a:b
f_10 :: s -> a:b
g_10 :: s -> s -> a:b

Rewrite Strategy: INNERMOST
----------------------------------------

(5) CompletionProof (UPPER BOUND(ID))
The transformation into a RNTS is sound, since:

(a) The obligation is a constructor system where every type has a constant constructor,

(b) The following defined symbols do not have to be completely defined, as they can never occur inside other defined symbols:

   f_0_1
   f_1_1
   g_1_2
   f_2_1
   g_2_2
   f_3_1
   g_3_2
   f_4_1
   g_4_2
   f_5_1
   g_5_2
   f_6_1
   g_6_2
   f_7_1
   g_7_2
   f_8_1
   g_8_2
   f_9_1
   g_9_2
   f_10_1
   g_10_2

(c) The following functions are completely defined:
none

Due to the following rules being added:
none

And the following fresh constants:    const

----------------------------------------

(6)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f_0(x) -> a [1]
   f_1(x) -> g_1(x, x) [1]
   g_1(s(x), y) -> b(f_0(y), g_1(x, y)) [1]
   f_2(x) -> g_2(x, x) [1]
   g_2(s(x), y) -> b(f_1(y), g_2(x, y)) [1]
   f_3(x) -> g_3(x, x) [1]
   g_3(s(x), y) -> b(f_2(y), g_3(x, y)) [1]
   f_4(x) -> g_4(x, x) [1]
   g_4(s(x), y) -> b(f_3(y), g_4(x, y)) [1]
   f_5(x) -> g_5(x, x) [1]
   g_5(s(x), y) -> b(f_4(y), g_5(x, y)) [1]
   f_6(x) -> g_6(x, x) [1]
   g_6(s(x), y) -> b(f_5(y), g_6(x, y)) [1]
   f_7(x) -> g_7(x, x) [1]
   g_7(s(x), y) -> b(f_6(y), g_7(x, y)) [1]
   f_8(x) -> g_8(x, x) [1]
   g_8(s(x), y) -> b(f_7(y), g_8(x, y)) [1]
   f_9(x) -> g_9(x, x) [1]
   g_9(s(x), y) -> b(f_8(y), g_9(x, y)) [1]
   f_10(x) -> g_10(x, x) [1]
   g_10(s(x), y) -> b(f_9(y), g_10(x, y)) [1]

The TRS has the following type information:
f_0 :: s -> a:b
a :: a:b
f_1 :: s -> a:b
g_1 :: s -> s -> a:b
s :: s -> s
b :: a:b -> a:b -> a:b
f_2 :: s -> a:b
g_2 :: s -> s -> a:b
f_3 :: s -> a:b
g_3 :: s -> s -> a:b
f_4 :: s -> a:b
g_4 :: s -> s -> a:b
f_5 :: s -> a:b
g_5 :: s -> s -> a:b
f_6 :: s -> a:b
g_6 :: s -> s -> a:b
f_7 :: s -> a:b
g_7 :: s -> s -> a:b
f_8 :: s -> a:b
g_8 :: s -> s -> a:b
f_9 :: s -> a:b
g_9 :: s -> s -> a:b
f_10 :: s -> a:b
g_10 :: s -> s -> a:b
const :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(7) NarrowingProof (BOTH BOUNDS(ID, ID))
Narrowed the inner basic terms of all right-hand sides by a single narrowing step.
----------------------------------------

(8)
Obligation:
Runtime Complexity Weighted TRS where critical functions are completely defined. The underlying TRS is:

Runtime Complexity Weighted TRS with Types.
The TRS R consists of the following rules:

   f_0(x) -> a [1]
   f_1(x) -> g_1(x, x) [1]
   g_1(s(x), y) -> b(f_0(y), g_1(x, y)) [1]
   f_2(x) -> g_2(x, x) [1]
   g_2(s(x), y) -> b(f_1(y), g_2(x, y)) [1]
   f_3(x) -> g_3(x, x) [1]
   g_3(s(x), y) -> b(f_2(y), g_3(x, y)) [1]
   f_4(x) -> g_4(x, x) [1]
   g_4(s(x), y) -> b(f_3(y), g_4(x, y)) [1]
   f_5(x) -> g_5(x, x) [1]
   g_5(s(x), y) -> b(f_4(y), g_5(x, y)) [1]
   f_6(x) -> g_6(x, x) [1]
   g_6(s(x), y) -> b(f_5(y), g_6(x, y)) [1]
   f_7(x) -> g_7(x, x) [1]
   g_7(s(x), y) -> b(f_6(y), g_7(x, y)) [1]
   f_8(x) -> g_8(x, x) [1]
   g_8(s(x), y) -> b(f_7(y), g_8(x, y)) [1]
   f_9(x) -> g_9(x, x) [1]
   g_9(s(x), y) -> b(f_8(y), g_9(x, y)) [1]
   f_10(x) -> g_10(x, x) [1]
   g_10(s(x), y) -> b(f_9(y), g_10(x, y)) [1]

The TRS has the following type information:
f_0 :: s -> a:b
a :: a:b
f_1 :: s -> a:b
g_1 :: s -> s -> a:b
s :: s -> s
b :: a:b -> a:b -> a:b
f_2 :: s -> a:b
g_2 :: s -> s -> a:b
f_3 :: s -> a:b
g_3 :: s -> s -> a:b
f_4 :: s -> a:b
g_4 :: s -> s -> a:b
f_5 :: s -> a:b
g_5 :: s -> s -> a:b
f_6 :: s -> a:b
g_6 :: s -> s -> a:b
f_7 :: s -> a:b
g_7 :: s -> s -> a:b
f_8 :: s -> a:b
g_8 :: s -> s -> a:b
f_9 :: s -> a:b
g_9 :: s -> s -> a:b
f_10 :: s -> a:b
g_10 :: s -> s -> a:b
const :: s

Rewrite Strategy: INNERMOST
----------------------------------------

(9) CpxTypedWeightedTrsToRntsProof (UPPER BOUND(ID))
Transformed the TRS into an over-approximating RNTS by (improved) Size Abstraction.
The constant constructors are abstracted as follows:

   a => 0
   const => 0

----------------------------------------

(10)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: x >= 0, z = x
   f_1(z) -{ 1 }-> g_1(x, x) :|: x >= 0, z = x
   f_10(z) -{ 1 }-> g_10(x, x) :|: x >= 0, z = x
   f_2(z) -{ 1 }-> g_2(x, x) :|: x >= 0, z = x
   f_3(z) -{ 1 }-> g_3(x, x) :|: x >= 0, z = x
   f_4(z) -{ 1 }-> g_4(x, x) :|: x >= 0, z = x
   f_5(z) -{ 1 }-> g_5(x, x) :|: x >= 0, z = x
   f_6(z) -{ 1 }-> g_6(x, x) :|: x >= 0, z = x
   f_7(z) -{ 1 }-> g_7(x, x) :|: x >= 0, z = x
   f_8(z) -{ 1 }-> g_8(x, x) :|: x >= 0, z = x
   f_9(z) -{ 1 }-> g_9(x, x) :|: x >= 0, z = x
   g_1(z, z') -{ 1 }-> 1 + f_0(y) + g_1(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_10(z, z') -{ 1 }-> 1 + f_9(y) + g_10(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_2(z, z') -{ 1 }-> 1 + f_1(y) + g_2(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_3(z, z') -{ 1 }-> 1 + f_2(y) + g_3(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_4(z, z') -{ 1 }-> 1 + f_3(y) + g_4(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_5(z, z') -{ 1 }-> 1 + f_4(y) + g_5(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_6(z, z') -{ 1 }-> 1 + f_5(y) + g_6(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_7(z, z') -{ 1 }-> 1 + f_6(y) + g_7(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_8(z, z') -{ 1 }-> 1 + f_7(y) + g_8(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_9(z, z') -{ 1 }-> 1 + f_8(y) + g_9(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y


----------------------------------------

(11) InliningProof (UPPER BOUND(ID))
Inlined the following terminating rules on right-hand sides where appropriate:

   f_0(z) -{ 1 }-> 0 :|: x >= 0, z = x

----------------------------------------

(12)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: x >= 0, z = x
   f_1(z) -{ 1 }-> g_1(x, x) :|: x >= 0, z = x
   f_10(z) -{ 1 }-> g_10(x, x) :|: x >= 0, z = x
   f_2(z) -{ 1 }-> g_2(x, x) :|: x >= 0, z = x
   f_3(z) -{ 1 }-> g_3(x, x) :|: x >= 0, z = x
   f_4(z) -{ 1 }-> g_4(x, x) :|: x >= 0, z = x
   f_5(z) -{ 1 }-> g_5(x, x) :|: x >= 0, z = x
   f_6(z) -{ 1 }-> g_6(x, x) :|: x >= 0, z = x
   f_7(z) -{ 1 }-> g_7(x, x) :|: x >= 0, z = x
   f_8(z) -{ 1 }-> g_8(x, x) :|: x >= 0, z = x
   f_9(z) -{ 1 }-> g_9(x, x) :|: x >= 0, z = x
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y, x' >= 0, y = x'
   g_10(z, z') -{ 1 }-> 1 + f_9(y) + g_10(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_2(z, z') -{ 1 }-> 1 + f_1(y) + g_2(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_3(z, z') -{ 1 }-> 1 + f_2(y) + g_3(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_4(z, z') -{ 1 }-> 1 + f_3(y) + g_4(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_5(z, z') -{ 1 }-> 1 + f_4(y) + g_5(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_6(z, z') -{ 1 }-> 1 + f_5(y) + g_6(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_7(z, z') -{ 1 }-> 1 + f_6(y) + g_7(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_8(z, z') -{ 1 }-> 1 + f_7(y) + g_8(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y
   g_9(z, z') -{ 1 }-> 1 + f_8(y) + g_9(x, y) :|: x >= 0, y >= 0, z = 1 + x, z' = y


----------------------------------------

(13) SimplificationProof (BOTH BOUNDS(ID, ID))
Simplified the RNTS by moving equalities from the constraints into the right-hand sides.
----------------------------------------

(14)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 }-> g_1(z, z) :|: z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0


----------------------------------------

(15) CpxRntsAnalysisOrderProof (BOTH BOUNDS(ID, ID))
Found the following analysis order by SCC decomposition:

   { g_1 }
   { f_0 }
   { f_1 }
   { g_2 }
   { f_2 }
   { g_3 }
   { f_3 }
   { g_4 }
   { f_4 }
   { g_5 }
   { f_5 }
   { g_6 }
   { f_6 }
   { g_7 }
   { f_7 }
   { g_8 }
   { f_8 }
   { g_9 }
   { f_9 }
   { g_10 }
   { f_10 }

----------------------------------------

(16)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 }-> g_1(z, z) :|: z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_1}, {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}

----------------------------------------

(17) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(18)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 }-> g_1(z, z) :|: z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_1}, {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}

----------------------------------------

(19) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_1
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(20)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 }-> g_1(z, z) :|: z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_1}, {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: ?, size: O(1) [0]

----------------------------------------

(21) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: g_1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 2*z

----------------------------------------

(22)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 }-> g_1(z, z) :|: z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2 }-> 1 + 0 + g_1(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]

----------------------------------------

(23) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(24)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]

----------------------------------------

(25) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_0
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(26)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_0}, {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: ?, size: O(1) [0]

----------------------------------------

(27) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: f_0
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 1

----------------------------------------

(28)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]

----------------------------------------

(29) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(30)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]

----------------------------------------

(31) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_1
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(32)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_1}, {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: ?, size: O(1) [0]

----------------------------------------

(33) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: f_1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + 2*z

----------------------------------------

(34)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 1 }-> 1 + f_1(z') + g_2(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]

----------------------------------------

(35) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(36)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2 + 2*z' }-> 1 + s'' + g_2(z - 1, z') :|: s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]

----------------------------------------

(37) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_2
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(38)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2 + 2*z' }-> 1 + s'' + g_2(z - 1, z') :|: s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_2}, {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: ?, size: O(1) [0]

----------------------------------------

(39) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using CoFloCo for: g_2
after applying outer abstraction to obtain an ITS,
resulting in: O(n^2) with polynomial bound: 2*z + 2*z*z'

----------------------------------------

(40)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 }-> g_2(z, z) :|: z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2 + 2*z' }-> 1 + s'' + g_2(z - 1, z') :|: s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]

----------------------------------------

(41) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(42)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]

----------------------------------------

(43) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_2
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(44)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_2}, {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: ?, size: O(1) [0]

----------------------------------------

(45) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_2
after applying outer abstraction to obtain an ITS,
resulting in: O(n^2) with polynomial bound: 1 + 2*z + 2*z^2

----------------------------------------

(46)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 1 }-> 1 + f_2(z') + g_3(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]

----------------------------------------

(47) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(48)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2 + 2*z' + 2*z'^2 }-> 1 + s3 + g_3(z - 1, z') :|: s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]

----------------------------------------

(49) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_3
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(50)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2 + 2*z' + 2*z'^2 }-> 1 + s3 + g_3(z - 1, z') :|: s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_3}, {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: ?, size: O(1) [0]

----------------------------------------

(51) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_3
after applying outer abstraction to obtain an ITS,
resulting in: O(n^3) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2

----------------------------------------

(52)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 }-> g_3(z, z) :|: z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2 + 2*z' + 2*z'^2 }-> 1 + s3 + g_3(z - 1, z') :|: s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]

----------------------------------------

(53) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(54)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]

----------------------------------------

(55) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_3
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(56)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_3}, {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: ?, size: O(1) [0]

----------------------------------------

(57) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_3
after applying outer abstraction to obtain an ITS,
resulting in: O(n^3) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3

----------------------------------------

(58)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 1 }-> 1 + f_3(z') + g_4(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]

----------------------------------------

(59) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(60)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 }-> 1 + s6 + g_4(z - 1, z') :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]

----------------------------------------

(61) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_4
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(62)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 }-> 1 + s6 + g_4(z - 1, z') :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_4}, {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: ?, size: O(1) [0]

----------------------------------------

(63) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_4
after applying outer abstraction to obtain an ITS,
resulting in: O(n^4) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3

----------------------------------------

(64)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 }-> g_4(z, z) :|: z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 }-> 1 + s6 + g_4(z - 1, z') :|: s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]

----------------------------------------

(65) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(66)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]

----------------------------------------

(67) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_4
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(68)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_4}, {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: ?, size: O(1) [0]

----------------------------------------

(69) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_4
after applying outer abstraction to obtain an ITS,
resulting in: O(n^4) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4

----------------------------------------

(70)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 1 }-> 1 + f_4(z') + g_5(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]

----------------------------------------

(71) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(72)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 }-> 1 + s9 + g_5(z - 1, z') :|: s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]

----------------------------------------

(73) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_5
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(74)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 }-> 1 + s9 + g_5(z - 1, z') :|: s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_5}, {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: ?, size: O(1) [0]

----------------------------------------

(75) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_5
after applying outer abstraction to obtain an ITS,
resulting in: O(n^5) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4

----------------------------------------

(76)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 }-> g_5(z, z) :|: z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 }-> 1 + s9 + g_5(z - 1, z') :|: s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]

----------------------------------------

(77) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(78)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]

----------------------------------------

(79) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_5
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(80)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_5}, {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: ?, size: O(1) [0]

----------------------------------------

(81) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_5
after applying outer abstraction to obtain an ITS,
resulting in: O(n^5) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5

----------------------------------------

(82)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 1 }-> 1 + f_5(z') + g_6(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]

----------------------------------------

(83) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(84)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 }-> 1 + s12 + g_6(z - 1, z') :|: s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]

----------------------------------------

(85) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_6
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(86)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 }-> 1 + s12 + g_6(z - 1, z') :|: s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_6}, {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: ?, size: O(1) [0]

----------------------------------------

(87) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_6
after applying outer abstraction to obtain an ITS,
resulting in: O(n^6) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5

----------------------------------------

(88)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 }-> g_6(z, z) :|: z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 }-> 1 + s12 + g_6(z - 1, z') :|: s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]

----------------------------------------

(89) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(90)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]

----------------------------------------

(91) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_6
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(92)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_6}, {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: ?, size: O(1) [0]

----------------------------------------

(93) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_6
after applying outer abstraction to obtain an ITS,
resulting in: O(n^6) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6

----------------------------------------

(94)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 1 }-> 1 + f_6(z') + g_7(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]

----------------------------------------

(95) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(96)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 }-> 1 + s15 + g_7(z - 1, z') :|: s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]

----------------------------------------

(97) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_7
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(98)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 }-> 1 + s15 + g_7(z - 1, z') :|: s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_7}, {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: ?, size: O(1) [0]

----------------------------------------

(99) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_7
after applying outer abstraction to obtain an ITS,
resulting in: O(n^7) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6

----------------------------------------

(100)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 }-> g_7(z, z) :|: z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 }-> 1 + s15 + g_7(z - 1, z') :|: s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]

----------------------------------------

(101) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(102)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]

----------------------------------------

(103) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_7
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(104)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_7}, {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: ?, size: O(1) [0]

----------------------------------------

(105) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_7
after applying outer abstraction to obtain an ITS,
resulting in: O(n^7) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7

----------------------------------------

(106)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 1 }-> 1 + f_7(z') + g_8(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]

----------------------------------------

(107) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(108)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 }-> 1 + s18 + g_8(z - 1, z') :|: s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]

----------------------------------------

(109) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_8
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(110)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 }-> 1 + s18 + g_8(z - 1, z') :|: s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_8}, {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: ?, size: O(1) [0]

----------------------------------------

(111) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_8
after applying outer abstraction to obtain an ITS,
resulting in: O(n^8) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7

----------------------------------------

(112)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 }-> g_8(z, z) :|: z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 }-> 1 + s18 + g_8(z - 1, z') :|: s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]

----------------------------------------

(113) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(114)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]

----------------------------------------

(115) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_8
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(116)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_8}, {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: ?, size: O(1) [0]

----------------------------------------

(117) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_8
after applying outer abstraction to obtain an ITS,
resulting in: O(n^8) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8

----------------------------------------

(118)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 1 }-> 1 + f_8(z') + g_9(z - 1, z') :|: z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]

----------------------------------------

(119) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(120)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 }-> 1 + s21 + g_9(z - 1, z') :|: s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]

----------------------------------------

(121) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_9
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(122)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 }-> 1 + s21 + g_9(z - 1, z') :|: s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_9}, {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: ?, size: O(1) [0]

----------------------------------------

(123) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_9
after applying outer abstraction to obtain an ITS,
resulting in: O(n^9) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8

----------------------------------------

(124)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 }-> g_9(z, z) :|: z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 }-> 1 + s21 + g_9(z - 1, z') :|: s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]

----------------------------------------

(125) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(126)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]

----------------------------------------

(127) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_9
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(128)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_9}, {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: ?, size: O(1) [0]

----------------------------------------

(129) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_9
after applying outer abstraction to obtain an ITS,
resulting in: O(n^9) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9

----------------------------------------

(130)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 1 }-> 1 + f_9(z') + g_10(z - 1, z') :|: z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]

----------------------------------------

(131) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(132)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 + 2*z'^9 }-> 1 + s24 + g_10(z - 1, z') :|: s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]

----------------------------------------

(133) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: g_10
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(134)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 + 2*z'^9 }-> 1 + s24 + g_10(z - 1, z') :|: s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {g_10}, {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]
  g_10: runtime: ?, size: O(1) [0]

----------------------------------------

(135) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: g_10
after applying outer abstraction to obtain an ITS,
resulting in: O(n^10) with polynomial bound: 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9

----------------------------------------

(136)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 }-> g_10(z, z) :|: z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2 + 2*z' + 2*z'^2 + 2*z'^3 + 2*z'^4 + 2*z'^5 + 2*z'^6 + 2*z'^7 + 2*z'^8 + 2*z'^9 }-> 1 + s24 + g_10(z - 1, z') :|: s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]
  g_10: runtime: O(n^10) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9], size: O(1) [0]

----------------------------------------

(137) ResultPropagationProof (UPPER BOUND(ID))
Applied inner abstraction using the recently inferred runtime/size bounds where possible.
----------------------------------------

(138)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 + 2*z^10 }-> s25 :|: s25 >= 0, s25 <= 0, z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9 }-> 1 + s24 + s26 :|: s26 >= 0, s26 <= 0, s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]
  g_10: runtime: O(n^10) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9], size: O(1) [0]

----------------------------------------

(139) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: f_10
after applying outer abstraction to obtain an ITS,
resulting in: O(1) with polynomial bound: 0

----------------------------------------

(140)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 + 2*z^10 }-> s25 :|: s25 >= 0, s25 <= 0, z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9 }-> 1 + s24 + s26 :|: s26 >= 0, s26 <= 0, s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: {f_10}
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]
  g_10: runtime: O(n^10) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9], size: O(1) [0]
  f_10: runtime: ?, size: O(1) [0]

----------------------------------------

(141) IntTrsBoundProof (UPPER BOUND(ID))

Computed RUNTIME bound using KoAT for: f_10
after applying outer abstraction to obtain an ITS,
resulting in: O(n^10) with polynomial bound: 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 + 2*z^10

----------------------------------------

(142)
Obligation:
Complexity RNTS consisting of the following rules:

   f_0(z) -{ 1 }-> 0 :|: z >= 0
   f_1(z) -{ 1 + 2*z }-> s :|: s >= 0, s <= 0, z >= 0
   f_10(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 + 2*z^10 }-> s25 :|: s25 >= 0, s25 <= 0, z >= 0
   f_2(z) -{ 1 + 2*z + 2*z^2 }-> s1 :|: s1 >= 0, s1 <= 0, z >= 0
   f_3(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 }-> s4 :|: s4 >= 0, s4 <= 0, z >= 0
   f_4(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 }-> s7 :|: s7 >= 0, s7 <= 0, z >= 0
   f_5(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 }-> s10 :|: s10 >= 0, s10 <= 0, z >= 0
   f_6(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 }-> s13 :|: s13 >= 0, s13 <= 0, z >= 0
   f_7(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 }-> s16 :|: s16 >= 0, s16 <= 0, z >= 0
   f_8(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 }-> s19 :|: s19 >= 0, s19 <= 0, z >= 0
   f_9(z) -{ 1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 }-> s22 :|: s22 >= 0, s22 <= 0, z >= 0
   g_1(z, z') -{ 2*z }-> 1 + 0 + s' :|: s' >= 0, s' <= 0, z - 1 >= 0, z' >= 0
   g_10(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9 }-> 1 + s24 + s26 :|: s26 >= 0, s26 <= 0, s24 >= 0, s24 <= 0, z - 1 >= 0, z' >= 0
   g_2(z, z') -{ 2*z + 2*z*z' }-> 1 + s'' + s2 :|: s2 >= 0, s2 <= 0, s'' >= 0, s'' <= 0, z - 1 >= 0, z' >= 0
   g_3(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 }-> 1 + s3 + s5 :|: s5 >= 0, s5 <= 0, s3 >= 0, s3 <= 0, z - 1 >= 0, z' >= 0
   g_4(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 }-> 1 + s6 + s8 :|: s8 >= 0, s8 <= 0, s6 >= 0, s6 <= 0, z - 1 >= 0, z' >= 0
   g_5(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 }-> 1 + s9 + s11 :|: s11 >= 0, s11 <= 0, s9 >= 0, s9 <= 0, z - 1 >= 0, z' >= 0
   g_6(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 }-> 1 + s12 + s14 :|: s14 >= 0, s14 <= 0, s12 >= 0, s12 <= 0, z - 1 >= 0, z' >= 0
   g_7(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 }-> 1 + s15 + s17 :|: s17 >= 0, s17 <= 0, s15 >= 0, s15 <= 0, z - 1 >= 0, z' >= 0
   g_8(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 }-> 1 + s18 + s20 :|: s20 >= 0, s20 <= 0, s18 >= 0, s18 <= 0, z - 1 >= 0, z' >= 0
   g_9(z, z') -{ 2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 }-> 1 + s21 + s23 :|: s23 >= 0, s23 <= 0, s21 >= 0, s21 <= 0, z - 1 >= 0, z' >= 0

Function symbols to be analyzed: 
Previous analysis results are:
  g_1: runtime: O(n^1) [2*z], size: O(1) [0]
  f_0: runtime: O(1) [1], size: O(1) [0]
  f_1: runtime: O(n^1) [1 + 2*z], size: O(1) [0]
  g_2: runtime: O(n^2) [2*z + 2*z*z'], size: O(1) [0]
  f_2: runtime: O(n^2) [1 + 2*z + 2*z^2], size: O(1) [0]
  g_3: runtime: O(n^3) [2*z + 2*z*z' + 2*z*z'^2], size: O(1) [0]
  f_3: runtime: O(n^3) [1 + 2*z + 2*z^2 + 2*z^3], size: O(1) [0]
  g_4: runtime: O(n^4) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3], size: O(1) [0]
  f_4: runtime: O(n^4) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4], size: O(1) [0]
  g_5: runtime: O(n^5) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4], size: O(1) [0]
  f_5: runtime: O(n^5) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5], size: O(1) [0]
  g_6: runtime: O(n^6) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5], size: O(1) [0]
  f_6: runtime: O(n^6) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6], size: O(1) [0]
  g_7: runtime: O(n^7) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6], size: O(1) [0]
  f_7: runtime: O(n^7) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7], size: O(1) [0]
  g_8: runtime: O(n^8) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7], size: O(1) [0]
  f_8: runtime: O(n^8) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8], size: O(1) [0]
  g_9: runtime: O(n^9) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8], size: O(1) [0]
  f_9: runtime: O(n^9) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9], size: O(1) [0]
  g_10: runtime: O(n^10) [2*z + 2*z*z' + 2*z*z'^2 + 2*z*z'^3 + 2*z*z'^4 + 2*z*z'^5 + 2*z*z'^6 + 2*z*z'^7 + 2*z*z'^8 + 2*z*z'^9], size: O(1) [0]
  f_10: runtime: O(n^10) [1 + 2*z + 2*z^2 + 2*z^3 + 2*z^4 + 2*z^5 + 2*z^6 + 2*z^7 + 2*z^8 + 2*z^9 + 2*z^10], size: O(1) [0]

----------------------------------------

(143) FinalProof (FINISHED)
Computed overall runtime complexity
----------------------------------------

(144)
BOUNDS(1, n^10)

----------------------------------------

(145) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
Transformed a relative TRS into a decreasing-loop problem.
----------------------------------------

(146)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^10).


The TRS R consists of the following rules:

   f_0(x) -> a
   f_1(x) -> g_1(x, x)
   g_1(s(x), y) -> b(f_0(y), g_1(x, y))
   f_2(x) -> g_2(x, x)
   g_2(s(x), y) -> b(f_1(y), g_2(x, y))
   f_3(x) -> g_3(x, x)
   g_3(s(x), y) -> b(f_2(y), g_3(x, y))
   f_4(x) -> g_4(x, x)
   g_4(s(x), y) -> b(f_3(y), g_4(x, y))
   f_5(x) -> g_5(x, x)
   g_5(s(x), y) -> b(f_4(y), g_5(x, y))
   f_6(x) -> g_6(x, x)
   g_6(s(x), y) -> b(f_5(y), g_6(x, y))
   f_7(x) -> g_7(x, x)
   g_7(s(x), y) -> b(f_6(y), g_7(x, y))
   f_8(x) -> g_8(x, x)
   g_8(s(x), y) -> b(f_7(y), g_8(x, y))
   f_9(x) -> g_9(x, x)
   g_9(s(x), y) -> b(f_8(y), g_9(x, y))
   f_10(x) -> g_10(x, x)
   g_10(s(x), y) -> b(f_9(y), g_10(x, y))

S is empty.
Rewrite Strategy: INNERMOST
----------------------------------------

(147) DecreasingLoopProof (LOWER BOUND(ID))
The following loop(s) give(s) rise to the lower bound Omega(n^1):

The rewrite sequence

g_2(s(x), y) ->^+ b(f_1(y), g_2(x, y))

gives rise to a decreasing loop by considering the right hand sides subterm at position [1].

The pumping substitution is [x / s(x)].

The result substitution is [ ].




----------------------------------------

(148)
Complex Obligation (BEST)

----------------------------------------

(149)
Obligation:
Proved the lower bound n^1 for the following obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^10).


The TRS R consists of the following rules:

   f_0(x) -> a
   f_1(x) -> g_1(x, x)
   g_1(s(x), y) -> b(f_0(y), g_1(x, y))
   f_2(x) -> g_2(x, x)
   g_2(s(x), y) -> b(f_1(y), g_2(x, y))
   f_3(x) -> g_3(x, x)
   g_3(s(x), y) -> b(f_2(y), g_3(x, y))
   f_4(x) -> g_4(x, x)
   g_4(s(x), y) -> b(f_3(y), g_4(x, y))
   f_5(x) -> g_5(x, x)
   g_5(s(x), y) -> b(f_4(y), g_5(x, y))
   f_6(x) -> g_6(x, x)
   g_6(s(x), y) -> b(f_5(y), g_6(x, y))
   f_7(x) -> g_7(x, x)
   g_7(s(x), y) -> b(f_6(y), g_7(x, y))
   f_8(x) -> g_8(x, x)
   g_8(s(x), y) -> b(f_7(y), g_8(x, y))
   f_9(x) -> g_9(x, x)
   g_9(s(x), y) -> b(f_8(y), g_9(x, y))
   f_10(x) -> g_10(x, x)
   g_10(s(x), y) -> b(f_9(y), g_10(x, y))

S is empty.
Rewrite Strategy: INNERMOST
----------------------------------------

(150) LowerBoundPropagationProof (FINISHED)
Propagated lower bound.
----------------------------------------

(151)
BOUNDS(n^1, INF)

----------------------------------------

(152)
Obligation:
Analyzing the following TRS for decreasing loops:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^10).


The TRS R consists of the following rules:

   f_0(x) -> a
   f_1(x) -> g_1(x, x)
   g_1(s(x), y) -> b(f_0(y), g_1(x, y))
   f_2(x) -> g_2(x, x)
   g_2(s(x), y) -> b(f_1(y), g_2(x, y))
   f_3(x) -> g_3(x, x)
   g_3(s(x), y) -> b(f_2(y), g_3(x, y))
   f_4(x) -> g_4(x, x)
   g_4(s(x), y) -> b(f_3(y), g_4(x, y))
   f_5(x) -> g_5(x, x)
   g_5(s(x), y) -> b(f_4(y), g_5(x, y))
   f_6(x) -> g_6(x, x)
   g_6(s(x), y) -> b(f_5(y), g_6(x, y))
   f_7(x) -> g_7(x, x)
   g_7(s(x), y) -> b(f_6(y), g_7(x, y))
   f_8(x) -> g_8(x, x)
   g_8(s(x), y) -> b(f_7(y), g_8(x, y))
   f_9(x) -> g_9(x, x)
   g_9(s(x), y) -> b(f_8(y), g_9(x, y))
   f_10(x) -> g_10(x, x)
   g_10(s(x), y) -> b(f_9(y), g_10(x, y))

S is empty.
Rewrite Strategy: INNERMOST