Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744090
details
property
value
status
complete
benchmark
Example2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Loopus
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
36.3333649635 seconds
cpu usage
81.273750901
max memory
7.00203008E8
stage attributes
key
value
output-size
71384
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 34.7 s] (2) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evalbinsearchStepSize2start(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I)) :|: TRUE evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(0, 0, 4, A, E, F, G, H, I)) :|: TRUE evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: C >= 1 && C <= 1 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: 0 >= C evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: C >= 2 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: 0 >= B + 1 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: B >= 1 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, C, G, H, I)) :|: B >= 0 && B <= 0 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, 0, G, H, I)) :|: C >= 0 && C <= 0 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: C >= 1 && J >= 0 && C >= 2 * J && 1 + 2 * J >= C evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: 0 >= C + 1 && 0 >= J && 2 * J >= C && 1 + C >= 2 * J evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I)) :|: E >= G + 1 evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I)) :|: G >= E evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I)) :|: A >= 1 && A <= 1 && B >= 0 && B <= 0 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= A evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: A >= 2 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: D + I >= 256 evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(2, H, I, D + I, E, F, G, H, I)) :|: 255 >= D + I evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I)) :|: G >= E + 1 evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: E >= G evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I)) :|: A >= 2 && A <= 2 && B >= 0 && B <= 0 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 1 >= A evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: A >= 3 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: I >= D + 1 evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(1, H, I, D - I, E, F, G, H, I)) :|: D >= I evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2stop(A, B, C, D, E, F, G, H, I)) :|: TRUE The start-symbols are:[evalbinsearchStepSize2start_9] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalbinsearchStepSize2start 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2entryin : [], cost: 1 1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1 2: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2returnin : [ C==1 ], cost: 1 3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1 4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1 5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1 6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1 7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], 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