Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745859
details
property
value
status
complete
benchmark
ComplxStruc.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.395888090134 seconds
cpu usage
0.264857246
max memory
8806400.0
stage attributes
key
value
output-size
3814
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/4,eval_foo_bb5_in/4,eval_foo_bb6_in/3,eval_foo_bb7_in/3,eval_foo_bb8_in/3] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb9_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/2] 5. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_foo_bb0_in/2 5. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 7 is refined into CE [8] * CE 3 is refined into CE [9] * CE 6 is refined into CE [10] * CE 5 is refined into CE [11] * CE 4 is refined into CE [12] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [10] --> Loop 8 * CEs [11] --> Loop 9 * CEs [12] --> Loop 10 * CEs [9] --> Loop 11 * CEs [8] --> Loop 12 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * Partial RF of phase [8,9,10,11]: - RF of loop [8:1]: V__01-4 depends on loops [9:1,10:1] - RF of loop [9:1]: -V__01+5 depends on loops [8:1,11:1] - RF of loop [10:1]: -V__0+7 -V__01+V__0+1 depends on loops [8:1,9:1,11:1] -V__01/2+5/2 depends on loops [8:1,11:1] - RF of loop [11:1]: V__01-1 depends on loops [9:1,10:1] V__01/2-V__0/2 depends on loops [10:1] ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [13,14] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [14] --> Loop 13 * CEs [13] --> Loop 14 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [15,16] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [16] --> Loop 15 * CEs [15] --> Loop 16 ### Ranking functions of CR eval_foo_start(V_i,V_j,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[8,9,10,11]]...: 2*it(8)+1*it(10)+1*it(11)+0 Such that:it(10) =< -V__0+7 with precondition: [V__0+1>=V__01,V__0>=1,B=2] * Chain [12]: 0 with precondition: [B=2,V__0=V__01,0>=V__0]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445