Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990743
details
property
value
status
complete
benchmark
p-49.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.218172 seconds
cpu usage
0.136125
user time
0.11914
system time
0.016985
max virtual memory
113176.0
max residence set size
11028.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
0.03/0.11 WORST_CASE(?,O(n^1)) 0.03/0.11 0.03/0.11 Preprocessing Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Computed strongly connected components 0.03/0.11 0. recursive : [f300/5] 0.03/0.11 1. non_recursive : [exit_location/1] 0.03/0.11 2. non_recursive : [f1/3] 0.03/0.11 3. non_recursive : [f300_loop_cont/4] 0.03/0.11 4. non_recursive : [f2/3] 0.03/0.11 0.03/0.11 #### Obtained direct recursion through partial evaluation 0.03/0.11 0. SCC is partially evaluated into f300/5 0.03/0.11 1. SCC is completely evaluated into other SCCs 0.03/0.11 2. SCC is completely evaluated into other SCCs 0.03/0.11 3. SCC is partially evaluated into f300_loop_cont/4 0.03/0.11 4. SCC is partially evaluated into f2/3 0.03/0.11 0.03/0.11 Control-Flow Refinement of Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 ### Specialization of cost equations f300/5 0.03/0.11 * CE 4 is refined into CE [7] 0.03/0.11 * CE 2 is refined into CE [8] 0.03/0.11 * CE 3 is refined into CE [9] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f300/5 0.03/0.11 * CEs [9] --> Loop 7 0.03/0.11 * CEs [7] --> Loop 8 0.03/0.11 * CEs [8] --> Loop 9 0.03/0.11 0.03/0.11 ### Ranking functions of CR f300(A,B,D,E,F) 0.03/0.11 * RF of phase [7]: [A+1] 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f300(A,B,D,E,F) 0.03/0.11 * Partial RF of phase [7]: 0.03/0.11 - RF of loop [7:1]: 0.03/0.11 A+1 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f300_loop_cont/4 0.03/0.11 * CE 6 is refined into CE [10] 0.03/0.11 * CE 5 is refined into CE [11] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f300_loop_cont/4 0.03/0.11 * CEs [10] --> Loop 10 0.03/0.11 * CEs [11] --> Loop 11 0.03/0.11 0.03/0.11 ### Ranking functions of CR f300_loop_cont(A,B,C,D) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f300_loop_cont(A,B,C,D) 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f2/3 0.03/0.11 * CE 1 is refined into CE [12,13,14,15] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f2/3 0.03/0.11 * CEs [12,15] --> Loop 12 0.03/0.11 * CEs [13] --> Loop 13 0.03/0.11 * CEs [14] --> Loop 14 0.03/0.11 0.03/0.11 ### Ranking functions of CR f2(A,B,D) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f2(A,B,D) 0.03/0.11 0.03/0.11 0.03/0.11 Computing Bounds 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Cost of chains of f300(A,B,D,E,F): 0.03/0.11 * Chain [[7],9]: 1*it(7)+0 0.03/0.11 Such that:it(7) =< A+1 0.03/0.11 0.03/0.11 with precondition: [D=2,E+1=0,A>=0] 0.03/0.11 0.03/0.11 * Chain [[7],8]: 1*it(7)+0 0.03/0.11 Such that:it(7) =< A+1 0.03/0.11 0.03/0.11 with precondition: [D=3,A>=0] 0.03/0.11 0.03/0.11 * Chain [9]: 0 0.03/0.11 with precondition: [D=2,A=E,0>=A+1] 0.03/0.11 0.03/0.11 * Chain [8]: 0 0.03/0.11 with precondition: [D=3] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f300_loop_cont(A,B,C,D): 0.03/0.11 * Chain [11]: 0 0.03/0.11 with precondition: [A=2] 0.03/0.11 0.03/0.11 * Chain [10]: 0 0.03/0.11 with precondition: [A=3] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f2(A,B,D):
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46