details

property	value
status	complete
benchmark	t19.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n078.star.cs.uiowa.edu
space	C4B_examples

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.28673601151 seconds
cpu usage	2.419238397
max memory	2.35593728E8

stage attributes

key	value
output-size	13855
starexec-result	WORST_CASE(?, O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 87 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_t19_start(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb0_in(v_.0, v_.1, v_i, v_k)) :|: TRUE eval_t19_bb0_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb1_in(v_i, v_.1, v_i, v_k)) :|: TRUE eval_t19_bb1_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb2_in(v_.0, v_.1, v_i, v_k)) :|: v_.0 > 100 eval_t19_bb1_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb3_in(v_.0, v_.1, v_i, v_k)) :|: v_.0 <= 100 eval_t19_bb2_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb1_in(v_.0 - 1, v_.1, v_i, v_k)) :|: TRUE eval_t19_bb3_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb4_in(v_.0, v_.0 + v_k + 50, v_i, v_k)) :|: TRUE eval_t19_bb4_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb5_in(v_.0, v_.1, v_i, v_k)) :|: v_.1 >= 0 eval_t19_bb4_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb6_in(v_.0, v_.1, v_i, v_k)) :|: v_.1 < 0 eval_t19_bb5_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_bb4_in(v_.0, v_.1 - 1, v_i, v_k)) :|: TRUE eval_t19_bb6_in(v_.0, v_.1, v_i, v_k) -> Com_1(eval_t19_stop(v_.0, v_.1, v_i, v_k)) :|: TRUE The start-symbols are:[eval_t19_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_3 + 422) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalt19start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt19bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt19bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 101 ] (Comp: ?, Cost: 1) evalt19bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb3in(ar_0, ar_1, ar_2, ar_3)) [ 100 >= ar_0 ] (Comp: ?, Cost: 1) evalt19bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt19bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb4in(ar_0, ar_1, ar_0 + ar_3 + 50, ar_3)) (Comp: ?, Cost: 1) evalt19bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 ] (Comp: ?, Cost: 1) evalt19bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalt19bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb4in(ar_0, ar_1, ar_2 - 1, ar_3)) (Comp: ?, Cost: 1) evalt19bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalt19start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalt19bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt19bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 101 ] (Comp: ?, Cost: 1) evalt19bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb3in(ar_0, ar_1, ar_2, ar_3)) [ 100 >= ar_0 ] (Comp: ?, Cost: 1) evalt19bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalt19bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb4in(ar_0, ar_1, ar_0 + ar_3 + 50, ar_3)) (Comp: ?, Cost: 1) evalt19bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 ] (Comp: ?, Cost: 1) evalt19bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalt19bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19bb4in(ar_0, ar_1, ar_2 - 1, ar_3)) (Comp: ?, Cost: 1) evalt19bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalt19stop(ar_0, ar_1, ar_2, ar_3)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445