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