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	n058.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	3.47432 seconds
cpu usage	6.90778
user time	6.52494
system time	0.382842
max virtual memory	1.8724516E7
max residence set size	218772.0

stage attributes

key	value
starexec-result	MAYBE

output

6.79/3.15 MAYBE 6.79/3.16 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 6.79/3.16 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.79/3.16 6.79/3.16 6.79/3.16 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF). 6.79/3.16 6.79/3.16 (0) CpxIntTrs 6.79/3.16 (1) Loat Proof [FINISHED, 602 ms] 6.79/3.16 (2) BOUNDS(1, INF) 6.79/3.16 6.79/3.16 6.79/3.16 ---------------------------------------- 6.79/3.16 6.79/3.16 (0) 6.79/3.16 Obligation: 6.79/3.16 Complexity Int TRS consisting of the following rules: 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 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 6.79/3.16 6.79/3.16 The start-symbols are:[eval_speedFails3_start_5] 6.79/3.16 6.79/3.16 6.79/3.16 ---------------------------------------- 6.79/3.16 6.79/3.16 (1) Loat Proof (FINISHED) 6.79/3.16 6.79/3.16 6.79/3.16 ### Pre-processing the ITS problem ### 6.79/3.16 6.79/3.16 6.79/3.16 6.79/3.16 Initial linear ITS problem 6.79/3.16 6.79/3.16 Start location: evalspeedFails3start 6.79/3.16 6.79/3.16 0: evalspeedFails3start -> evalspeedFails3bb0in : [], cost: 1 6.79/3.16 6.79/3.16 1: evalspeedFails3bb0in -> evalspeedFails30 : [], cost: 1 6.79/3.16 6.79/3.16 2: evalspeedFails30 -> evalspeedFails31 : [], cost: 1 6.79/3.16 6.79/3.16 3: evalspeedFails31 -> evalspeedFails32 : [], cost: 1 6.79/3.16 6.79/3.16 4: evalspeedFails32 -> evalspeedFails33 : [], cost: 1 6.79/3.16 6.79/3.16 5: evalspeedFails33 -> evalspeedFails34 : A'=free, [], cost: 1 6.79/3.16 6.79/3.16 6: evalspeedFails34 -> evalspeedFails35 : [], cost: 1 6.79/3.16 6.79/3.16 7: evalspeedFails35 -> evalspeedFails36 : [], cost: 1 6.79/3.16 6.79/3.16 8: evalspeedFails36 -> evalspeedFails37 : [], cost: 1 6.79/3.16 6.79/3.16 9: evalspeedFails37 -> evalspeedFails3bb1in : B'=C, [], cost: 1 6.79/3.16 6.79/3.16 10: evalspeedFails3bb1in -> evalspeedFails3bb2in : [ B>=0 && D>=B ], cost: 1 6.79/3.16 6.79/3.16 11: evalspeedFails3bb1in -> evalspeedFails3bb3in : [ 0>=1+B ], cost: 1 6.79/3.16 6.79/3.16 12: evalspeedFails3bb1in -> evalspeedFails3bb3in : [ B>=1+D ], cost: 1 6.79/3.16 6.79/3.16 13: evalspeedFails3bb2in -> evalspeedFails3bb1in : B'=E+B, [ A>=1 ], cost: 1 6.79/3.16 6.79/3.16 14: evalspeedFails3bb2in -> evalspeedFails3bb1in : B'=-E+B, [ 0>=A ], cost: 1 6.79/3.16 6.79/3.16 15: evalspeedFails3bb3in -> evalspeedFails3stop : [], cost: 1 6.79/3.16 6.79/3.16 6.79/3.16 6.79/3.16 Removed unreachable and leaf rules: 6.79/3.16 6.79/3.16 Start location: evalspeedFails3start 6.79/3.16 6.79/3.16 0: evalspeedFails3start -> evalspeedFails3bb0in : [], cost: 1 6.79/3.16 6.79/3.16 1: evalspeedFails3bb0in -> evalspeedFails30 : [], cost: 1 6.79/3.16 6.79/3.16 2: evalspeedFails30 -> evalspeedFails31 : [], cost: 1 6.79/3.16 6.79/3.16 3: evalspeedFails31 -> evalspeedFails32 : [], cost: 1 6.79/3.16 6.79/3.16 4: evalspeedFails32 -> evalspeedFails33 : [], cost: 1 6.79/3.16 6.79/3.16 5: evalspeedFails33 -> evalspeedFails34 : A'=free, [], cost: 1 6.79/3.16 popout

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

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46