details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.24825406075 seconds
cpu usage	6.909996417
max memory	4.11213824E8

stage attributes

key	value
output-size	7416
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 591 ms] (2) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedFails3_start(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb0_in(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_bb0_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_0(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_0(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_1(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_1(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_2(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_2(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_3(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_3(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_4(v__0, nondef_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_4(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_5(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_5(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_6(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_6(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_7(v__0, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_7(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v_x, v_0, v_n, v_t, v_x)) :|: TRUE eval_speedFails3_bb1_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb2_in(v__0, v_0, v_n, v_t, v_x)) :|: v__0 >= 0 && v__0 <= v_n eval_speedFails3_bb1_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb3_in(v__0, v_0, v_n, v_t, v_x)) :|: v__0 < 0 eval_speedFails3_bb1_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb3_in(v__0, v_0, v_n, v_t, v_x)) :|: v__0 > v_n eval_speedFails3_bb2_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v__0 + v_t, v_0, v_n, v_t, v_x)) :|: v_0 > 0 eval_speedFails3_bb2_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_bb1_in(v__0 - v_t, v_0, v_n, v_t, v_x)) :|: v_0 <= 0 eval_speedFails3_bb3_in(v__0, v_0, v_n, v_t, v_x) -> Com_1(eval_speedFails3_stop(v__0, v_0, v_n, v_t, v_x)) :|: TRUE The start-symbols are:[eval_speedFails3_start_5] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalspeedFails3start 0: evalspeedFails3start -> evalspeedFails3bb0in : [], cost: 1 1: evalspeedFails3bb0in -> evalspeedFails30 : [], cost: 1 2: evalspeedFails30 -> evalspeedFails31 : [], cost: 1 3: evalspeedFails31 -> evalspeedFails32 : [], cost: 1 4: evalspeedFails32 -> evalspeedFails33 : [], cost: 1 5: evalspeedFails33 -> evalspeedFails34 : A'=free, [], cost: 1 6: evalspeedFails34 -> evalspeedFails35 : [], cost: 1 7: evalspeedFails35 -> evalspeedFails36 : [], cost: 1 8: evalspeedFails36 -> evalspeedFails37 : [], cost: 1 9: evalspeedFails37 -> evalspeedFails3bb1in : B'=C, [], cost: 1 10: evalspeedFails3bb1in -> evalspeedFails3bb2in : [ B>=0 && D>=B ], cost: 1 11: evalspeedFails3bb1in -> evalspeedFails3bb3in : [ 0>=1+B ], cost: 1 12: evalspeedFails3bb1in -> evalspeedFails3bb3in : [ B>=1+D ], cost: 1 13: evalspeedFails3bb2in -> evalspeedFails3bb1in : B'=E+B, [ A>=1 ], cost: 1 14: evalspeedFails3bb2in -> evalspeedFails3bb1in : B'=-E+B, [ 0>=A ], cost: 1 15: evalspeedFails3bb3in -> evalspeedFails3stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalspeedFails3start 0: evalspeedFails3start -> evalspeedFails3bb0in : [], cost: 1 1: evalspeedFails3bb0in -> evalspeedFails30 : [], cost: 1 2: evalspeedFails30 -> evalspeedFails31 : [], 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