Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989568
details
property
value
status
complete
benchmark
cBench_cryptRandWriteFile.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.75317 seconds
cpu usage
2.66693
user time
2.4236
system time
0.24333
max virtual memory
1.8468464E7
max residence set size
180600.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.56/1.70 WORST_CASE(?, O(n^1)) 2.56/1.71 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.56/1.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.56/1.71 2.56/1.71 2.56/1.71 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.56/1.71 2.56/1.71 (0) CpxIntTrs 2.56/1.71 (1) Koat Proof [FINISHED, 487 ms] 2.56/1.71 (2) BOUNDS(1, n^1) 2.56/1.71 2.56/1.71 2.56/1.71 ---------------------------------------- 2.56/1.71 2.56/1.71 (0) 2.56/1.71 Obligation: 2.56/1.71 Complexity Int TRS consisting of the following rules: 2.56/1.71 eval_cryptRandWriteFile_start(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb0_in(v_.0, v_.0., v_bytes, v_i.0)) :|: TRUE 2.56/1.71 eval_cryptRandWriteFile_bb0_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb1_in(v_bytes, v_.0., v_bytes, v_i.0)) :|: TRUE 2.56/1.71 eval_cryptRandWriteFile_bb1_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_.0 > 0 2.56/1.71 eval_cryptRandWriteFile_bb1_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb6_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_.0 <= 0 2.56/1.71 eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, v_.0, v_bytes, 0)) :|: v_.0 < 256 2.56/1.71 eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, 256, v_bytes, 0)) :|: v_.0 >= 256 2.56/1.71 eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb4_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_i.0 < v_.0. 2.56/1.71 eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb5_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_i.0 >= v_.0. 2.56/1.71 eval_cryptRandWriteFile_bb4_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0 + 1)) :|: TRUE 2.56/1.71 eval_cryptRandWriteFile_bb5_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb1_in(v_.0 - v_.0., v_.0., v_bytes, v_i.0)) :|: TRUE 2.56/1.71 eval_cryptRandWriteFile_bb6_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_stop(v_.0, v_.0., v_bytes, v_i.0)) :|: TRUE 2.56/1.71 2.56/1.71 The start-symbols are:[eval_cryptRandWriteFile_start_4] 2.56/1.71 2.56/1.71 2.56/1.71 ---------------------------------------- 2.56/1.71 2.56/1.71 (1) Koat Proof (FINISHED) 2.56/1.71 YES(?, 8212*ar_1 + 6) 2.56/1.71 2.56/1.71 2.56/1.71 2.56/1.71 Initial complexity problem: 2.56/1.71 2.56/1.71 1: T: 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_1, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_0, 0)) [ 255 >= ar_0 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, 256, 0)) [ ar_0 >= 256 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 1 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3 + 1)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestop(ar_0, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.56/1.71 2.56/1.71 start location: koat_start 2.56/1.71 2.56/1.71 leaf cost: 0 2.56/1.71 2.56/1.71 2.56/1.71 2.56/1.71 Repeatedly propagating knowledge in problem 1 produces the following problem: 2.56/1.71 2.56/1.71 2: T: 2.56/1.71 2.56/1.71 (Comp: 1, Cost: 1) evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: 1, Cost: 1) evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_1, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_0, 0)) [ 255 >= ar_0 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, 256, 0)) [ ar_0 >= 256 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 1 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 ] 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3 + 1)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: ?, Cost: 1) evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestop(ar_0, ar_1, ar_2, ar_3)) 2.56/1.71 2.56/1.71 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]
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