Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746239
details
property
value
status
complete
benchmark
IntPath.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.21883893013 seconds
cpu usage
0.134552328
max memory
8232960.0
stage attributes
key
value
output-size
3105
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/3] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb2_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/4] #### 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/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] * CE 4 is refined into CE [9] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [9] --> Loop 7 * CEs [7] --> Loop 8 * CEs [8] --> Loop 9 ### Ranking functions of CR eval_foo_bb1_in(V__,V__2,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__,V__2,B) ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [10] * CE 3 is refined into CE [11] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [10] --> Loop 10 * CEs [11] --> Loop 11 ### 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/4 * CE 1 is refined into CE [12,13] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [13] --> Loop 12 * CEs [12] --> Loop 13 ### Ranking functions of CR eval_foo_start(V_i,V_x,V_y,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_x,V_y,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__,V__2,B): * Chain [[7]]...: 1*it(7)+0 with precondition: [2*V__=1,2*V__2=1,B=2] * Chain [9]: 0 with precondition: [V__=0,V__2=1,B=2] * Chain [8]: 0 with precondition: [V__=1,V__2=0,B=2] #### Cost of chains of eval_foo_bb0_in(V_i,B): * Chain [11]: 0 with precondition: [10>=V_i] * Chain [10]: 0 with precondition: [V_i>=11] #### Cost of chains of eval_foo_start(V_i,V_x,V_y,B): * Chain [13]: 0 with precondition: [10>=V_i] * Chain [12]: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445