details

property	value
status	complete
benchmark	constants.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n028.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.62479090691 seconds
cpu usage	3.639394972
max memory	2.68128256E8

stage attributes

key	value
output-size	7027
starexec-result	WORST_CASE(?, O(1))

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(1)) 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, 1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 22 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f12(A, B, C, D, E, F) -> Com_1(f5(400, 0, 0, D, E, F)) :|: TRUE f5(A, B, C, D, E, F) -> Com_1(f11(A, B, 0, 0, 0, F)) :|: B >= A && C >= 0 && C <= 0 f5(A, B, C, D, E, F) -> Com_1(f10(A, B, C, C, C, F)) :|: C >= 1 f5(A, B, C, D, E, F) -> Com_1(f10(A, B, C, C, C, F)) :|: 0 >= C + 1 f7(A, B, C, D, E, F) -> Com_1(f5(A, 1 + B, G, H, E, G)) :|: TRUE f8(A, B, C, D, E, F) -> Com_1(f5(A, 1 + B, G, H, E, G)) :|: TRUE f5(A, B, C, D, E, F) -> Com_1(f5(A, 1 + B, G, H, E, G)) :|: A >= 1 + B && C >= 0 && C <= 0 The start-symbols are:[f12_6] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 404) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f5(400, 0, 0, ar_3, ar_4, ar_5)) (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f11(ar_0, ar_1, 0, 0, 0, ar_5)) [ ar_1 >= ar_0 /\ ar_2 = 0 ] (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f10(ar_0, ar_1, ar_2, ar_2, ar_2, ar_5)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f10(ar_0, ar_1, ar_2, ar_2, ar_2, ar_5)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) f7(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f5(ar_0, ar_1 + 1, g, h, ar_4, g)) (Comp: ?, Cost: 1) f8(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f5(ar_0, ar_1 + 1, g, h, ar_4, g)) (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f5(ar_0, ar_1 + 1, g, h, ar_4, g)) [ ar_0 >= ar_1 + 1 /\ ar_2 = 0 ] (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(f12(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Slicing away variables that do not contribute to conditions from problem 1 leaves variables [ar_0, ar_1, ar_2]. We thus obtain the following problem: 2: T: (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(f12(ar_0, ar_1, ar_2)) [ 0 <= 0 ] (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2) -> Com_1(f5(ar_0, ar_1 + 1, g)) [ ar_0 >= ar_1 + 1 /\ ar_2 = 0 ] (Comp: ?, Cost: 1) f8(ar_0, ar_1, ar_2) -> Com_1(f5(ar_0, ar_1 + 1, g)) (Comp: ?, Cost: 1) f7(ar_0, ar_1, ar_2) -> Com_1(f5(ar_0, ar_1 + 1, g)) (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2) -> Com_1(f10(ar_0, ar_1, ar_2)) [ 0 >= ar_2 + 1 ] (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2) -> Com_1(f10(ar_0, ar_1, ar_2)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) f5(ar_0, ar_1, ar_2) -> Com_1(f11(ar_0, ar_1, 0)) [ ar_1 >= ar_0 /\ ar_2 = 0 ] (Comp: ?, Cost: 1) f12(ar_0, ar_1, ar_2) -> Com_1(f5(400, 0, 0)) start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 2: f8(ar_0, ar_1, ar_2) -> Com_1(f5(ar_0, ar_1 + 1, g)) f7(ar_0, ar_1, ar_2) -> Com_1(f5(ar_0, ar_1 + 1, g)) popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843