details

property	value
status	complete
benchmark	sumto_no_if.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n025.star.cs.uiowa.edu
space	patrs

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.71003818512 seconds
cpu usage	3.715001002
max memory	2.44383744E8

stage attributes

key	value
output-size	4696
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(3 + -1 * Arg_0 + Arg_1, 2)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 145 ms] (2) BOUNDS(1, max(3 + -1 * Arg_0 + Arg_1, 2)) (3) Loat Proof [FINISHED, 125 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: sumto(A, B) -> Com_1(end(A, B)) :|: A >= B + 1 sumto(A, B) -> Com_1(sumto(A + 1, B)) :|: B >= A start(A, B) -> Com_1(sumto(A, B)) :|: TRUE The start-symbols are:[start_2] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, max([2, 3+Arg_1-Arg_0]) {O(n)}) Initial Complexity Problem: Start: start Program_Vars: Arg_0, Arg_1 Temp_Vars: Locations: end, start, sumto Transitions: start(Arg_0,Arg_1) -> sumto(Arg_0,Arg_1):|: sumto(Arg_0,Arg_1) -> end(Arg_0,Arg_1):|:Arg_1+1 <= Arg_0 sumto(Arg_0,Arg_1) -> sumto(Arg_0+1,Arg_1):|:Arg_0 <= Arg_1 Timebounds: Overall timebound: max([2, 3+Arg_1-Arg_0]) {O(n)} 2: start->sumto: 1 {O(1)} 0: sumto->end: 1 {O(1)} 1: sumto->sumto: max([0, 1+Arg_1-Arg_0]) {O(n)} Costbounds: Overall costbound: max([2, 3+Arg_1-Arg_0]) {O(n)} 2: start->sumto: 1 {O(1)} 0: sumto->end: 1 {O(1)} 1: sumto->sumto: max([0, 1+Arg_1-Arg_0]) {O(n)} Sizebounds: `Lower: 2: start->sumto, Arg_0: Arg_0 {O(n)} 2: start->sumto, Arg_1: Arg_1 {O(n)} 0: sumto->end, Arg_0: Arg_0 {O(n)} 0: sumto->end, Arg_1: Arg_1 {O(n)} 1: sumto->sumto, Arg_0: Arg_0 {O(n)} 1: sumto->sumto, Arg_1: Arg_1 {O(n)} `Upper: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl Integ Trans Syste 26843