Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989198
details
property
value
status
complete
benchmark
WhileFalse_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n170.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.21196 seconds
cpu usage
2.21368
user time
2.06771
system time
0.14597
max virtual memory
1.8273396E7
max residence set size
188468.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(1))
output
2.11/1.18 WORST_CASE(?, O(1)) 2.11/1.19 proof of /export/starexec/sandbox2/output/output_files/bench.koat 2.11/1.19 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.11/1.19 2.11/1.19 2.11/1.19 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1). 2.11/1.19 2.11/1.19 (0) CpxIntTrs 2.11/1.19 (1) Koat Proof [FINISHED, 0 ms] 2.11/1.19 (2) BOUNDS(1, 1) 2.11/1.19 2.11/1.19 2.11/1.19 ---------------------------------------- 2.11/1.19 2.11/1.19 (0) 2.11/1.19 Obligation: 2.11/1.19 Complexity Int TRS consisting of the following rules: 2.11/1.19 eval_foo_start -> Com_1(eval_foo_stop) :|: TRUE 2.11/1.19 2.11/1.19 The start-symbols are:[eval_foo_start] 2.11/1.19 2.11/1.19 2.11/1.19 ---------------------------------------- 2.11/1.19 2.11/1.19 (1) Koat Proof (FINISHED) 2.11/1.19 YES(?, 1) 2.11/1.19 2.11/1.19 2.11/1.19 2.11/1.19 Initial complexity problem: 2.11/1.19 2.11/1.19 1: T: 2.11/1.19 2.11/1.19 (Comp: ?, Cost: 1) evalfoostart() -> Com_1(evalfoostop()) 2.11/1.19 2.11/1.19 (Comp: 1, Cost: 0) koat_start() -> Com_1(evalfoostart()) [ 0 <= 0 ] 2.11/1.19 2.11/1.19 start location: koat_start 2.11/1.19 2.11/1.19 leaf cost: 0 2.11/1.19 2.11/1.19 2.11/1.19 2.11/1.19 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.11/1.19 2.11/1.19 2: T: 2.11/1.19 2.11/1.19 (Comp: 1, Cost: 1) evalfoostart() -> Com_1(evalfoostop()) 2.11/1.19 2.11/1.19 (Comp: 1, Cost: 0) koat_start() -> Com_1(evalfoostart()) [ 0 <= 0 ] 2.11/1.19 2.11/1.19 start location: koat_start 2.11/1.19 2.11/1.19 leaf cost: 0 2.11/1.19 2.11/1.19 2.11/1.19 2.11/1.19 Complexity upper bound 1 2.11/1.19 2.11/1.19 2.11/1.19 2.11/1.19 Time: 0.002 sec (SMT: 0.001 sec) 2.11/1.19 2.11/1.19 2.11/1.19 ---------------------------------------- 2.11/1.19 2.11/1.19 (2) 2.11/1.19 BOUNDS(1, 1) 2.11/1.21 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38