details

property	value
status	complete
benchmark	knuth_morris_pratt.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n080.star.cs.uiowa.edu
space	C4B_examples

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.56422519684 seconds
cpu usage	3.869520491
max memory	3.55213312E8

stage attributes

key	value
output-size	78196
starexec-result	WORST_CASE(?, O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) 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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1381 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_knuth_morris_pratt_start(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb0_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_bb0_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb1_in(v_2, v_4, 0, 0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_bb1_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb2_in(v_2, v_4, v_i.0, v_j.0, v_j.0, v_m, v_n)) :|: v_i.0 < v_n eval_knuth_morris_pratt_bb1_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb6_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_i.0 >= v_n eval_knuth_morris_pratt_bb2_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb3_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_j.1 >= 0 eval_knuth_morris_pratt_bb2_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_.critedge_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_j.1 < 0 eval_knuth_morris_pratt_bb3_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_0(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_0(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_2(eval_nondet_start(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n), eval_knuth_morris_pratt_1(nondef.0, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_1(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb4_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_2 > 0 eval_knuth_morris_pratt_1(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_.critedge_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_2 <= 0 eval_knuth_morris_pratt_bb4_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_2(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_2(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_2(eval_nondet_start(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n), eval_knuth_morris_pratt_3(v_2, nondef.1, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_3(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb6_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_4 <= 0 eval_knuth_morris_pratt_3(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb6_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_4 > 0 eval_knuth_morris_pratt_3(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb5_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_4 > 0 && v_4 <= 0 eval_knuth_morris_pratt_bb5_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb2_in(v_2, v_4, v_i.0, v_j.0, v_j.1 - v_4, v_m, v_n)) :|: TRUE eval_knuth_morris_pratt_.critedge_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb6_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: v_j.1 + 1 >= v_m && v_j.1 + 1 <= v_m eval_knuth_morris_pratt_.critedge_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb1_in(v_2, v_4, v_i.0 + 1, v_j.1 + 1, v_j.1, v_m, v_n)) :|: v_j.1 + 1 < v_m eval_knuth_morris_pratt_.critedge_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_bb1_in(v_2, v_4, v_i.0 + 1, v_j.1 + 1, v_j.1, v_m, v_n)) :|: v_j.1 + 1 > v_m eval_knuth_morris_pratt_bb6_in(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n) -> Com_1(eval_knuth_morris_pratt_stop(v_2, v_4, v_i.0, v_j.0, v_j.1, v_m, v_n)) :|: TRUE The start-symbols are:[eval_knuth_morris_pratt_start_7] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 72*ar_2 + 135) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalknuthmorrisprattstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrisprattbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb1in(0, 0, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrisprattbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb2in(ar_0, ar_1, ar_2, ar_1, ar_4, ar_5, ar_6, ar_7)) [ ar_2 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= ar_2 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 >= 0 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrispratt0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt00(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt01(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrispratt1(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt0(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalknuthmorrispratt00(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7), evalknuthmorrispratt01(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= 1 ] (Comp: ?, Cost: 1) evalknuthmorrispratt1(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_4 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrispratt2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrispratt3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_5, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalknuthmorrispratt20(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7), evalknuthmorrispratt21(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrispratt3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_6 ] (Comp: ?, Cost: 1) evalknuthmorrispratt3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_6 >= 1 ] (Comp: ?, Cost: 1) evalknuthmorrispratt3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_6 >= 1 /\ 0 >= ar_6 ] (Comp: ?, Cost: 1) evalknuthmorrisprattbb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb2in(ar_0, ar_1, ar_2, ar_3 - ar_6, ar_4, ar_5, ar_6, ar_7)) (Comp: ?, Cost: 1) evalknuthmorrisprattcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalknuthmorrisprattbb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_3 + 1 = ar_7 ] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445