Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381745105
details
property
value
status
complete
benchmark
slayer-2-filtered.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n086.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.232797861099 seconds
cpu usage
0.145877177
max memory
8523776.0
stage attributes
key
value
output-size
2755
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f0/7] 1. non_recursive : [exit_location/1] 2. non_recursive : [f4/5] 3. non_recursive : [f0_loop_cont/6] 4. non_recursive : [f3/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f0/7 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f0_loop_cont/6 4. SCC is partially evaluated into f3/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f0/7 * CE 4 is refined into CE [7] * CE 2 is refined into CE [8] * CE 3 is refined into CE [9] ### Cost equations --> "Loop" of f0/7 * CEs [9] --> Loop 7 * CEs [7] --> Loop 8 * CEs [8] --> Loop 9 ### Ranking functions of CR f0(A,B,C,F,G,H,I) * RF of phase [7]: [-A+10] #### Partial ranking functions of CR f0(A,B,C,F,G,H,I) * Partial RF of phase [7]: - RF of loop [7:1]: -A+10 ### Specialization of cost equations f0_loop_cont/6 * CE 6 is refined into CE [10] * CE 5 is refined into CE [11] ### Cost equations --> "Loop" of f0_loop_cont/6 * CEs [10] --> Loop 10 * CEs [11] --> Loop 11 ### Ranking functions of CR f0_loop_cont(A,B,C,D,E,F) #### Partial ranking functions of CR f0_loop_cont(A,B,C,D,E,F) ### Specialization of cost equations f3/5 * CE 1 is refined into CE [12,13,14] ### Cost equations --> "Loop" of f3/5 * CEs [12,13,14] --> Loop 12 ### Ranking functions of CR f3(A,B,C,D,F) #### Partial ranking functions of CR f3(A,B,C,D,F) Computing Bounds ===================================== #### Cost of chains of f0(A,B,C,F,G,H,I): * Chain [[7],9]: 1*it(7)+0 Such that:it(7) =< -A+10 with precondition: [F=2,G=10,I=9,9>=A,A>=0] * Chain [[7],8]: 1*it(7)+0 Such that:it(7) =< -A+10 with precondition: [F=3,9>=A,A>=0] * Chain [8]: 0 with precondition: [F=3,A>=0] #### Cost of chains of f0_loop_cont(A,B,C,D,E,F): * Chain [11]: 0 with precondition: [A=2] * Chain [10]: 0 with precondition: [A=3]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843