Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746297
details
property
value
status
complete
benchmark
Lobnya-Boolean-Reordered_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.300165891647 seconds
cpu usage
0.212158219
max memory
8810496.0
stage attributes
key
value
output-size
4809
starexec-result
WORST_CASE(?,O(n^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(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_0/3,eval_foo_1/3,eval_foo_bb1_in/3,eval_foo_bb2_in/3] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb3_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/3] 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/3 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 5 is refined into CE [9] * CE 6 is refined into CE [10] * CE 3 is refined into CE [11] * CE 4 is refined into CE [12] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [9] --> Loop 8 * CEs [10] --> Loop 9 * CEs [11] --> Loop 10 * CEs [12] --> Loop 11 * CEs [8] --> Loop 12 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * RF of phase [8]: [V__0] #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) * Partial RF of phase [8]: - RF of loop [8:1]: V__0 ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [13,14,15,16,17,18] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [18] --> Loop 13 * CEs [16] --> Loop 14 * CEs [17] --> Loop 15 * CEs [15] --> Loop 16 * CEs [13] --> Loop 17 * CEs [14] --> Loop 18 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_b,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_b,B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [19,20,21,22,23,24] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [24] --> Loop 19 * CEs [23] --> Loop 20 * CEs [22] --> Loop 21 * CEs [21] --> Loop 22 * CEs [20] --> Loop 23 * CEs [19] --> Loop 24 ### Ranking functions of CR eval_foo_start(V_x,V_b,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_b,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[8],10,12]: 1*it(8)+1 Such that:it(8) =< V__0 with precondition: [B=2,V__01>=1,V__0>=1] * Chain [12]: 0 with precondition: [V__01=0,B=2]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445