details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.53958797455 seconds
cpu usage	5.809687787
max memory	3.52493568E8

stage attributes

key	value
output-size	9543
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 851 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_catmouse_start(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb0_in(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_bb0_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_0(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_0(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_1(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_1(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_2(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_2(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_3(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_3(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_4(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_4(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_5(v_m, v_n, v_x_0)) :|: TRUE eval_catmouse_5(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, 0)) :|: TRUE eval_catmouse_bb1_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb2_in(v_m, v_n, v_x_0)) :|: v_x_0 <= v_n eval_catmouse_bb1_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb3_in(v_m, v_n, v_x_0)) :|: v_x_0 > v_n eval_catmouse_bb2_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, v_x_0 + 1)) :|: v_x_0 <= v_m eval_catmouse_bb2_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_bb1_in(v_m, v_n, v_x_0 - 1)) :|: v_x_0 > v_m eval_catmouse_bb3_in(v_m, v_n, v_x_0) -> Com_1(eval_catmouse_stop(v_m, v_n, v_x_0)) :|: TRUE The start-symbols are:[eval_catmouse_start_3] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalcatmousestart 0: evalcatmousestart -> evalcatmousebb0in : [], cost: 1 1: evalcatmousebb0in -> evalcatmouse0 : [], cost: 1 2: evalcatmouse0 -> evalcatmouse1 : [], cost: 1 3: evalcatmouse1 -> evalcatmouse2 : [], cost: 1 4: evalcatmouse2 -> evalcatmouse3 : [], cost: 1 5: evalcatmouse3 -> evalcatmouse4 : [], cost: 1 6: evalcatmouse4 -> evalcatmouse5 : [], cost: 1 7: evalcatmouse5 -> evalcatmousebb1in : A'=0, [], cost: 1 8: evalcatmousebb1in -> evalcatmousebb2in : [ B>=A ], cost: 1 9: evalcatmousebb1in -> evalcatmousebb3in : [ A>=1+B ], cost: 1 10: evalcatmousebb2in -> evalcatmousebb1in : A'=1+A, [ C>=A ], cost: 1 11: evalcatmousebb2in -> evalcatmousebb1in : A'=-1+A, [ A>=1+C ], cost: 1 12: evalcatmousebb3in -> evalcatmousestop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalcatmousestart 0: evalcatmousestart -> evalcatmousebb0in : [], cost: 1 1: evalcatmousebb0in -> evalcatmouse0 : [], cost: 1 2: evalcatmouse0 -> evalcatmouse1 : [], cost: 1 3: evalcatmouse1 -> evalcatmouse2 : [], cost: 1 4: evalcatmouse2 -> evalcatmouse3 : [], cost: 1 5: evalcatmouse3 -> evalcatmouse4 : [], cost: 1 6: evalcatmouse4 -> evalcatmouse5 : [], cost: 1 7: evalcatmouse5 -> evalcatmousebb1in : A'=0, [], 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