details

property	value
status	complete
benchmark	TelAviv-Amir-Minimum_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n050.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	4.45350384712 seconds
cpu usage	5.783241056
max memory	3.75119872E8

stage attributes

key	value
output-size	3414
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE proof of /export/starexec/sandbox2/output/output_files/bench.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 ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: TRUE eval_foo_bb0_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, v_y, v_.12, v_3, v_8, v_x, v_y)) :|: TRUE eval_foo_bb1_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: v_.0 > 0 && v_.01 > 0 eval_foo_bb1_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: v_.0 <= 0 eval_foo_bb1_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: v_.01 <= 0 eval_foo_bb2_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_0(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: TRUE eval_foo_0(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y), eval_foo_1(v_.0, v_.01, v_.12, nondef.0, v_8, v_x, v_y)) :|: TRUE eval_foo_1(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_4(v_.0, v_.01, v_.0 - 1, v_3, v_8, v_x, v_y)) :|: v_.0 < v_.01 eval_foo_1(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_4(v_.0, v_.01, v_.01 - 1, v_3, v_8, v_x, v_y)) :|: v_.0 >= v_.01 eval_foo_4(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y), eval_foo_5(v_.0, v_.01, v_.12, v_3, nondef.1, v_x, v_y)) :|: TRUE eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_8, v_.12, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 < 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_8, v_.12, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 < 0 && v_3 > 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_8, v_.12, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 > 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.12, v_.12, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 < 0 && v_3 >= 0 && v_3 <= 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.12, v_.12, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 > 0 && v_3 >= 0 && v_3 <= 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_8, v_8, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 >= 0 && v_3 <= 0 && v_3 < 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_8, v_8, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 >= 0 && v_3 <= 0 && v_3 > 0 eval_foo_5(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.12, v_8, v_.12, v_3, v_8, v_x, v_y)) :|: v_3 >= 0 && v_3 <= 0 eval_foo_bb3_in(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_.12, v_3, v_8, v_x, v_y)) :|: TRUE The start-symbols are:[eval_foo_start_7] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445