details

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

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.66478300095 seconds
cpu usage	2.719535765
max memory	2.84246016E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox/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, 488 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_zwritehexstring_at_extracted_start(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb0_in(v_.0, v_.0., v_count.0, v_len)) :|: TRUE eval_zwritehexstring_at_extracted_bb0_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb1_in(v_len, v_.0., v_count.0, v_len)) :|: TRUE eval_zwritehexstring_at_extracted_bb1_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len)) :|: v_.0 > 0 eval_zwritehexstring_at_extracted_bb1_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb5_in(v_.0, v_.0., v_count.0, v_len)) :|: v_.0 <= 0 eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0, v_.0, v_len)) :|: v_.0 < 64 eval_zwritehexstring_at_extracted_bb2_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, 64, 64, v_len)) :|: v_.0 >= 64 eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0 - 1, v_len)) :|: v_count.0 - 1 > 0 eval_zwritehexstring_at_extracted_bb3_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb4_in(v_.0, v_.0., v_count.0, v_len)) :|: v_count.0 - 1 <= 0 eval_zwritehexstring_at_extracted_bb4_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_bb1_in(v_.0 - v_.0., v_.0., v_count.0, v_len)) :|: TRUE eval_zwritehexstring_at_extracted_bb5_in(v_.0, v_.0., v_count.0, v_len) -> Com_1(eval_zwritehexstring_at_extracted_stop(v_.0, v_.0., v_count.0, v_len)) :|: TRUE The start-symbols are:[eval_zwritehexstring_at_extracted_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 402*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ 63 >= ar_0 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_0 >= 64 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3 - 1)) [ ar_3 >= 2 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3)) [ 1 >= ar_3 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalzwritehexstringatextractedstart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalzwritehexstringatextractedbb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_0, ar_0)) [ 63 >= ar_0 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, 64, 64)) [ ar_0 >= 64 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3 - 1)) [ ar_3 >= 2 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3)) [ 1 >= ar_3 ] (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedbb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalzwritehexstringatextractedbb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalzwritehexstringatextractedstop(ar_0, ar_1, ar_2, ar_3)) popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445