WORST_CASE(?,O(n^2))
proof of input_TiPIomoI9R.trs
# AProVE Commit ID: 5b976082cb74a395683ed8cc7acf94bd611ab29f fuhs 20230524 unpublished


The Runtime Complexity (parallel-innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, n^2).

(0) CpxRelTRS
(1) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 234 ms]
(2) CpxRelTRS
(3) CpxTrsToCdtProof [UPPER BOUND(ID), 0 ms]
(4) CdtProblem
(5) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms]
(6) CdtProblem
(7) CdtRhsSimplificationProcessorProof [BOTH BOUNDS(ID, ID), 0 ms]
(8) CdtProblem
(9) CdtKnowledgeProof [BOTH BOUNDS(ID, ID), 0 ms]
(10) CdtProblem
(11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms]
(12) CdtProblem
(13) CdtToCpxRelTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
(14) CpxRelTRS
(15) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
(16) CpxWeightedTrs
(17) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
(18) CpxTypedWeightedTrs
(19) CompletionProof [UPPER BOUND(ID), 0 ms]
(20) CpxTypedWeightedCompleteTrs
(21) NarrowingProof [BOTH BOUNDS(ID, ID), 9 ms]
(22) CpxTypedWeightedCompleteTrs
(23) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
(24) CpxRNTS
(25) InliningProof [UPPER BOUND(ID), 989 ms]
(26) CpxRNTS
(27) SimplificationProof [BOTH BOUNDS(ID, ID), 6 ms]
(28) CpxRNTS
(29) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms]
(30) CpxRNTS
(31) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(32) CpxRNTS
(33) IntTrsBoundProof [UPPER BOUND(ID), 150 ms]
(34) CpxRNTS
(35) IntTrsBoundProof [UPPER BOUND(ID), 14 ms]
(36) CpxRNTS
(37) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(38) CpxRNTS
(39) IntTrsBoundProof [UPPER BOUND(ID), 906 ms]
(40) CpxRNTS
(41) IntTrsBoundProof [UPPER BOUND(ID), 225 ms]
(42) CpxRNTS
(43) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(44) CpxRNTS
(45) IntTrsBoundProof [UPPER BOUND(ID), 430 ms]
(46) CpxRNTS
(47) IntTrsBoundProof [UPPER BOUND(ID), 144 ms]
(48) CpxRNTS
(49) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(50) CpxRNTS
(51) IntTrsBoundProof [UPPER BOUND(ID), 167 ms]
(52) CpxRNTS
(53) IntTrsBoundProof [UPPER BOUND(ID), 23 ms]
(54) CpxRNTS
(55) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(56) CpxRNTS
(57) IntTrsBoundProof [UPPER BOUND(ID), 580 ms]
(58) CpxRNTS
(59) IntTrsBoundProof [UPPER BOUND(ID), 119 ms]
(60) CpxRNTS
(61) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(62) CpxRNTS
(63) IntTrsBoundProof [UPPER BOUND(ID), 1753 ms]
(64) CpxRNTS
(65) IntTrsBoundProof [UPPER BOUND(ID), 215 ms]
(66) CpxRNTS
(67) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(68) CpxRNTS
(69) IntTrsBoundProof [UPPER BOUND(ID), 1542 ms]
(70) CpxRNTS
(71) IntTrsBoundProof [UPPER BOUND(ID), 293 ms]
(72) CpxRNTS
(73) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(74) CpxRNTS
(75) IntTrsBoundProof [UPPER BOUND(ID), 186 ms]
(76) CpxRNTS
(77) IntTrsBoundProof [UPPER BOUND(ID), 42 ms]
(78) CpxRNTS
(79) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(80) CpxRNTS
(81) IntTrsBoundProof [UPPER BOUND(ID), 191 ms]
(82) CpxRNTS
(83) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
(84) CpxRNTS
(85) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(86) CpxRNTS
(87) IntTrsBoundProof [UPPER BOUND(ID), 289 ms]
(88) CpxRNTS
(89) IntTrsBoundProof [UPPER BOUND(ID), 33 ms]
(90) CpxRNTS
(91) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(92) CpxRNTS
(93) IntTrsBoundProof [UPPER BOUND(ID), 208 ms]
(94) CpxRNTS
(95) IntTrsBoundProof [UPPER BOUND(ID), 5 ms]
(96) CpxRNTS
(97) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(98) CpxRNTS
(99) IntTrsBoundProof [UPPER BOUND(ID), 816 ms]
(100) CpxRNTS
(101) IntTrsBoundProof [UPPER BOUND(ID), 324 ms]
(102) CpxRNTS
(103) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(104) CpxRNTS
(105) IntTrsBoundProof [UPPER BOUND(ID), 653 ms]
(106) CpxRNTS
(107) IntTrsBoundProof [UPPER BOUND(ID), 272 ms]
(108) CpxRNTS
(109) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(110) CpxRNTS
(111) IntTrsBoundProof [UPPER BOUND(ID), 46 ms]
(112) CpxRNTS
(113) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
(114) CpxRNTS
(115) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(116) CpxRNTS
(117) IntTrsBoundProof [UPPER BOUND(ID), 371 ms]
(118) CpxRNTS
(119) IntTrsBoundProof [UPPER BOUND(ID), 115 ms]
(120) CpxRNTS
(121) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(122) CpxRNTS
(123) IntTrsBoundProof [UPPER BOUND(ID), 26 ms]
(124) CpxRNTS
(125) IntTrsBoundProof [UPPER BOUND(ID), 21 ms]
(126) CpxRNTS
(127) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(128) CpxRNTS
(129) IntTrsBoundProof [UPPER BOUND(ID), 280 ms]
(130) CpxRNTS
(131) IntTrsBoundProof [UPPER BOUND(ID), 154 ms]
(132) CpxRNTS
(133) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(134) CpxRNTS
(135) IntTrsBoundProof [UPPER BOUND(ID), 179 ms]
(136) CpxRNTS
(137) IntTrsBoundProof [UPPER BOUND(ID), 34 ms]
(138) CpxRNTS
(139) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
(140) CpxRNTS
(141) IntTrsBoundProof [UPPER BOUND(ID), 170 ms]
(142) CpxRNTS
(143) IntTrsBoundProof [UPPER BOUND(ID), 3 ms]
(144) CpxRNTS
(145) FinalProof [FINISHED, 0 ms]
(146) BOUNDS(1, n^2)


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

(0)
Obligation:
The Runtime Complexity (parallel-innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

   #abs(#0) -> #0
   #abs(#neg(@x)) -> #pos(@x)
   #abs(#pos(@x)) -> #pos(@x)
   #abs(#s(@x)) -> #pos(#s(@x))
   #less(@x, @y) -> #cklt(#compare(@x, @y))
   insert(@x, @l) -> insert#1(@l, @x)
   insert#1(::(@y, @ys), @x) -> insert#2(#less(@y, @x), @x, @y, @ys)
   insert#1(nil, @x) -> ::(@x, nil)
   insert#2(#false, @x, @y, @ys) -> ::(@x, ::(@y, @ys))
   insert#2(#true, @x, @y, @ys) -> ::(@y, insert(@x, @ys))
   insertD(@x, @l) -> insertD#1(@l, @x)
   insertD#1(::(@y, @ys), @x) -> insertD#2(#less(@y, @x), @x, @y, @ys)
   insertD#1(nil, @x) -> ::(@x, nil)
   insertD#2(#false, @x, @y, @ys) -> ::(@x, ::(@y, @ys))
   insertD#2(#true, @x, @y, @ys) -> ::(@y, insertD(@x, @ys))
   insertionsort(@l) -> insertionsort#1(@l)
   insertionsort#1(::(@x, @xs)) -> insert(@x, insertionsort(@xs))
   insertionsort#1(nil) -> nil
   insertionsortD(@l) -> insertionsortD#1(@l)
   insertionsortD#1(::(@x, @xs)) -> insertD(@x, insertionsortD(@xs))
   insertionsortD#1(nil) -> nil
   testInsertionsort(@x) -> insertionsort(testList(#unit))
   testInsertionsortD(@x) -> insertionsortD(testList(#unit))
   testList(@_) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))

The (relative) TRS S consists of the following rules:

   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(@y)) -> #GT
   #compare(#0, #pos(@y)) -> #LT
   #compare(#0, #s(@y)) -> #LT
   #compare(#neg(@x), #0) -> #LT
   #compare(#neg(@x), #neg(@y)) -> #compare(@y, @x)
   #compare(#neg(@x), #pos(@y)) -> #LT
   #compare(#pos(@x), #0) -> #GT
   #compare(#pos(@x), #neg(@y)) -> #GT
   #compare(#pos(@x), #pos(@y)) -> #compare(@x, @y)
   #compare(#s(@x), #0) -> #GT
   #compare(#s(@x), #s(@y)) -> #compare(@x, @y)

Rewrite Strategy: PARALLEL_INNERMOST
----------------------------------------

(1) SInnermostTerminationProof (BOTH CONCRETE BOUNDS(ID, ID))
proved innermost termination of relative rules
----------------------------------------

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


The TRS R consists of the following rules:

   #abs(#0) -> #0
   #abs(#neg(@x)) -> #pos(@x)
   #abs(#pos(@x)) -> #pos(@x)
   #abs(#s(@x)) -> #pos(#s(@x))
   #less(@x, @y) -> #cklt(#compare(@x, @y))
   insert(@x, @l) -> insert#1(@l, @x)
   insert#1(::(@y, @ys), @x) -> insert#2(#less(@y, @x), @x, @y, @ys)
   insert#1(nil, @x) -> ::(@x, nil)
   insert#2(#false, @x, @y, @ys) -> ::(@x, ::(@y, @ys))
   insert#2(#true, @x, @y, @ys) -> ::(@y, insert(@x, @ys))
   insertD(@x, @l) -> insertD#1(@l, @x)
   insertD#1(::(@y, @ys), @x) -> insertD#2(#less(@y, @x), @x, @y, @ys)
   insertD#1(nil, @x) -> ::(@x, nil)
   insertD#2(#false, @x, @y, @ys) -> ::(@x, ::(@y, @ys))
   insertD#2(#true, @x, @y, @ys) -> ::(@y, insertD(@x, @ys))
   insertionsort(@l) -> insertionsort#1(@l)
   insertionsort#1(::(@x, @xs)) -> insert(@x, insertionsort(@xs))
   insertionsort#1(nil) -> nil
   insertionsortD(@l) -> insertionsortD#1(@l)
   insertionsortD#1(::(@x, @xs)) -> insertD(@x, insertionsortD(@xs))
   insertionsortD#1(nil) -> nil
   testInsertionsort(@x) -> insertionsort(testList(#unit))
   testInsertionsortD(@x) -> insertionsortD(testList(#unit))
   testList(@_) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))

The (relative) TRS S consists of the following rules:

   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(@y)) -> #GT
   #compare(#0, #pos(@y)) -> #LT
   #compare(#0, #s(@y)) -> #LT
   #compare(#neg(@x), #0) -> #LT
   #compare(#neg(@x), #neg(@y)) -> #compare(@y, @x)
   #compare(#neg(@x), #pos(@y)) -> #LT
   #compare(#pos(@x), #0) -> #GT
   #compare(#pos(@x), #neg(@y)) -> #GT
   #compare(#pos(@x), #pos(@y)) -> #compare(@x, @y)
   #compare(#s(@x), #0) -> #GT
   #compare(#s(@x), #s(@y)) -> #compare(@x, @y)

Rewrite Strategy: PARALLEL_INNERMOST
----------------------------------------

(3) CpxTrsToCdtProof (UPPER BOUND(ID))
Converted Cpx (relative) TRS with rewrite strategy PARALLEL_INNERMOST to CDT
----------------------------------------

(4)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   #abs(#0) -> #0
   #abs(#neg(z0)) -> #pos(z0)
   #abs(#pos(z0)) -> #pos(z0)
   #abs(#s(z0)) -> #pos(#s(z0))
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   testInsertionsort(z0) -> insertionsort(testList(#unit))
   testInsertionsortD(z0) -> insertionsortD(testList(#unit))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
Tuples:
   #CKLT(#EQ) -> c
   #CKLT(#GT) -> c1
   #CKLT(#LT) -> c2
   #COMPARE(#0, #0) -> c3
   #COMPARE(#0, #neg(z0)) -> c4
   #COMPARE(#0, #pos(z0)) -> c5
   #COMPARE(#0, #s(z0)) -> c6
   #COMPARE(#neg(z0), #0) -> c7
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#neg(z0), #pos(z1)) -> c9
   #COMPARE(#pos(z0), #0) -> c10
   #COMPARE(#pos(z0), #neg(z1)) -> c11
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #0) -> c13
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   #ABS(#0) -> c15
   #ABS(#neg(z0)) -> c16
   #ABS(#pos(z0)) -> c17
   #ABS(#s(z0)) -> c18
   #LESS(z0, z1) -> c19(#CKLT(#compare(z0, z1)), #COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#1(nil, z0) -> c22
   INSERT#2(#false, z0, z1, z2) -> c23
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#1(nil, z0) -> c27
   INSERTD#2(#false, z0, z1, z2) -> c28
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORT#1(nil) -> c32
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   INSERTIONSORTD#1(nil) -> c35
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)), TESTLIST(#unit))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)), TESTLIST(#unit))
   TESTLIST(z0) -> c38(#ABS(#0))
   TESTLIST(z0) -> c39(#ABS(#pos(#s(#s(#s(#s(#0)))))))
   TESTLIST(z0) -> c40(#ABS(#pos(#s(#s(#s(#s(#s(#0))))))))
   TESTLIST(z0) -> c41(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))))
   TESTLIST(z0) -> c42(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))))
   TESTLIST(z0) -> c43(#ABS(#pos(#s(#0))))
   TESTLIST(z0) -> c44(#ABS(#pos(#s(#s(#0)))))
   TESTLIST(z0) -> c45(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))))
   TESTLIST(z0) -> c46(#ABS(#pos(#s(#s(#s(#s(#s(#s(#0)))))))))
   TESTLIST(z0) -> c47(#ABS(#pos(#s(#s(#s(#0))))))
S tuples:
   #ABS(#0) -> c15
   #ABS(#neg(z0)) -> c16
   #ABS(#pos(z0)) -> c17
   #ABS(#s(z0)) -> c18
   #LESS(z0, z1) -> c19(#CKLT(#compare(z0, z1)), #COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#1(nil, z0) -> c22
   INSERT#2(#false, z0, z1, z2) -> c23
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#1(nil, z0) -> c27
   INSERTD#2(#false, z0, z1, z2) -> c28
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORT#1(nil) -> c32
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   INSERTIONSORTD#1(nil) -> c35
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)), TESTLIST(#unit))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)), TESTLIST(#unit))
   TESTLIST(z0) -> c38(#ABS(#0))
   TESTLIST(z0) -> c39(#ABS(#pos(#s(#s(#s(#s(#0)))))))
   TESTLIST(z0) -> c40(#ABS(#pos(#s(#s(#s(#s(#s(#0))))))))
   TESTLIST(z0) -> c41(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))))
   TESTLIST(z0) -> c42(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))))
   TESTLIST(z0) -> c43(#ABS(#pos(#s(#0))))
   TESTLIST(z0) -> c44(#ABS(#pos(#s(#s(#0)))))
   TESTLIST(z0) -> c45(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))))
   TESTLIST(z0) -> c46(#ABS(#pos(#s(#s(#s(#s(#s(#s(#0)))))))))
   TESTLIST(z0) -> c47(#ABS(#pos(#s(#s(#s(#0))))))
K tuples:none
Defined Rule Symbols:   #abs_1, #less_2, insert_2, insert#1_2, insert#2_4, insertD_2, insertD#1_2, insertD#2_4, insertionsort_1, insertionsort#1_1, insertionsortD_1, insertionsortD#1_1, testInsertionsort_1, testInsertionsortD_1, testList_1, #cklt_1, #compare_2

Defined Pair Symbols:   #CKLT_1, #COMPARE_2, #ABS_1, #LESS_2, INSERT_2, INSERT#1_2, INSERT#2_4, INSERTD_2, INSERTD#1_2, INSERTD#2_4, INSERTIONSORT_1, INSERTIONSORT#1_1, INSERTIONSORTD_1, INSERTIONSORTD#1_1, TESTINSERTIONSORT_1, TESTINSERTIONSORTD_1, TESTLIST_1

Compound Symbols:   c, c1, c2, c3, c4, c5, c6, c7, c8_1, c9, c10, c11, c12_1, c13, c14_1, c15, c16, c17, c18, c19_2, c20_1, c21_2, c22, c23, c24_1, c25_1, c26_2, c27, c28, c29_1, c30_1, c31_2, c32, c33_1, c34_2, c35, c36_2, c37_2, c38_1, c39_1, c40_1, c41_1, c42_1, c43_1, c44_1, c45_1, c46_1, c47_1


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

(5) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))
Removed 32 trailing nodes:
   INSERT#2(#false, z0, z1, z2) -> c23
   #ABS(#pos(z0)) -> c17
   #COMPARE(#pos(z0), #0) -> c10
   #COMPARE(#s(z0), #0) -> c13
   #CKLT(#GT) -> c1
   #CKLT(#LT) -> c2
   TESTLIST(z0) -> c41(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))))
   TESTLIST(z0) -> c45(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))))
   #COMPARE(#0, #0) -> c3
   TESTLIST(z0) -> c38(#ABS(#0))
   #COMPARE(#neg(z0), #pos(z1)) -> c9
   INSERTD#1(nil, z0) -> c27
   TESTLIST(z0) -> c43(#ABS(#pos(#s(#0))))
   INSERT#1(nil, z0) -> c22
   #ABS(#s(z0)) -> c18
   #COMPARE(#0, #neg(z0)) -> c4
   TESTLIST(z0) -> c42(#ABS(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))))
   #CKLT(#EQ) -> c
   #COMPARE(#0, #pos(z0)) -> c5
   INSERTD#2(#false, z0, z1, z2) -> c28
   TESTLIST(z0) -> c47(#ABS(#pos(#s(#s(#s(#0))))))
   #COMPARE(#pos(z0), #neg(z1)) -> c11
   INSERTIONSORT#1(nil) -> c32
   #ABS(#0) -> c15
   TESTLIST(z0) -> c39(#ABS(#pos(#s(#s(#s(#s(#0)))))))
   TESTLIST(z0) -> c44(#ABS(#pos(#s(#s(#0)))))
   #COMPARE(#neg(z0), #0) -> c7
   #ABS(#neg(z0)) -> c16
   TESTLIST(z0) -> c40(#ABS(#pos(#s(#s(#s(#s(#s(#0))))))))
   TESTLIST(z0) -> c46(#ABS(#pos(#s(#s(#s(#s(#s(#s(#0)))))))))
   #COMPARE(#0, #s(z0)) -> c6
   INSERTIONSORTD#1(nil) -> c35

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

(6)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   #abs(#0) -> #0
   #abs(#neg(z0)) -> #pos(z0)
   #abs(#pos(z0)) -> #pos(z0)
   #abs(#s(z0)) -> #pos(#s(z0))
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   testInsertionsort(z0) -> insertionsort(testList(#unit))
   testInsertionsortD(z0) -> insertionsortD(testList(#unit))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
Tuples:
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   #LESS(z0, z1) -> c19(#CKLT(#compare(z0, z1)), #COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)), TESTLIST(#unit))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)), TESTLIST(#unit))
S tuples:
   #LESS(z0, z1) -> c19(#CKLT(#compare(z0, z1)), #COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)), TESTLIST(#unit))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)), TESTLIST(#unit))
K tuples:none
Defined Rule Symbols:   #abs_1, #less_2, insert_2, insert#1_2, insert#2_4, insertD_2, insertD#1_2, insertD#2_4, insertionsort_1, insertionsort#1_1, insertionsortD_1, insertionsortD#1_1, testInsertionsort_1, testInsertionsortD_1, testList_1, #cklt_1, #compare_2

Defined Pair Symbols:   #COMPARE_2, #LESS_2, INSERT_2, INSERT#1_2, INSERT#2_4, INSERTD_2, INSERTD#1_2, INSERTD#2_4, INSERTIONSORT_1, INSERTIONSORT#1_1, INSERTIONSORTD_1, INSERTIONSORTD#1_1, TESTINSERTIONSORT_1, TESTINSERTIONSORTD_1

Compound Symbols:   c8_1, c12_1, c14_1, c19_2, c20_1, c21_2, c24_1, c25_1, c26_2, c29_1, c30_1, c31_2, c33_1, c34_2, c36_2, c37_2


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

(7) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID))
Removed 3 trailing tuple parts
----------------------------------------

(8)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   #abs(#0) -> #0
   #abs(#neg(z0)) -> #pos(z0)
   #abs(#pos(z0)) -> #pos(z0)
   #abs(#s(z0)) -> #pos(#s(z0))
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   testInsertionsort(z0) -> insertionsort(testList(#unit))
   testInsertionsortD(z0) -> insertionsortD(testList(#unit))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
Tuples:
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
S tuples:
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
K tuples:none
Defined Rule Symbols:   #abs_1, #less_2, insert_2, insert#1_2, insert#2_4, insertD_2, insertD#1_2, insertD#2_4, insertionsort_1, insertionsort#1_1, insertionsortD_1, insertionsortD#1_1, testInsertionsort_1, testInsertionsortD_1, testList_1, #cklt_1, #compare_2

Defined Pair Symbols:   #COMPARE_2, INSERT_2, INSERT#1_2, INSERT#2_4, INSERTD_2, INSERTD#1_2, INSERTD#2_4, INSERTIONSORT_1, INSERTIONSORT#1_1, INSERTIONSORTD_1, INSERTIONSORTD#1_1, #LESS_2, TESTINSERTIONSORT_1, TESTINSERTIONSORTD_1

Compound Symbols:   c8_1, c12_1, c14_1, c20_1, c21_2, c24_1, c25_1, c26_2, c29_1, c30_1, c31_2, c33_1, c34_2, c19_1, c36_1, c37_1


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

(9) CdtKnowledgeProof (BOTH BOUNDS(ID, ID))
The following tuples could be moved from S to K by knowledge propagation:
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))

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

(10)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   #abs(#0) -> #0
   #abs(#neg(z0)) -> #pos(z0)
   #abs(#pos(z0)) -> #pos(z0)
   #abs(#s(z0)) -> #pos(#s(z0))
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   testInsertionsort(z0) -> insertionsort(testList(#unit))
   testInsertionsortD(z0) -> insertionsortD(testList(#unit))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
Tuples:
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
S tuples:
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
K tuples:
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
Defined Rule Symbols:   #abs_1, #less_2, insert_2, insert#1_2, insert#2_4, insertD_2, insertD#1_2, insertD#2_4, insertionsort_1, insertionsort#1_1, insertionsortD_1, insertionsortD#1_1, testInsertionsort_1, testInsertionsortD_1, testList_1, #cklt_1, #compare_2

Defined Pair Symbols:   #COMPARE_2, INSERT_2, INSERT#1_2, INSERT#2_4, INSERTD_2, INSERTD#1_2, INSERTD#2_4, INSERTIONSORT_1, INSERTIONSORT#1_1, INSERTIONSORTD_1, INSERTIONSORTD#1_1, #LESS_2, TESTINSERTIONSORT_1, TESTINSERTIONSORTD_1

Compound Symbols:   c8_1, c12_1, c14_1, c20_1, c21_2, c24_1, c25_1, c26_2, c29_1, c30_1, c31_2, c33_1, c34_2, c19_1, c36_1, c37_1


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

(11) CdtUsableRulesProof (BOTH BOUNDS(ID, ID))
The following rules are not usable and were removed:
   #abs(#neg(z0)) -> #pos(z0)
   #abs(#s(z0)) -> #pos(#s(z0))
   testInsertionsort(z0) -> insertionsort(testList(#unit))
   testInsertionsortD(z0) -> insertionsortD(testList(#unit))

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

(12)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
   #abs(#0) -> #0
   #abs(#pos(z0)) -> #pos(z0)
Tuples:
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
S tuples:
   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))
K tuples:
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
Defined Rule Symbols:   #less_2, #cklt_1, #compare_2, insertionsort_1, insertionsort#1_1, insert_2, insert#1_2, insert#2_4, insertionsortD_1, insertionsortD#1_1, insertD_2, insertD#1_2, insertD#2_4, testList_1, #abs_1

Defined Pair Symbols:   #COMPARE_2, INSERT_2, INSERT#1_2, INSERT#2_4, INSERTD_2, INSERTD#1_2, INSERTD#2_4, INSERTIONSORT_1, INSERTIONSORT#1_1, INSERTIONSORTD_1, INSERTIONSORTD#1_1, #LESS_2, TESTINSERTIONSORT_1, TESTINSERTIONSORTD_1

Compound Symbols:   c8_1, c12_1, c14_1, c20_1, c21_2, c24_1, c25_1, c26_2, c29_1, c30_1, c31_2, c33_1, c34_2, c19_1, c36_1, c37_1


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

(13) CdtToCpxRelTrsProof (BOTH BOUNDS(ID, ID))
Converted S to standard rules, and D \ S as well as R to relative rules.
----------------------------------------

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


The TRS R consists of the following rules:

   INSERT(z0, z1) -> c20(INSERT#1(z1, z0))
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2))
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0))
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2))
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2))
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0))
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1))
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0))
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1))
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1))

The (relative) TRS S consists of the following rules:

   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0))
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1))
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1))
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit)))
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit)))
   #less(z0, z1) -> #cklt(#compare(z0, z1))
   #cklt(#EQ) -> #false
   #cklt(#GT) -> #false
   #cklt(#LT) -> #true
   #compare(#0, #0) -> #EQ
   #compare(#0, #neg(z0)) -> #GT
   #compare(#0, #pos(z0)) -> #LT
   #compare(#0, #s(z0)) -> #LT
   #compare(#neg(z0), #0) -> #LT
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0)
   #compare(#neg(z0), #pos(z1)) -> #LT
   #compare(#pos(z0), #0) -> #GT
   #compare(#pos(z0), #neg(z1)) -> #GT
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1)
   #compare(#s(z0), #0) -> #GT
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1)
   insertionsort(z0) -> insertionsort#1(z0)
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1))
   insertionsort#1(nil) -> nil
   insert(z0, z1) -> insert#1(z1, z0)
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1)
   insert#1(nil, z0) -> ::(z0, nil)
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2))
   insertionsortD(z0) -> insertionsortD#1(z0)
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1))
   insertionsortD#1(nil) -> nil
   insertD(z0, z1) -> insertD#1(z1, z0)
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1)
   insertD#1(nil, z0) -> ::(z0, nil)
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2))
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2))
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil))))))))))
   #abs(#0) -> #0
   #abs(#pos(z0)) -> #pos(z0)

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

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

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


The TRS R consists of the following rules:

   INSERT(z0, z1) -> c20(INSERT#1(z1, z0)) [1]
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2)) [1]
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0)) [1]
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2)) [1]
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0)) [1]
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1)) [1]
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0)) [1]
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1)) [1]
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1)) [1]
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0)) [0]
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1)) [0]
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1)) [0]
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit))) [0]
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit))) [0]
   #less(z0, z1) -> #cklt(#compare(z0, z1)) [0]
   #cklt(#EQ) -> #false [0]
   #cklt(#GT) -> #false [0]
   #cklt(#LT) -> #true [0]
   #compare(#0, #0) -> #EQ [0]
   #compare(#0, #neg(z0)) -> #GT [0]
   #compare(#0, #pos(z0)) -> #LT [0]
   #compare(#0, #s(z0)) -> #LT [0]
   #compare(#neg(z0), #0) -> #LT [0]
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0) [0]
   #compare(#neg(z0), #pos(z1)) -> #LT [0]
   #compare(#pos(z0), #0) -> #GT [0]
   #compare(#pos(z0), #neg(z1)) -> #GT [0]
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1) [0]
   #compare(#s(z0), #0) -> #GT [0]
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1) [0]
   insertionsort(z0) -> insertionsort#1(z0) [0]
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1)) [0]
   insertionsort#1(nil) -> nil [0]
   insert(z0, z1) -> insert#1(z1, z0) [0]
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1) [0]
   insert#1(nil, z0) -> ::(z0, nil) [0]
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2)) [0]
   insertionsortD(z0) -> insertionsortD#1(z0) [0]
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1)) [0]
   insertionsortD#1(nil) -> nil [0]
   insertD(z0, z1) -> insertD#1(z1, z0) [0]
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1) [0]
   insertD#1(nil, z0) -> ::(z0, nil) [0]
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2)) [0]
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))) [0]
   #abs(#0) -> #0 [0]
   #abs(#pos(z0)) -> #pos(z0) [0]

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

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

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

   INSERT(z0, z1) -> c20(INSERT#1(z1, z0)) [1]
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2)) [1]
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0)) [1]
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2)) [1]
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0)) [1]
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1)) [1]
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0)) [1]
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1)) [1]
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1)) [1]
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0)) [0]
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1)) [0]
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1)) [0]
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit))) [0]
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit))) [0]
   #less(z0, z1) -> #cklt(#compare(z0, z1)) [0]
   #cklt(#EQ) -> #false [0]
   #cklt(#GT) -> #false [0]
   #cklt(#LT) -> #true [0]
   #compare(#0, #0) -> #EQ [0]
   #compare(#0, #neg(z0)) -> #GT [0]
   #compare(#0, #pos(z0)) -> #LT [0]
   #compare(#0, #s(z0)) -> #LT [0]
   #compare(#neg(z0), #0) -> #LT [0]
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0) [0]
   #compare(#neg(z0), #pos(z1)) -> #LT [0]
   #compare(#pos(z0), #0) -> #GT [0]
   #compare(#pos(z0), #neg(z1)) -> #GT [0]
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1) [0]
   #compare(#s(z0), #0) -> #GT [0]
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1) [0]
   insertionsort(z0) -> insertionsort#1(z0) [0]
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1)) [0]
   insertionsort#1(nil) -> nil [0]
   insert(z0, z1) -> insert#1(z1, z0) [0]
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1) [0]
   insert#1(nil, z0) -> ::(z0, nil) [0]
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2)) [0]
   insertionsortD(z0) -> insertionsortD#1(z0) [0]
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1)) [0]
   insertionsortD#1(nil) -> nil [0]
   insertD(z0, z1) -> insertD#1(z1, z0) [0]
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1) [0]
   insertD#1(nil, z0) -> ::(z0, nil) [0]
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2)) [0]
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))) [0]
   #abs(#0) -> #0 [0]
   #abs(#pos(z0)) -> #pos(z0) [0]

The TRS has the following type information:
INSERT :: #neg:#pos:#s:#0 -> :::nil -> c20
c20 :: c21 -> c20
INSERT#1 :: :::nil -> #neg:#pos:#s:#0 -> c21
:: :: #neg:#pos:#s:#0 -> :::nil -> :::nil
c21 :: c24 -> c19 -> c21
INSERT#2 :: #true:#false -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c24
#less :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #true:#false
#LESS :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c19
#true :: #true:#false
c24 :: c20 -> c24
INSERTD :: #neg:#pos:#s:#0 -> :::nil -> c25
c25 :: c26 -> c25
INSERTD#1 :: :::nil -> #neg:#pos:#s:#0 -> c26
c26 :: c29 -> c19 -> c26
INSERTD#2 :: #true:#false -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c29
c29 :: c25 -> c29
INSERTIONSORT :: :::nil -> c30
c30 :: c31 -> c30
INSERTIONSORT#1 :: :::nil -> c31
c31 :: c20 -> c30 -> c31
insertionsort :: :::nil -> :::nil
INSERTIONSORTD :: :::nil -> c33
c33 :: c34 -> c33
INSERTIONSORTD#1 :: :::nil -> c34
c34 :: c25 -> c33 -> c34
insertionsortD :: :::nil -> :::nil
c19 :: c8:c12:c14 -> c19
#COMPARE :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c8:c12:c14
#neg :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c8 :: c8:c12:c14 -> c8:c12:c14
#pos :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c12 :: c8:c12:c14 -> c8:c12:c14
#s :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c14 :: c8:c12:c14 -> c8:c12:c14
TESTINSERTIONSORT :: a -> c36
c36 :: c30 -> c36
testList :: #unit -> :::nil
#unit :: #unit
TESTINSERTIONSORTD :: b -> c37
c37 :: c33 -> c37
#cklt :: #EQ:#GT:#LT -> #true:#false
#compare :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #EQ:#GT:#LT
#EQ :: #EQ:#GT:#LT
#false :: #true:#false
#GT :: #EQ:#GT:#LT
#LT :: #EQ:#GT:#LT
#0 :: #neg:#pos:#s:#0
insertionsort#1 :: :::nil -> :::nil
insert :: #neg:#pos:#s:#0 -> :::nil -> :::nil
nil :: :::nil
insert#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insert#2 :: #true:#false -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
insertionsortD#1 :: :::nil -> :::nil
insertD :: #neg:#pos:#s:#0 -> :::nil -> :::nil
insertD#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insertD#2 :: #true:#false -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
#abs :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0

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

(19) 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:

   INSERT_2
   INSERT#1_2
   INSERT#2_4
   INSERTD_2
   INSERTD#1_2
   INSERTD#2_4
   INSERTIONSORT_1
   INSERTIONSORT#1_1
   INSERTIONSORTD_1
   INSERTIONSORTD#1_1
   #LESS_2

(c) The following functions are completely defined:

   #COMPARE_2
   TESTINSERTIONSORT_1
   TESTINSERTIONSORTD_1
   #less_2
   #cklt_1
   #compare_2
   insertionsort_1
   insertionsort#1_1
   insert_2
   insert#1_2
   insert#2_4
   insertionsortD_1
   insertionsortD#1_1
   insertD_2
   insertD#1_2
   insertD#2_4
   testList_1
   #abs_1

Due to the following rules being added:

   #COMPARE(v0, v1) -> const11 [0]
   TESTINSERTIONSORT(v0) -> const12 [0]
   TESTINSERTIONSORTD(v0) -> const14 [0]
   #less(v0, v1) -> null_#less [0]
   #cklt(v0) -> null_#cklt [0]
   #compare(v0, v1) -> null_#compare [0]
   insertionsort(v0) -> nil [0]
   insertionsort#1(v0) -> nil [0]
   insert(v0, v1) -> nil [0]
   insert#1(v0, v1) -> nil [0]
   insert#2(v0, v1, v2, v3) -> nil [0]
   insertionsortD(v0) -> nil [0]
   insertionsortD#1(v0) -> nil [0]
   insertD(v0, v1) -> nil [0]
   insertD#1(v0, v1) -> nil [0]
   insertD#2(v0, v1, v2, v3) -> nil [0]
   testList(v0) -> nil [0]
   #abs(v0) -> #0 [0]

And the following fresh constants:    const11, const12, const14, null_#less, null_#cklt, null_#compare, const, const1, const2, const3, const4, const5, const6, const7, const8, const9, const10, const13, const15

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

(20)
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:

   INSERT(z0, z1) -> c20(INSERT#1(z1, z0)) [1]
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2)) [1]
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0)) [1]
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#less(z0, z2), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2)) [1]
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0)) [1]
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort(z1)), INSERTIONSORT(z1)) [1]
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0)) [1]
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD(z1)), INSERTIONSORTD(z1)) [1]
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1)) [1]
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0)) [0]
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1)) [0]
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1)) [0]
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(testList(#unit))) [0]
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(testList(#unit))) [0]
   #less(z0, z1) -> #cklt(#compare(z0, z1)) [0]
   #cklt(#EQ) -> #false [0]
   #cklt(#GT) -> #false [0]
   #cklt(#LT) -> #true [0]
   #compare(#0, #0) -> #EQ [0]
   #compare(#0, #neg(z0)) -> #GT [0]
   #compare(#0, #pos(z0)) -> #LT [0]
   #compare(#0, #s(z0)) -> #LT [0]
   #compare(#neg(z0), #0) -> #LT [0]
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0) [0]
   #compare(#neg(z0), #pos(z1)) -> #LT [0]
   #compare(#pos(z0), #0) -> #GT [0]
   #compare(#pos(z0), #neg(z1)) -> #GT [0]
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1) [0]
   #compare(#s(z0), #0) -> #GT [0]
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1) [0]
   insertionsort(z0) -> insertionsort#1(z0) [0]
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort(z1)) [0]
   insertionsort#1(nil) -> nil [0]
   insert(z0, z1) -> insert#1(z1, z0) [0]
   insert#1(::(z0, z1), z2) -> insert#2(#less(z0, z2), z2, z0, z1) [0]
   insert#1(nil, z0) -> ::(z0, nil) [0]
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2)) [0]
   insertionsortD(z0) -> insertionsortD#1(z0) [0]
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD(z1)) [0]
   insertionsortD#1(nil) -> nil [0]
   insertD(z0, z1) -> insertD#1(z1, z0) [0]
   insertD#1(::(z0, z1), z2) -> insertD#2(#less(z0, z2), z2, z0, z1) [0]
   insertD#1(nil, z0) -> ::(z0, nil) [0]
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2)) [0]
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))) [0]
   #abs(#0) -> #0 [0]
   #abs(#pos(z0)) -> #pos(z0) [0]
   #COMPARE(v0, v1) -> const11 [0]
   TESTINSERTIONSORT(v0) -> const12 [0]
   TESTINSERTIONSORTD(v0) -> const14 [0]
   #less(v0, v1) -> null_#less [0]
   #cklt(v0) -> null_#cklt [0]
   #compare(v0, v1) -> null_#compare [0]
   insertionsort(v0) -> nil [0]
   insertionsort#1(v0) -> nil [0]
   insert(v0, v1) -> nil [0]
   insert#1(v0, v1) -> nil [0]
   insert#2(v0, v1, v2, v3) -> nil [0]
   insertionsortD(v0) -> nil [0]
   insertionsortD#1(v0) -> nil [0]
   insertD(v0, v1) -> nil [0]
   insertD#1(v0, v1) -> nil [0]
   insertD#2(v0, v1, v2, v3) -> nil [0]
   testList(v0) -> nil [0]
   #abs(v0) -> #0 [0]

The TRS has the following type information:
INSERT :: #neg:#pos:#s:#0 -> :::nil -> c20
c20 :: c21 -> c20
INSERT#1 :: :::nil -> #neg:#pos:#s:#0 -> c21
:: :: #neg:#pos:#s:#0 -> :::nil -> :::nil
c21 :: c24 -> c19 -> c21
INSERT#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c24
#less :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #true:#false:null_#less:null_#cklt
#LESS :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c19
#true :: #true:#false:null_#less:null_#cklt
c24 :: c20 -> c24
INSERTD :: #neg:#pos:#s:#0 -> :::nil -> c25
c25 :: c26 -> c25
INSERTD#1 :: :::nil -> #neg:#pos:#s:#0 -> c26
c26 :: c29 -> c19 -> c26
INSERTD#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c29
c29 :: c25 -> c29
INSERTIONSORT :: :::nil -> c30
c30 :: c31 -> c30
INSERTIONSORT#1 :: :::nil -> c31
c31 :: c20 -> c30 -> c31
insertionsort :: :::nil -> :::nil
INSERTIONSORTD :: :::nil -> c33
c33 :: c34 -> c33
INSERTIONSORTD#1 :: :::nil -> c34
c34 :: c25 -> c33 -> c34
insertionsortD :: :::nil -> :::nil
c19 :: c8:c12:c14:const11 -> c19
#COMPARE :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c8:c12:c14:const11
#neg :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c8 :: c8:c12:c14:const11 -> c8:c12:c14:const11
#pos :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c12 :: c8:c12:c14:const11 -> c8:c12:c14:const11
#s :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c14 :: c8:c12:c14:const11 -> c8:c12:c14:const11
TESTINSERTIONSORT :: a -> c36:const12
c36 :: c30 -> c36:const12
testList :: #unit -> :::nil
#unit :: #unit
TESTINSERTIONSORTD :: b -> c37:const14
c37 :: c33 -> c37:const14
#cklt :: #EQ:#GT:#LT:null_#compare -> #true:#false:null_#less:null_#cklt
#compare :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #EQ:#GT:#LT:null_#compare
#EQ :: #EQ:#GT:#LT:null_#compare
#false :: #true:#false:null_#less:null_#cklt
#GT :: #EQ:#GT:#LT:null_#compare
#LT :: #EQ:#GT:#LT:null_#compare
#0 :: #neg:#pos:#s:#0
insertionsort#1 :: :::nil -> :::nil
insert :: #neg:#pos:#s:#0 -> :::nil -> :::nil
nil :: :::nil
insert#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insert#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
insertionsortD#1 :: :::nil -> :::nil
insertD :: #neg:#pos:#s:#0 -> :::nil -> :::nil
insertD#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insertD#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
#abs :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
const11 :: c8:c12:c14:const11
const12 :: c36:const12
const14 :: c37:const14
null_#less :: #true:#false:null_#less:null_#cklt
null_#cklt :: #true:#false:null_#less:null_#cklt
null_#compare :: #EQ:#GT:#LT:null_#compare
const :: c20
const1 :: c21
const2 :: c24
const3 :: c19
const4 :: c25
const5 :: c26
const6 :: c29
const7 :: c30
const8 :: c31
const9 :: c33
const10 :: c34
const13 :: a
const15 :: b

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

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

(22)
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:

   INSERT(z0, z1) -> c20(INSERT#1(z1, z0)) [1]
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(#cklt(#compare(z0, z2)), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERT#1(::(z0, z1), z2) -> c21(INSERT#2(null_#less, z2, z0, z1), #LESS(z0, z2)) [1]
   INSERT#2(#true, z0, z1, z2) -> c24(INSERT(z0, z2)) [1]
   INSERTD(z0, z1) -> c25(INSERTD#1(z1, z0)) [1]
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(#cklt(#compare(z0, z2)), z2, z0, z1), #LESS(z0, z2)) [1]
   INSERTD#1(::(z0, z1), z2) -> c26(INSERTD#2(null_#less, z2, z0, z1), #LESS(z0, z2)) [1]
   INSERTD#2(#true, z0, z1, z2) -> c29(INSERTD(z0, z2)) [1]
   INSERTIONSORT(z0) -> c30(INSERTIONSORT#1(z0)) [1]
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, insertionsort#1(z1)), INSERTIONSORT(z1)) [1]
   INSERTIONSORT#1(::(z0, z1)) -> c31(INSERT(z0, nil), INSERTIONSORT(z1)) [1]
   INSERTIONSORTD(z0) -> c33(INSERTIONSORTD#1(z0)) [1]
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, insertionsortD#1(z1)), INSERTIONSORTD(z1)) [1]
   INSERTIONSORTD#1(::(z0, z1)) -> c34(INSERTD(z0, nil), INSERTIONSORTD(z1)) [1]
   #LESS(z0, z1) -> c19(#COMPARE(z0, z1)) [1]
   #COMPARE(#neg(z0), #neg(z1)) -> c8(#COMPARE(z1, z0)) [0]
   #COMPARE(#pos(z0), #pos(z1)) -> c12(#COMPARE(z0, z1)) [0]
   #COMPARE(#s(z0), #s(z1)) -> c14(#COMPARE(z0, z1)) [0]
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))))) [0]
   TESTINSERTIONSORT(z0) -> c36(INSERTIONSORT(nil)) [0]
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))))) [0]
   TESTINSERTIONSORTD(z0) -> c37(INSERTIONSORTD(nil)) [0]
   #less(#0, #0) -> #cklt(#EQ) [0]
   #less(#0, #neg(z0')) -> #cklt(#GT) [0]
   #less(#0, #pos(z0'')) -> #cklt(#LT) [0]
   #less(#0, #s(z01)) -> #cklt(#LT) [0]
   #less(#neg(z02), #0) -> #cklt(#LT) [0]
   #less(#neg(z03), #neg(z1')) -> #cklt(#compare(z1', z03)) [0]
   #less(#neg(z04), #pos(z1'')) -> #cklt(#LT) [0]
   #less(#pos(z05), #0) -> #cklt(#GT) [0]
   #less(#pos(z06), #neg(z11)) -> #cklt(#GT) [0]
   #less(#pos(z07), #pos(z12)) -> #cklt(#compare(z07, z12)) [0]
   #less(#s(z08), #0) -> #cklt(#GT) [0]
   #less(#s(z09), #s(z13)) -> #cklt(#compare(z09, z13)) [0]
   #less(z0, z1) -> #cklt(null_#compare) [0]
   #cklt(#EQ) -> #false [0]
   #cklt(#GT) -> #false [0]
   #cklt(#LT) -> #true [0]
   #compare(#0, #0) -> #EQ [0]
   #compare(#0, #neg(z0)) -> #GT [0]
   #compare(#0, #pos(z0)) -> #LT [0]
   #compare(#0, #s(z0)) -> #LT [0]
   #compare(#neg(z0), #0) -> #LT [0]
   #compare(#neg(z0), #neg(z1)) -> #compare(z1, z0) [0]
   #compare(#neg(z0), #pos(z1)) -> #LT [0]
   #compare(#pos(z0), #0) -> #GT [0]
   #compare(#pos(z0), #neg(z1)) -> #GT [0]
   #compare(#pos(z0), #pos(z1)) -> #compare(z0, z1) [0]
   #compare(#s(z0), #0) -> #GT [0]
   #compare(#s(z0), #s(z1)) -> #compare(z0, z1) [0]
   insertionsort(z0) -> insertionsort#1(z0) [0]
   insertionsort#1(::(z0, z1)) -> insert(z0, insertionsort#1(z1)) [0]
   insertionsort#1(::(z0, z1)) -> insert(z0, nil) [0]
   insertionsort#1(nil) -> nil [0]
   insert(z0, z1) -> insert#1(z1, z0) [0]
   insert#1(::(z0, z1), z2) -> insert#2(#cklt(#compare(z0, z2)), z2, z0, z1) [0]
   insert#1(::(z0, z1), z2) -> insert#2(null_#less, z2, z0, z1) [0]
   insert#1(nil, z0) -> ::(z0, nil) [0]
   insert#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insert#2(#true, z0, z1, z2) -> ::(z1, insert(z0, z2)) [0]
   insertionsortD(z0) -> insertionsortD#1(z0) [0]
   insertionsortD#1(::(z0, z1)) -> insertD(z0, insertionsortD#1(z1)) [0]
   insertionsortD#1(::(z0, z1)) -> insertD(z0, nil) [0]
   insertionsortD#1(nil) -> nil [0]
   insertD(z0, z1) -> insertD#1(z1, z0) [0]
   insertD#1(::(z0, z1), z2) -> insertD#2(#cklt(#compare(z0, z2)), z2, z0, z1) [0]
   insertD#1(::(z0, z1), z2) -> insertD#2(null_#less, z2, z0, z1) [0]
   insertD#1(nil, z0) -> ::(z0, nil) [0]
   insertD#2(#false, z0, z1, z2) -> ::(z0, ::(z1, z2)) [0]
   insertD#2(#true, z0, z1, z2) -> ::(z1, insertD(z0, z2)) [0]
   testList(z0) -> ::(#abs(#0), ::(#abs(#pos(#s(#s(#s(#s(#0)))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#0))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#s(#0))))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#0))))))))), ::(#abs(#pos(#s(#0))), ::(#abs(#pos(#s(#s(#0)))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#s(#s(#0)))))))))), ::(#abs(#pos(#s(#s(#s(#s(#s(#s(#0)))))))), ::(#abs(#pos(#s(#s(#s(#0))))), nil)))))))))) [0]
   #abs(#0) -> #0 [0]
   #abs(#pos(z0)) -> #pos(z0) [0]
   #COMPARE(v0, v1) -> const11 [0]
   TESTINSERTIONSORT(v0) -> const12 [0]
   TESTINSERTIONSORTD(v0) -> const14 [0]
   #less(v0, v1) -> null_#less [0]
   #cklt(v0) -> null_#cklt [0]
   #compare(v0, v1) -> null_#compare [0]
   insertionsort(v0) -> nil [0]
   insertionsort#1(v0) -> nil [0]
   insert(v0, v1) -> nil [0]
   insert#1(v0, v1) -> nil [0]
   insert#2(v0, v1, v2, v3) -> nil [0]
   insertionsortD(v0) -> nil [0]
   insertionsortD#1(v0) -> nil [0]
   insertD(v0, v1) -> nil [0]
   insertD#1(v0, v1) -> nil [0]
   insertD#2(v0, v1, v2, v3) -> nil [0]
   testList(v0) -> nil [0]
   #abs(v0) -> #0 [0]

The TRS has the following type information:
INSERT :: #neg:#pos:#s:#0 -> :::nil -> c20
c20 :: c21 -> c20
INSERT#1 :: :::nil -> #neg:#pos:#s:#0 -> c21
:: :: #neg:#pos:#s:#0 -> :::nil -> :::nil
c21 :: c24 -> c19 -> c21
INSERT#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c24
#less :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #true:#false:null_#less:null_#cklt
#LESS :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c19
#true :: #true:#false:null_#less:null_#cklt
c24 :: c20 -> c24
INSERTD :: #neg:#pos:#s:#0 -> :::nil -> c25
c25 :: c26 -> c25
INSERTD#1 :: :::nil -> #neg:#pos:#s:#0 -> c26
c26 :: c29 -> c19 -> c26
INSERTD#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> c29
c29 :: c25 -> c29
INSERTIONSORT :: :::nil -> c30
c30 :: c31 -> c30
INSERTIONSORT#1 :: :::nil -> c31
c31 :: c20 -> c30 -> c31
insertionsort :: :::nil -> :::nil
INSERTIONSORTD :: :::nil -> c33
c33 :: c34 -> c33
INSERTIONSORTD#1 :: :::nil -> c34
c34 :: c25 -> c33 -> c34
insertionsortD :: :::nil -> :::nil
c19 :: c8:c12:c14:const11 -> c19
#COMPARE :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> c8:c12:c14:const11
#neg :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c8 :: c8:c12:c14:const11 -> c8:c12:c14:const11
#pos :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c12 :: c8:c12:c14:const11 -> c8:c12:c14:const11
#s :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
c14 :: c8:c12:c14:const11 -> c8:c12:c14:const11
TESTINSERTIONSORT :: a -> c36:const12
c36 :: c30 -> c36:const12
testList :: #unit -> :::nil
#unit :: #unit
TESTINSERTIONSORTD :: b -> c37:const14
c37 :: c33 -> c37:const14
#cklt :: #EQ:#GT:#LT:null_#compare -> #true:#false:null_#less:null_#cklt
#compare :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> #EQ:#GT:#LT:null_#compare
#EQ :: #EQ:#GT:#LT:null_#compare
#false :: #true:#false:null_#less:null_#cklt
#GT :: #EQ:#GT:#LT:null_#compare
#LT :: #EQ:#GT:#LT:null_#compare
#0 :: #neg:#pos:#s:#0
insertionsort#1 :: :::nil -> :::nil
insert :: #neg:#pos:#s:#0 -> :::nil -> :::nil
nil :: :::nil
insert#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insert#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
insertionsortD#1 :: :::nil -> :::nil
insertD :: #neg:#pos:#s:#0 -> :::nil -> :::nil
insertD#1 :: :::nil -> #neg:#pos:#s:#0 -> :::nil
insertD#2 :: #true:#false:null_#less:null_#cklt -> #neg:#pos:#s:#0 -> #neg:#pos:#s:#0 -> :::nil -> :::nil
#abs :: #neg:#pos:#s:#0 -> #neg:#pos:#s:#0
const11 :: c8:c12:c14:const11
const12 :: c36:const12
const14 :: c37:const14
null_#less :: #true:#false:null_#less:null_#cklt
null_#cklt :: #true:#false:null_#less:null_#cklt
null_#compare :: #EQ:#GT:#LT:null_#compare
const :: c20
const1 :: c21
const2 :: c24
const3 :: c19
const4 :: c25
const5 :: c26
const6 :: c29
const7 :: c30
const8 :: c31
const9 :: c33
const10 :: c34
const13 :: a
const15 :: b

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

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

   #true => 2
   #unit => 0
   #EQ => 1
   #false => 1
   #GT => 2
   #LT => 3
   #0 => 0
   nil => 0
   const11 => 0
   const12 => 0
   const14 => 0
   null_#less => 0
   null_#cklt => 0
   null_#compare => 0
   const => 0
   const1 => 0
   const2 => 0
   const3 => 0
   const4 => 0
   const5 => 0
   const6 => 0
   const7 => 0
   const8 => 0
   const9 => 0
   const10 => 0
   const13 => 0
   const15 => 0

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z0, z1) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z1, z0) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z0, z1) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   #abs(z) -{ 0 }-> 1 + z0 :|: z = 1 + z0, z0 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   #compare(z, z') -{ 0 }-> 3 :|: z0 >= 0, z' = 1 + z0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z = 1 + z0, z0 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> 2 :|: z0 >= 0, z' = 1 + z0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z = 1 + z0, z0 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #compare(z, z') -{ 0 }-> #compare(z0, z1) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> #compare(z1, z0) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #less(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #less(z, z') -{ 0 }-> #cklt(3) :|: z' = 1 + z0'', z0'' >= 0, z = 0
   #less(z, z') -{ 0 }-> #cklt(3) :|: z01 >= 0, z' = 1 + z01, z = 0
   #less(z, z') -{ 0 }-> #cklt(3) :|: z = 1 + z02, z02 >= 0, z' = 0
   #less(z, z') -{ 0 }-> #cklt(3) :|: z04 >= 0, z' = 1 + z1'', z = 1 + z04, z1'' >= 0
   #less(z, z') -{ 0 }-> #cklt(2) :|: z0' >= 0, z = 0, z' = 1 + z0'
   #less(z, z') -{ 0 }-> #cklt(2) :|: z05 >= 0, z = 1 + z05, z' = 0
   #less(z, z') -{ 0 }-> #cklt(2) :|: z' = 1 + z11, z11 >= 0, z06 >= 0, z = 1 + z06
   #less(z, z') -{ 0 }-> #cklt(2) :|: z08 >= 0, z = 1 + z08, z' = 0
   #less(z, z') -{ 0 }-> #cklt(1) :|: z = 0, z' = 0
   #less(z, z') -{ 0 }-> #cklt(0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z07, z12)) :|: z' = 1 + z12, z07 >= 0, z = 1 + z07, z12 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z09, z13)) :|: z' = 1 + z13, z = 1 + z09, z09 >= 0, z13 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z1', z03)) :|: z' = 1 + z1', z1' >= 0, z = 1 + z03, z03 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z2)), z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z2)), z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z0) :|: z = z0, z0 >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z0) :|: z = z0, z0 >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z = z0, z0 >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z = z0, z0 >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z = z0, z0 >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z = z0, z0 >= 0
   insert(z, z') -{ 0 }-> insert#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   insert(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insert#1(z, z') -{ 0 }-> insert#2(0, z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z2)), z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insert#1(z, z') -{ 0 }-> 1 + z0 + 0 :|: z0 >= 0, z = 0, z' = z0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: v0 >= 0, z'' = v2, v1 >= 0, z = v0, z' = v1, z3 = v3, v2 >= 0, v3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z0 + (1 + z1 + z2) :|: z1 >= 0, z = 1, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z1 + insert(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertD(z, z') -{ 0 }-> insertD#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   insertD(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z2)), z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insertD#1(z, z') -{ 0 }-> 1 + z0 + 0 :|: z0 >= 0, z = 0, z' = z0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: v0 >= 0, z'' = v2, v1 >= 0, z = v0, z' = v1, z3 = v3, v2 >= 0, v3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z0 + (1 + z1 + z2) :|: z1 >= 0, z = 1, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z1 + insertD(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertionsort(z) -{ 0 }-> insertionsort#1(z0) :|: z = z0, z0 >= 0
   insertionsort(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z0) :|: z = z0, z0 >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   testList(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z = z0, z0 >= 0


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

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

   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 2 :|: z = 3

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z0, z1) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z1, z0) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z0, z1) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   #abs(z) -{ 0 }-> 1 + z0 :|: z = 1 + z0, z0 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   #compare(z, z') -{ 0 }-> 3 :|: z0 >= 0, z' = 1 + z0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z = 1 + z0, z0 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> 2 :|: z0 >= 0, z' = 1 + z0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z = 1 + z0, z0 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #compare(z, z') -{ 0 }-> #compare(z0, z1) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #compare(z, z') -{ 0 }-> #compare(z1, z0) :|: z1 >= 0, z = 1 + z0, z0 >= 0, z' = 1 + z1
   #less(z, z') -{ 0 }-> 2 :|: z' = 1 + z0'', z0'' >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z01 >= 0, z' = 1 + z01, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z = 1 + z02, z02 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z04 >= 0, z' = 1 + z1'', z = 1 + z04, z1'' >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z0' >= 0, z = 0, z' = 1 + z0', 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z05 >= 0, z = 1 + z05, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' = 1 + z11, z11 >= 0, z06 >= 0, z = 1 + z06, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z08 >= 0, z = 1 + z08, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z0' >= 0, z = 0, z' = 1 + z0', v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' = 1 + z0'', z0'' >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z01 >= 0, z' = 1 + z01, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z = 1 + z02, z02 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z04 >= 0, z' = 1 + z1'', z = 1 + z04, z1'' >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z05 >= 0, z = 1 + z05, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' = 1 + z11, z11 >= 0, z06 >= 0, z = 1 + z06, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z08 >= 0, z = 1 + z08, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z = z0, z1 >= 0, z' = z1, z0 >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z07, z12)) :|: z' = 1 + z12, z07 >= 0, z = 1 + z07, z12 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z09, z13)) :|: z' = 1 + z13, z = 1 + z09, z09 >= 0, z13 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z1', z03)) :|: z' = 1 + z1', z1' >= 0, z = 1 + z03, z03 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z2)), z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z2)), z2, z0, z1) + #LESS(z0, z2) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z0) :|: z = z0, z0 >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z0) :|: z = z0, z0 >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z = z0, z0 >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z = z0, z0 >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z = z0, z0 >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z = z0, z0 >= 0
   insert(z, z') -{ 0 }-> insert#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   insert(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insert#1(z, z') -{ 0 }-> insert#2(0, z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z2)), z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insert#1(z, z') -{ 0 }-> 1 + z0 + 0 :|: z0 >= 0, z = 0, z' = z0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: v0 >= 0, z'' = v2, v1 >= 0, z = v0, z' = v1, z3 = v3, v2 >= 0, v3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z0 + (1 + z1 + z2) :|: z1 >= 0, z = 1, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z1 + insert(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertD(z, z') -{ 0 }-> insertD#1(z1, z0) :|: z = z0, z1 >= 0, z' = z1, z0 >= 0
   insertD(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z2)), z2, z0, z1) :|: z1 >= 0, z' = z2, z0 >= 0, z = 1 + z0 + z1, z2 >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: v0 >= 0, v1 >= 0, z = v0, z' = v1
   insertD#1(z, z') -{ 0 }-> 1 + z0 + 0 :|: z0 >= 0, z = 0, z' = z0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: v0 >= 0, z'' = v2, v1 >= 0, z = v0, z' = v1, z3 = v3, v2 >= 0, v3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z0 + (1 + z1 + z2) :|: z1 >= 0, z = 1, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z1 + insertD(z0, z2) :|: z = 2, z1 >= 0, z0 >= 0, z3 = z2, z' = z0, z2 >= 0, z'' = z1
   insertionsort(z) -{ 0 }-> insertionsort#1(z0) :|: z = z0, z0 >= 0
   insertionsort(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z0) :|: z = z0, z0 >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   testList(z) -{ 0 }-> 0 :|: v0 >= 0, z = v0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z = z0, z0 >= 0


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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0


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

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

   { #cklt }
   { #compare }
   { #COMPARE }
   { #abs }
   { #less }
   { insert#2, insert, insert#1 }
   { insertD#2, insertD#1, insertD }
   { #LESS }
   { testList }
   { insertionsort#1 }
   { insertionsortD#1 }
   { INSERTD#2, INSERTD#1, INSERTD }
   { INSERT#1, INSERT#2, INSERT }
   { insertionsort }
   { INSERTIONSORT, INSERTIONSORT#1 }
   { insertionsortD }
   { INSERTIONSORTD, INSERTIONSORTD#1 }
   { TESTINSERTIONSORT }
   { TESTINSERTIONSORTD }

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#cklt}, {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#cklt}, {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}

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

(33) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#cklt}, {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: ?, size: O(1) [2]

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

(35) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]

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

(39) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#compare}, {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: ?, size: O(1) [3]

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

(41) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #compare(z, z') -{ 0 }-> #compare(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> #compare(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   #less(z, z') -{ 0 }-> #cklt(#compare(z - 1, z' - 1)) :|: z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> #cklt(#compare(z' - 1, z - 1)) :|: z' - 1 >= 0, z - 1 >= 0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(#cklt(#compare(z0, z')), z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(#cklt(#compare(z0, z')), z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]

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

(45) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: #COMPARE
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z + z'

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#COMPARE}, {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: ?, size: O(n^1) [z + z']

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

(47) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z - 1, z' - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + #COMPARE(z' - 1, z - 1) :|: z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + #COMPARE(z, z') :|: z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']

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

(51) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: #abs
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#abs}, {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: ?, size: O(n^1) [z]

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

(53) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0)))))))))) :|: z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + #abs(0) + (1 + #abs(1 + (1 + (1 + (1 + (1 + 0))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + 0)))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))) + (1 + #abs(1 + (1 + 0)) + (1 + #abs(1 + (1 + (1 + 0))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))) + (1 + #abs(1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))) + (1 + #abs(1 + (1 + (1 + (1 + 0)))) + 0))))))))) :|: z >= 0

Function symbols to be analyzed: {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]

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

(57) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {#less}, {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: ?, size: O(1) [2]

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

(59) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]

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

(63) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: insert#2
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 2 + z' + z'' + z3

Computed SIZE bound using CoFloCo for: insert
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

Computed SIZE bound using CoFloCo for: insert#1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insert#2,insert,insert#1}, {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: ?, size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: ?, size: O(n^1) [1 + z + z']
  insert#1: runtime: ?, size: O(n^1) [1 + z + z']

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

(65) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> insert#1(z', z) :|: z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(s9, z', z0, z1) :|: s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> insert#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insert(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']

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

(69) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: insertD#2
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 2 + z' + z'' + z3

Computed SIZE bound using CoFloCo for: insertD#1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

Computed SIZE bound using CoFloCo for: insertD
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertD#2,insertD#1,insertD}, {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: ?, size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: ?, size: O(n^1) [1 + z + z']
  insertD: runtime: ?, size: O(n^1) [1 + z + z']

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

(71) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> insertD#1(z', z) :|: z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(s11, z', z0, z1) :|: s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> insertD#2(0, z', z0, z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + insertD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, 0) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']

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

(75) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: #LESS
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {#LESS}, {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: ?, size: O(n^1) [1 + z + z']

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

(77) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(s1, z', z0, z1) + #LESS(z0, z') :|: s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 1 }-> 1 + INSERT#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(s3, z', z0, z1) + #LESS(z0, z') :|: s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 1 }-> 1 + INSERTD#2(0, z', z0, z1) + #LESS(z0, z') :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']

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

(81) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {testList}, {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: ?, size: O(1) [64]

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

(83) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]

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

(87) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: insertionsort#1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort#1}, {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: ?, size: O(n^1) [z]

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

(89) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, insertionsort#1(z1)) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> insertionsort#1(z) :|: z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> insert(z0, insertionsort#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]

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

(93) IntTrsBoundProof (UPPER BOUND(ID))

Computed SIZE bound using CoFloCo for: insertionsortD#1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: z

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD#1}, {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: ?, size: O(n^1) [z]

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

(95) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, insertionsortD#1(z1)) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> insertionsortD#1(z) :|: z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> insertD(z0, insertionsortD#1(z1)) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, s63) + INSERTIONSORTD(z1) :|: s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]

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

(99) IntTrsBoundProof (UPPER BOUND(ID))

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

Computed SIZE bound using CoFloCo for: INSERTD#1
after applying outer abstraction to obtain an ITS,
resulting in: O(n^1) with polynomial bound: 1 + z + z'

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, s63) + INSERTIONSORTD(z1) :|: s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTD#2,INSERTD#1,INSERTD}, {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: ?, size: O(1) [0]
  INSERTD#1: runtime: ?, size: O(n^1) [1 + z + z']
  INSERTD: runtime: ?, size: O(n^1) [2 + z + z']

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

(101) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 }-> 1 + INSERTD#1(z', z) :|: z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(s3, z', z0, z1) + s58 :|: s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 2 }-> 1 + INSERTD#2(0, z', z0, z1) + s56 :|: s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 1 }-> 1 + INSERTD(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, s63) + INSERTIONSORTD(z1) :|: s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 1 }-> 1 + INSERTD(z0, 0) + INSERTIONSORTD(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']

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

(105) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERT#1,INSERT#2,INSERT}, {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: ?, size: O(1) [0]
  INSERT#2: runtime: ?, size: O(1) [2]
  INSERT: runtime: ?, size: O(1) [1]

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

(107) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 }-> 1 + INSERT#1(z', z) :|: z' >= 0, z >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(s1, z', z0, z1) + s57 :|: s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 2 }-> 1 + INSERT#2(0, z', z0, z1) + s55 :|: s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 1 }-> 1 + INSERT(z', z3) :|: z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, s59) + INSERTIONSORT(z1) :|: s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 1 }-> 1 + INSERT(z0, 0) + INSERTIONSORT(z1) :|: z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]

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

(111) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsort}, {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: ?, size: O(n^1) [z]

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

(113) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]

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

(117) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORT,INSERTIONSORT#1}, {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: ?, size: O(1) [0]
  INSERTIONSORT#1: runtime: ?, size: O(1) [2]

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

(119) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 1 }-> 1 + INSERTIONSORT#1(z) :|: z >= 0
   INSERTIONSORT#1(z) -{ 2 + 18*s59 }-> 1 + s76 + INSERTIONSORT(z1) :|: s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 2 }-> 1 + s77 + INSERTIONSORT(z1) :|: s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(0) :|: z >= 0
   TESTINSERTIONSORT(z) -{ 0 }-> 1 + INSERTIONSORT(1 + s15 + (1 + s16 + (1 + s17 + (1 + s18 + (1 + s19 + (1 + s20 + (1 + s21 + (1 + s22 + (1 + s23 + (1 + s24 + 0)))))))))) :|: s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]

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

(123) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {insertionsortD}, {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: ?, size: O(n^1) [z]

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

(125) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]

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

(129) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {INSERTIONSORTD,INSERTIONSORTD#1}, {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: ?, size: O(1) [0]
  INSERTIONSORTD#1: runtime: ?, size: O(n^1) [2 + z]

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

(131) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 1 }-> 1 + INSERTIONSORTD#1(z) :|: z >= 0
   INSERTIONSORTD#1(z) -{ 2 + 4*s63 }-> 1 + s70 + INSERTIONSORTD(z1) :|: s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 2 }-> 1 + s71 + INSERTIONSORTD(z1) :|: s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(0) :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 1 + INSERTIONSORTD(1 + s25 + (1 + s26 + (1 + s27 + (1 + s28 + (1 + s29 + (1 + s30 + (1 + s31 + (1 + s32 + (1 + s33 + (1 + s34 + 0)))))))))) :|: s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]

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

(135) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORT}, {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]
  TESTINSERTIONSORT: runtime: ?, size: O(1) [1]

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

(137) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]
  TESTINSERTIONSORT: runtime: O(1) [74817], size: O(1) [1]

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]
  TESTINSERTIONSORT: runtime: O(1) [74817], size: O(1) [1]

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

(141) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: {TESTINSERTIONSORTD}
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]
  TESTINSERTIONSORT: runtime: O(1) [74817], size: O(1) [1]
  TESTINSERTIONSORTD: runtime: ?, size: O(1) [1]

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

(143) IntTrsBoundProof (UPPER BOUND(ID))

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

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

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

   #COMPARE(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s13 :|: s13 >= 0, s13 <= z' - 1 + (z - 1), z' - 1 >= 0, z - 1 >= 0
   #COMPARE(z, z') -{ 0 }-> 1 + s14 :|: s14 >= 0, s14 <= z - 1 + (z' - 1), z' - 1 >= 0, z - 1 >= 0
   #LESS(z, z') -{ 1 }-> 1 + s12 :|: s12 >= 0, s12 <= z + z', z' >= 0, z >= 0
   #abs(z) -{ 0 }-> 0 :|: z = 0
   #abs(z) -{ 0 }-> 0 :|: z >= 0
   #abs(z) -{ 0 }-> 1 + (z - 1) :|: z - 1 >= 0
   #cklt(z) -{ 0 }-> 2 :|: z = 3
   #cklt(z) -{ 0 }-> 1 :|: z = 1
   #cklt(z) -{ 0 }-> 1 :|: z = 2
   #cklt(z) -{ 0 }-> 0 :|: z >= 0
   #compare(z, z') -{ 0 }-> s :|: s >= 0, s <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> s' :|: s' >= 0, s' <= 3, z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 3 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 3 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0
   #compare(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0
   #compare(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z - 1 >= 0
   #compare(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0
   #compare(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> s5 :|: s4 >= 0, s4 <= 3, s5 >= 0, s5 <= 2, z' - 1 >= 0, z - 1 >= 0
   #less(z, z') -{ 0 }-> s7 :|: s6 >= 0, s6 <= 3, s7 >= 0, s7 <= 2, z - 1 >= 0, z' - 1 >= 0
   #less(z, z') -{ 0 }-> 2 :|: z' - 1 >= 0, z = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' = 0, 3 = 3
   #less(z, z') -{ 0 }-> 2 :|: z - 1 >= 0, z' - 1 >= 0, 3 = 3
   #less(z, z') -{ 0 }-> 1 :|: z = 0, z' = 0, 1 = 1
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z - 1 >= 0, z' = 0, 2 = 2
   #less(z, z') -{ 0 }-> 1 :|: z' - 1 >= 0, z - 1 >= 0, 2 = 2
   #less(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   #less(z, z') -{ 0 }-> 0 :|: z = 0, z' = 0, v0 >= 0, 1 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' - 1 >= 0, v0 >= 0, 3 = v0
   #less(z, z') -{ 0 }-> 0 :|: z - 1 >= 0, z' = 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' - 1 >= 0, z - 1 >= 0, v0 >= 0, 2 = v0
   #less(z, z') -{ 0 }-> 0 :|: z' >= 0, z >= 0, v0 >= 0, 0 = v0
   INSERT(z, z') -{ 1 + 18*z' }-> 1 + s73 :|: s73 >= 0, s73 <= 0, z' >= 0, z >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s74 + s55 :|: s74 >= 0, s74 <= 2, s55 >= 0, s55 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#1(z, z') -{ 4 + 18*z1 }-> 1 + s78 + s57 :|: s78 >= 0, s78 <= 2, s57 >= 0, s57 <= z0 + z' + 1, s'' >= 0, s'' <= 3, s1 >= 0, s1 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERT#2(z, z', z'', z3) -{ 2 + 18*z3 }-> 1 + s75 :|: s75 >= 0, s75 <= 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTD(z, z') -{ 1 + 4*z' }-> 1 + s67 :|: s67 >= 0, s67 <= z' + z + 1, z' >= 0, z >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s68 + s56 :|: s68 >= 0, s68 <= 0, s56 >= 0, s56 <= z0 + z' + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#1(z, z') -{ 4 + 4*z1 }-> 1 + s72 + s58 :|: s72 >= 0, s72 <= 0, s58 >= 0, s58 <= z0 + z' + 1, s2 >= 0, s2 <= 3, s3 >= 0, s3 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   INSERTD#2(z, z', z'', z3) -{ 2 + 4*z3 }-> 1 + s69 :|: s69 >= 0, s69 <= z' + z3 + 2, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   INSERTIONSORT(z) -{ 7 + 52*z + 36*z^2 }-> 1 + s79 :|: s79 >= 0, s79 <= 2, z >= 0
   INSERTIONSORT#1(z) -{ 3 + 18*s59 + 17*z1 + 18*z1^2 }-> 1 + s76 + s80 :|: s80 >= 0, s80 <= 0, s76 >= 0, s76 <= 1, s59 >= 0, s59 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORT#1(z) -{ 3 + 17*z1 + 18*z1^2 }-> 1 + s77 + s81 :|: s81 >= 0, s81 <= 0, s77 >= 0, s77 <= 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD(z) -{ 7 + 10*z + 8*z^2 }-> 1 + s84 :|: s84 >= 0, s84 <= z + 2, z >= 0
   INSERTIONSORTD#1(z) -{ 3 + 4*s63 + 3*z1 + 4*z1^2 }-> 1 + s70 + s85 :|: s85 >= 0, s85 <= 0, s70 >= 0, s70 <= z0 + s63 + 2, s63 >= 0, s63 <= z1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   INSERTIONSORTD#1(z) -{ 3 + 3*z1 + 4*z1^2 }-> 1 + s71 + s86 :|: s86 >= 0, s86 <= 0, s71 >= 0, s71 <= z0 + 0 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   TESTINSERTIONSORT(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORT(z) -{ 1971 + 377*s15 + 36*s15*s16 + 36*s15*s17 + 36*s15*s18 + 36*s15*s19 + 36*s15*s20 + 36*s15*s21 + 36*s15*s22 + 36*s15*s23 + 36*s15*s24 + 18*s15^2 + 377*s16 + 36*s16*s17 + 36*s16*s18 + 36*s16*s19 + 36*s16*s20 + 36*s16*s21 + 36*s16*s22 + 36*s16*s23 + 36*s16*s24 + 18*s16^2 + 377*s17 + 36*s17*s18 + 36*s17*s19 + 36*s17*s20 + 36*s17*s21 + 36*s17*s22 + 36*s17*s23 + 36*s17*s24 + 18*s17^2 + 377*s18 + 36*s18*s19 + 36*s18*s20 + 36*s18*s21 + 36*s18*s22 + 36*s18*s23 + 36*s18*s24 + 18*s18^2 + 377*s19 + 36*s19*s20 + 36*s19*s21 + 36*s19*s22 + 36*s19*s23 + 36*s19*s24 + 18*s19^2 + 377*s20 + 36*s20*s21 + 36*s20*s22 + 36*s20*s23 + 36*s20*s24 + 18*s20^2 + 377*s21 + 36*s21*s22 + 36*s21*s23 + 36*s21*s24 + 18*s21^2 + 377*s22 + 36*s22*s23 + 36*s22*s24 + 18*s22^2 + 377*s23 + 36*s23*s24 + 18*s23^2 + 377*s24 + 18*s24^2 }-> 1 + s82 :|: s82 >= 0, s82 <= 0, s15 >= 0, s15 <= 0, s16 >= 0, s16 <= 1 + (1 + (1 + (1 + (1 + 0)))), s17 >= 0, s17 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s18 >= 0, s18 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s19 >= 0, s19 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s20 >= 0, s20 <= 1 + (1 + 0), s21 >= 0, s21 <= 1 + (1 + (1 + 0)), s22 >= 0, s22 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s23 >= 0, s23 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s24 >= 0, s24 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORT(z) -{ 1 }-> 1 + s83 :|: s83 >= 0, s83 <= 0, z >= 0
   TESTINSERTIONSORTD(z) -{ 0 }-> 0 :|: z >= 0
   TESTINSERTIONSORTD(z) -{ 431 + 83*s25 + 8*s25*s26 + 8*s25*s27 + 8*s25*s28 + 8*s25*s29 + 8*s25*s30 + 8*s25*s31 + 8*s25*s32 + 8*s25*s33 + 8*s25*s34 + 4*s25^2 + 83*s26 + 8*s26*s27 + 8*s26*s28 + 8*s26*s29 + 8*s26*s30 + 8*s26*s31 + 8*s26*s32 + 8*s26*s33 + 8*s26*s34 + 4*s26^2 + 83*s27 + 8*s27*s28 + 8*s27*s29 + 8*s27*s30 + 8*s27*s31 + 8*s27*s32 + 8*s27*s33 + 8*s27*s34 + 4*s27^2 + 83*s28 + 8*s28*s29 + 8*s28*s30 + 8*s28*s31 + 8*s28*s32 + 8*s28*s33 + 8*s28*s34 + 4*s28^2 + 83*s29 + 8*s29*s30 + 8*s29*s31 + 8*s29*s32 + 8*s29*s33 + 8*s29*s34 + 4*s29^2 + 83*s30 + 8*s30*s31 + 8*s30*s32 + 8*s30*s33 + 8*s30*s34 + 4*s30^2 + 83*s31 + 8*s31*s32 + 8*s31*s33 + 8*s31*s34 + 4*s31^2 + 83*s32 + 8*s32*s33 + 8*s32*s34 + 4*s32^2 + 83*s33 + 8*s33*s34 + 4*s33^2 + 83*s34 + 4*s34^2 }-> 1 + s87 :|: s87 >= 0, s87 <= 0, s25 >= 0, s25 <= 0, s26 >= 0, s26 <= 1 + (1 + (1 + (1 + (1 + 0)))), s27 >= 0, s27 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s28 >= 0, s28 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s29 >= 0, s29 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s30 >= 0, s30 <= 1 + (1 + 0), s31 >= 0, s31 <= 1 + (1 + (1 + 0)), s32 >= 0, s32 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s33 >= 0, s33 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s34 >= 0, s34 <= 1 + (1 + (1 + (1 + 0))), z >= 0
   TESTINSERTIONSORTD(z) -{ 1 }-> 1 + s88 :|: s88 >= 0, s88 <= 0, z >= 0
   insert(z, z') -{ 0 }-> s46 :|: s46 >= 0, s46 <= z' + z + 1, z' >= 0, z >= 0
   insert(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> s47 :|: s47 >= 0, s47 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> s49 :|: s49 >= 0, s49 <= z' + z0 + z1 + 2, s8 >= 0, s8 <= 3, s9 >= 0, s9 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insert#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insert#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insert#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insert#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s48 :|: s48 >= 0, s48 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertD(z, z') -{ 0 }-> s51 :|: s51 >= 0, s51 <= z' + z + 1, z' >= 0, z >= 0
   insertD(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> s52 :|: s52 >= 0, s52 <= z' + z0 + z1 + 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> s54 :|: s54 >= 0, s54 <= z' + z0 + z1 + 2, s10 >= 0, s10 <= 3, s11 >= 0, s11 <= 2, z1 >= 0, z0 >= 0, z = 1 + z0 + z1, z' >= 0
   insertD#1(z, z') -{ 0 }-> 0 :|: z >= 0, z' >= 0
   insertD#1(z, z') -{ 0 }-> 1 + z' + 0 :|: z' >= 0, z = 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 0 :|: z >= 0, z' >= 0, z'' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z' + (1 + z'' + z3) :|: z'' >= 0, z = 1, z' >= 0, z3 >= 0
   insertD#2(z, z', z'', z3) -{ 0 }-> 1 + z'' + s53 :|: s53 >= 0, s53 <= z' + z3 + 1, z = 2, z'' >= 0, z' >= 0, z3 >= 0
   insertionsort(z) -{ 0 }-> s60 :|: s60 >= 0, s60 <= z, z >= 0
   insertionsort(z) -{ 0 }-> 0 :|: z >= 0
   insertionsort#1(z) -{ 0 }-> s45 :|: s45 >= 0, s45 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> s62 :|: s61 >= 0, s61 <= z1, s62 >= 0, s62 <= z0 + s61 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsort#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsort#1(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD(z) -{ 0 }-> s64 :|: s64 >= 0, s64 <= z, z >= 0
   insertionsortD(z) -{ 0 }-> 0 :|: z >= 0
   insertionsortD#1(z) -{ 0 }-> s50 :|: s50 >= 0, s50 <= z0 + 0 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> s66 :|: s65 >= 0, s65 <= z1, s66 >= 0, s66 <= z0 + s65 + 1, z1 >= 0, z0 >= 0, z = 1 + z0 + z1
   insertionsortD#1(z) -{ 0 }-> 0 :|: z = 0
   insertionsortD#1(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 0 :|: z >= 0
   testList(z) -{ 0 }-> 1 + s35 + (1 + s36 + (1 + s37 + (1 + s38 + (1 + s39 + (1 + s40 + (1 + s41 + (1 + s42 + (1 + s43 + (1 + s44 + 0))))))))) :|: s35 >= 0, s35 <= 0, s36 >= 0, s36 <= 1 + (1 + (1 + (1 + (1 + 0)))), s37 >= 0, s37 <= 1 + (1 + (1 + (1 + (1 + (1 + 0))))), s38 >= 0, s38 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))))), s39 >= 0, s39 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0))))))), s40 >= 0, s40 <= 1 + (1 + 0), s41 >= 0, s41 <= 1 + (1 + (1 + 0)), s42 >= 0, s42 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))))), s43 >= 0, s43 <= 1 + (1 + (1 + (1 + (1 + (1 + (1 + 0)))))), s44 >= 0, s44 <= 1 + (1 + (1 + (1 + 0))), z >= 0

Function symbols to be analyzed: 
Previous analysis results are:
  #cklt: runtime: O(1) [0], size: O(1) [2]
  #compare: runtime: O(1) [0], size: O(1) [3]
  #COMPARE: runtime: O(1) [0], size: O(n^1) [z + z']
  #abs: runtime: O(1) [0], size: O(n^1) [z]
  #less: runtime: O(1) [0], size: O(1) [2]
  insert#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insert: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insert#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD#2: runtime: O(1) [0], size: O(n^1) [2 + z' + z'' + z3]
  insertD#1: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  insertD: runtime: O(1) [0], size: O(n^1) [1 + z + z']
  #LESS: runtime: O(1) [1], size: O(n^1) [1 + z + z']
  testList: runtime: O(1) [0], size: O(1) [64]
  insertionsort#1: runtime: O(1) [0], size: O(n^1) [z]
  insertionsortD#1: runtime: O(1) [0], size: O(n^1) [z]
  INSERTD#2: runtime: O(n^1) [2 + 4*z3], size: O(1) [0]
  INSERTD#1: runtime: O(n^1) [4*z], size: O(n^1) [1 + z + z']
  INSERTD: runtime: O(n^1) [1 + 4*z'], size: O(n^1) [2 + z + z']
  INSERT#1: runtime: O(n^1) [18*z], size: O(1) [0]
  INSERT#2: runtime: O(n^1) [2 + 18*z3], size: O(1) [2]
  INSERT: runtime: O(n^1) [1 + 18*z'], size: O(1) [1]
  insertionsort: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORT: runtime: O(n^2) [1 + 17*z + 18*z^2], size: O(1) [0]
  INSERTIONSORT#1: runtime: O(n^2) [6 + 52*z + 36*z^2], size: O(1) [2]
  insertionsortD: runtime: O(1) [0], size: O(n^1) [z]
  INSERTIONSORTD: runtime: O(n^2) [1 + 3*z + 4*z^2], size: O(1) [0]
  INSERTIONSORTD#1: runtime: O(n^2) [6 + 10*z + 8*z^2], size: O(n^1) [2 + z]
  TESTINSERTIONSORT: runtime: O(1) [74817], size: O(1) [1]
  TESTINSERTIONSORTD: runtime: O(1) [16577], size: O(1) [1]

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

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

(146)
BOUNDS(1, n^2)