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


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


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


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, max(4 + 8 * Arg_0, 12)).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 245 ms]
(2) BOUNDS(1, max(4 + 8 * Arg_0, 12))


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f2(A, B, C) -> Com_1(f2(-(B) + A, 1 + B, C)) :|: A >= 1
f3(A, B, C) -> Com_1(f2(A, B, C)) :|: B >= 1
f2(A, B, C) -> Com_1(f4(A, B, D)) :|: 0 >= A
f3(A, B, C) -> Com_1(f4(A, B, D)) :|: 0 >= B

The start-symbols are:[f3_3]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 4+8*max([1, Arg_0]) {O(n)})



Initial Complexity Problem:

  Start:  f3  

  Program_Vars:  Arg_0, Arg_1, Arg_2  

  Temp_Vars:  D  

  Locations:  f2, f3, f4  

  Transitions:

  0: f2->f2

  2: f2->f4

  1: f3->f2

  3: f3->f4  



Timebounds: 

  Overall timebound: 4+8*max([1, Arg_0]) {O(n)}

  0: f2->f2: 1+8*max([1, Arg_0]) {O(n)}

  2: f2->f4: 1 {O(1)}

  1: f3->f2: 1 {O(1)}

  3: f3->f4: 1 {O(1)}



Costbounds:

  Overall costbound: 4+8*max([1, Arg_0]) {O(n)}

  0: f2->f2: 1+8*max([1, Arg_0]) {O(n)}

  2: f2->f4: 1 {O(1)}

  1: f3->f2: 1 {O(1)}

  3: f3->f4: 1 {O(1)}



Sizebounds:

`Lower:

  0: f2->f2, Arg_1: 1 {O(1)}

  0: f2->f2, Arg_2: Arg_2 {O(n)}

  2: f2->f4, Arg_1: 1 {O(1)}

  1: f3->f2, Arg_0: Arg_0 {O(n)}

  1: f3->f2, Arg_1: 1 {O(1)}

  1: f3->f2, Arg_2: Arg_2 {O(n)}

  3: f3->f4, Arg_0: Arg_0 {O(n)}

  3: f3->f4, Arg_1: Arg_1 {O(n)}

`Upper:

  0: f2->f2, Arg_0: max([Arg_0, max([Arg_1, 1+Arg_1+8*max([1, Arg_0])])]) {O(n)}

  0: f2->f2, Arg_1: 1+Arg_1+8*max([1, Arg_0]) {O(n)}

  0: f2->f2, Arg_2: Arg_2 {O(n)}

  2: f2->f4, Arg_0: 0 {O(1)}

  2: f2->f4, Arg_1: max([Arg_1, 1+Arg_1+8*max([1, Arg_0])]) {O(n)}

  1: f3->f2, Arg_0: Arg_0 {O(n)}

  1: f3->f2, Arg_1: Arg_1 {O(n)}

  1: f3->f2, Arg_2: Arg_2 {O(n)}

  3: f3->f4, Arg_0: Arg_0 {O(n)}

  3: f3->f4, Arg_1: 0 {O(1)}


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

(2)
BOUNDS(1, max(4 + 8 * Arg_0, 12))