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


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


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox/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, 1).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A) -> Com_1(f8(A)) :|: 0 >= B + 1
f0(A) -> Com_1(f8(A)) :|: TRUE
f0(A) -> Com_1(f8(B)) :|: TRUE

The start-symbols are:[f0_1]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 3 {O(1)})



Initial Complexity Problem:

  Start:  f0  

  Program_Vars:  Arg_0  

  Temp_Vars:  B  

  Locations:  f0, f8  

  Transitions:

  0: f0->f8

  1: f0->f8

  2: f0->f8  



Timebounds: 

  Overall timebound: 3 {O(1)}

  0: f0->f8: 1 {O(1)}

  1: f0->f8: 1 {O(1)}

  2: f0->f8: 1 {O(1)}



Costbounds:

  Overall costbound: 3 {O(1)}

  0: f0->f8: 1 {O(1)}

  1: f0->f8: 1 {O(1)}

  2: f0->f8: 1 {O(1)}



Sizebounds:

`Lower:

  

`Upper:

  


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

(2)
BOUNDS(1, 1)