Compl Integ Trans Syste 26843 pair #381744701

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	9.33770799637 seconds
cpu usage	12.86804887
max memory	3.7453824E8

stage attributes

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

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^2))
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(10 + 2 * Arg_2, 10) + nat(Arg_2^2) + nat(4 * Arg_2) + max(2, 2 + Arg_2) + nat(1 + 4 * Arg_2) + nat(Arg_2^2) * nat(Arg_2) + nat(Arg_2)^2).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 1118 ms]
(2) BOUNDS(n^1, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_foo_start(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb0_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_bb0_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_0(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_0(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_1(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_1(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_2(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_2(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_3(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_3(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_4(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_4(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_5(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_5(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_6(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_6(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_7(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_7(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb1_in(v_1, v_2, v_3, v_n, v_p_0, 0, v_n)) :|: TRUE
eval_foo_bb1_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb2_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: v_x_0 > 0
eval_foo_bb1_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb5_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: v_x_0 <= 0
eval_foo_bb2_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_10(v_x_0 - 1, v_r_0 + 1, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_10(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_11(v_1, v_2, nondef_0, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE
eval_foo_11(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb3_in(v_1, v_2, v_3, v_n, v_2, v_r_0, v_x_0)) :|: v_3 > 0
eval_foo_11(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb1_in(v_1, v_2, v_3, v_n, v_p_0, v_2, v_1)) :|: v_3 <= 0
eval_foo_bb3_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb4_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: v_p_0 > 0
eval_foo_bb3_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb1_in(v_1, v_2, v_3, v_n, v_p_0, 0, v_1)) :|: v_p_0 <= 0
eval_foo_bb4_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_bb3_in(v_1, v_2, v_3, v_n, v_p_0 - 1, v_r_0, v_x_0)) :|: TRUE
eval_foo_bb5_in(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0) -> Com_1(eval_foo_stop(v_1, v_2, v_3, v_n, v_p_0, v_r_0, v_x_0)) :|: TRUE

The start-symbols are:[eval_foo_start_7]


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

(1) Loat Proof (FINISHED)


### Pre-processing the ITS problem ###



Initial linear ITS problem

   Start location: evalfoostart

      0: evalfoostart -> evalfoobb0in : [], cost: 1

      1: evalfoobb0in -> evalfoo0 : [], cost: 1

      2: evalfoo0 -> evalfoo1 : [], cost: 1

      3: evalfoo1 -> evalfoo2 : [], cost: 1

      4: evalfoo2 -> evalfoo3 : [], cost: 1

      5: evalfoo3 -> evalfoo4 : [], cost: 1

      6: evalfoo4 -> evalfoo5 : [], cost: 1

      7: evalfoo5 -> evalfoo6 : [], cost: 1

      8: evalfoo6 -> evalfoo7 : [], cost: 1

      9: evalfoo7 -> evalfoobb1in : A'=0, B'=C, [], cost: 1

     10: evalfoobb1in -> evalfoobb2in : [ B>=1 ], cost: 1

     11: evalfoobb1in -> evalfoobb5in : [ 0>=B ], cost: 1

     12: evalfoobb2in -> evalfoo10 : D'=-1+B, E'=1+A, [], cost: 1

     13: evalfoo10 -> evalfoo11 : F'=free, [], cost: 1

     14: evalfoo11 -> evalfoobb3in : G'=E, [ F>=1 ], cost: 1

     15: evalfoo11 -> evalfoobb1in : A'=E, B'=D, [ 0>=F ], cost: 1

     16: evalfoobb3in -> evalfoobb4in : [ G>=1 ], cost: 1

     17: evalfoobb3in -> evalfoobb1in : A'=0, B'=D, [ 0>=G ], cost: 1

     18: evalfoobb4in -> evalfoobb3in : G'=-1+G, [], cost: 1

     19: evalfoobb5in -> evalfoostop : [], cost: 1

popout

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

job log

popout

actions all output return to Compl Integ Trans Syste 26843