details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.75552392006 seconds
cpu usage	5.643201041
max memory	3.945472E8

stage attributes

key	value
output-size	5061
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, 330 ms] (2) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedFails1_start(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb0_in(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_bb0_in(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_0(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_0(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_1(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_1(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_2(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_2(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_3(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_3(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_4(v__0, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_4(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb1_in(v_i, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_bb1_in(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb2_in(v__0, v_i, v_m, v_n)) :|: v__0 <= v_n eval_speedFails1_bb1_in(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb3_in(v__0, v_i, v_m, v_n)) :|: v__0 > v_n eval_speedFails1_bb2_in(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_bb1_in(v__0 + v_m, v_i, v_m, v_n)) :|: TRUE eval_speedFails1_bb3_in(v__0, v_i, v_m, v_n) -> Com_1(eval_speedFails1_stop(v__0, v_i, v_m, v_n)) :|: TRUE The start-symbols are:[eval_speedFails1_start_4] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalspeedFails1start 0: evalspeedFails1start -> evalspeedFails1bb0in : [], cost: 1 1: evalspeedFails1bb0in -> evalspeedFails10 : [], cost: 1 2: evalspeedFails10 -> evalspeedFails11 : [], cost: 1 3: evalspeedFails11 -> evalspeedFails12 : [], cost: 1 4: evalspeedFails12 -> evalspeedFails13 : [], cost: 1 5: evalspeedFails13 -> evalspeedFails14 : [], cost: 1 6: evalspeedFails14 -> evalspeedFails1bb1in : A'=B, [], cost: 1 7: evalspeedFails1bb1in -> evalspeedFails1bb2in : [ C>=A ], cost: 1 8: evalspeedFails1bb1in -> evalspeedFails1bb3in : [ A>=1+C ], cost: 1 9: evalspeedFails1bb2in -> evalspeedFails1bb1in : A'=D+A, [], cost: 1 10: evalspeedFails1bb3in -> evalspeedFails1stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalspeedFails1start 0: evalspeedFails1start -> evalspeedFails1bb0in : [], cost: 1 1: evalspeedFails1bb0in -> evalspeedFails10 : [], cost: 1 2: evalspeedFails10 -> evalspeedFails11 : [], cost: 1 3: evalspeedFails11 -> evalspeedFails12 : [], cost: 1 4: evalspeedFails12 -> evalspeedFails13 : [], cost: 1 5: evalspeedFails13 -> evalspeedFails14 : [], cost: 1 6: evalspeedFails14 -> evalspeedFails1bb1in : A'=B, [], cost: 1 7: evalspeedFails1bb1in -> evalspeedFails1bb2in : [ C>=A ], cost: 1 9: evalspeedFails1bb2in -> evalspeedFails1bb1in : A'=D+A, [], cost: 1 ### Simplification by acceleration and chaining ### popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843