Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990331
details
property
value
status
complete
benchmark
slayer-n2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.217116 seconds
cpu usage
0.134248
user time
0.113927
system time
0.020321
max virtual memory
113176.0
max residence set size
10864.0
stage attributes
key
value
starexec-result
MAYBE
output
0.03/0.11 MAYBE 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 : [f0/7] 0.03/0.11 1. non_recursive : [exit_location/1] 0.03/0.11 2. non_recursive : [f3/5] 0.03/0.11 3. non_recursive : [f0_loop_cont/6] 0.03/0.11 4. non_recursive : [f2/5] 0.03/0.11 0.03/0.11 #### Obtained direct recursion through partial evaluation 0.03/0.11 0. SCC is partially evaluated into f0/7 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 f0_loop_cont/6 0.03/0.11 4. SCC is partially evaluated into f2/5 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 f0/7 0.03/0.11 * CE 4 is refined into CE [7] 0.03/0.11 * CE 2 is discarded (unfeasible) 0.03/0.11 * CE 3 is refined into CE [8] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f0/7 0.03/0.11 * CEs [8] --> Loop 7 0.03/0.11 * CEs [7] --> Loop 8 0.03/0.11 0.03/0.11 ### Ranking functions of CR f0(A,B,C,F,G,H,I) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f0(A,B,C,F,G,H,I) 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f0_loop_cont/6 0.03/0.11 * CE 6 is refined into CE [9] 0.03/0.11 * CE 5 is refined into CE [10] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f0_loop_cont/6 0.03/0.11 * CEs [9] --> Loop 9 0.03/0.11 * CEs [10] --> Loop 10 0.03/0.11 0.03/0.11 ### Ranking functions of CR f0_loop_cont(A,B,C,D,E,F) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f0_loop_cont(A,B,C,D,E,F) 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f2/5 0.03/0.11 * CE 1 is refined into CE [11,12,13] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f2/5 0.03/0.11 * CEs [12,13] --> Loop 11 0.03/0.11 * CEs [11] --> Loop 12 0.03/0.11 0.03/0.11 ### Ranking functions of CR f2(A,B,C,D,F) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f2(A,B,C,D,F) 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 f0(A,B,C,F,G,H,I): 0.03/0.11 * Chain [[7]]...: 1*it(7)+0 0.03/0.11 with precondition: [0>=A] 0.03/0.11 0.03/0.11 * Chain [[7],8]: 1*it(7)+0 0.03/0.11 with precondition: [F=3,0>=A] 0.03/0.11 0.03/0.11 * Chain [8]: 0 0.03/0.11 with precondition: [F=3,0>=A] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f0_loop_cont(A,B,C,D,E,F): 0.03/0.11 * Chain [10]: 0 0.03/0.11 with precondition: [A=2] 0.03/0.11 0.03/0.11 * Chain [9]: 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,C,D,F): 0.03/0.11 * Chain [12]: 1*s(2)+0 0.03/0.11 with precondition: [] 0.03/0.11 0.03/0.11 * Chain [11]...: 1*aux(2)+0 0.03/0.11 with precondition: [] 0.03/0.11 0.03/0.11 0.03/0.11 Closed-form bounds of f2(A,B,C,D,F): 0.03/0.11 ------------------------------------- 0.03/0.11 * Chain [12] with precondition: [] 0.03/0.11 - Upper bound: inf 0.03/0.11 - Complexity: infinity 0.03/0.11 * Chain [11]... with precondition: []
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