Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989659
details
property
value
status
complete
benchmark
speedFails1.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n160.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.224785 seconds
cpu usage
0.14727
user time
0.113614
system time
0.033656
max virtual memory
113176.0
max residence set size
10988.0
stage attributes
key
value
starexec-result
MAYBE
output
0.04/0.12 MAYBE 0.04/0.12 0.04/0.12 Preprocessing Cost Relations 0.04/0.12 ===================================== 0.04/0.12 0.04/0.12 #### Computed strongly connected components 0.04/0.12 0. recursive : [eval_speedFails1_bb1_in/4,eval_speedFails1_bb2_in/4] 0.04/0.12 1. non_recursive : [eval_speedFails1_stop/1] 0.04/0.12 2. non_recursive : [eval_speedFails1_bb3_in/1] 0.04/0.12 3. non_recursive : [eval_speedFails1_bb1_in_loop_cont/2] 0.04/0.12 4. non_recursive : [eval_speedFails1_bb0_in/4] 0.04/0.12 5. non_recursive : [eval_speedFails1_start/4] 0.04/0.12 0.04/0.12 #### Obtained direct recursion through partial evaluation 0.04/0.12 0. SCC is partially evaluated into eval_speedFails1_bb1_in/4 0.04/0.12 1. SCC is completely evaluated into other SCCs 0.04/0.12 2. SCC is completely evaluated into other SCCs 0.04/0.12 3. SCC is completely evaluated into other SCCs 0.04/0.12 4. SCC is partially evaluated into eval_speedFails1_bb0_in/4 0.04/0.12 5. SCC is partially evaluated into eval_speedFails1_start/4 0.04/0.12 0.04/0.12 Control-Flow Refinement of Cost Relations 0.04/0.12 ===================================== 0.04/0.12 0.04/0.12 ### Specialization of cost equations eval_speedFails1_bb1_in/4 0.04/0.12 * CE 4 is refined into CE [5] 0.04/0.12 * CE 3 is refined into CE [6] 0.04/0.12 0.04/0.12 0.04/0.12 ### Cost equations --> "Loop" of eval_speedFails1_bb1_in/4 0.04/0.12 * CEs [6] --> Loop 5 0.04/0.12 * CEs [5] --> Loop 6 0.04/0.12 0.04/0.12 ### Ranking functions of CR eval_speedFails1_bb1_in(V_n,V_m,V__0,B) 0.04/0.12 0.04/0.12 #### Partial ranking functions of CR eval_speedFails1_bb1_in(V_n,V_m,V__0,B) 0.04/0.12 0.04/0.12 0.04/0.12 ### Specialization of cost equations eval_speedFails1_bb0_in/4 0.04/0.12 * CE 2 is refined into CE [7,8,9] 0.04/0.12 0.04/0.12 0.04/0.12 ### Cost equations --> "Loop" of eval_speedFails1_bb0_in/4 0.04/0.12 * CEs [9] --> Loop 7 0.04/0.12 * CEs [8] --> Loop 8 0.04/0.12 * CEs [7] --> Loop 9 0.04/0.12 0.04/0.12 ### Ranking functions of CR eval_speedFails1_bb0_in(V_i,V_n,V_m,B) 0.04/0.12 0.04/0.12 #### Partial ranking functions of CR eval_speedFails1_bb0_in(V_i,V_n,V_m,B) 0.04/0.12 0.04/0.12 0.04/0.12 ### Specialization of cost equations eval_speedFails1_start/4 0.04/0.12 * CE 1 is refined into CE [10,11,12] 0.04/0.12 0.04/0.12 0.04/0.12 ### Cost equations --> "Loop" of eval_speedFails1_start/4 0.04/0.12 * CEs [12] --> Loop 10 0.04/0.12 * CEs [11] --> Loop 11 0.04/0.12 * CEs [10] --> Loop 12 0.04/0.12 0.04/0.12 ### Ranking functions of CR eval_speedFails1_start(V_i,V_n,V_m,B) 0.04/0.12 0.04/0.12 #### Partial ranking functions of CR eval_speedFails1_start(V_i,V_n,V_m,B) 0.04/0.12 0.04/0.12 0.04/0.12 Computing Bounds 0.04/0.12 ===================================== 0.04/0.12 0.04/0.12 #### Cost of chains of eval_speedFails1_bb1_in(V_n,V_m,V__0,B): 0.04/0.12 * Chain [[5]]...: 1*it(5)+0 0.04/0.12 with precondition: [V_n>=V__0,B=2] 0.04/0.12 0.04/0.12 * Chain [[5],6]: 1*it(5)+0 0.04/0.12 with precondition: [B=2,V_m>=1,V_n>=V__0] 0.04/0.12 0.04/0.12 * Chain [6]: 0 0.04/0.12 with precondition: [B=2,V__0>=V_n+1] 0.04/0.12 0.04/0.12 0.04/0.12 #### Cost of chains of eval_speedFails1_bb0_in(V_i,V_n,V_m,B): 0.04/0.12 * Chain [9]: 1*s(1)+0 0.04/0.12 with precondition: [V_m>=1,V_n>=V_i] 0.04/0.12 0.04/0.12 * Chain [8]: 0 0.04/0.12 with precondition: [V_i>=V_n+1] 0.04/0.12 0.04/0.12 * Chain [7]...: 1*s(2)+0 0.04/0.12 with precondition: [V_n>=V_i] 0.04/0.12 0.04/0.12 0.04/0.12 #### Cost of chains of eval_speedFails1_start(V_i,V_n,V_m,B): 0.04/0.12 * Chain [12]: 1*s(3)+0 0.04/0.12 with precondition: [V_m>=1,V_n>=V_i] 0.04/0.12 0.04/0.12 * Chain [11]: 0 0.04/0.12 with precondition: [V_i>=V_n+1] 0.04/0.12 0.04/0.12 * Chain [10]...: 1*s(4)+0 0.04/0.12 with precondition: [V_n>=V_i]
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