Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989493
details
property
value
status
complete
benchmark
CookSeeZuleger-TACAS2013-Fig7a_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.297554 seconds
cpu usage
0.224069
user time
0.188997
system time
0.035072
max virtual memory
113176.0
max residence set size
11288.0
stage attributes
key
value
starexec-result
MAYBE
output
0.06/0.19 MAYBE 0.06/0.19 0.06/0.19 Preprocessing Cost Relations 0.06/0.19 ===================================== 0.06/0.19 0.06/0.19 #### Computed strongly connected components 0.06/0.19 0. recursive : [eval_foo_0/4,eval_foo_1/5,eval_foo_3/6,eval_foo_4/7,eval_foo_5/5,eval_foo_6/6,eval_foo_bb1_in/4,eval_foo_bb2_in/4,eval_foo_bb3_in/5,eval_foo_bb4_in/5] 0.06/0.19 1. non_recursive : [eval_foo_stop/1] 0.06/0.19 2. non_recursive : [eval_foo__critedge_in/1] 0.06/0.19 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.06/0.19 4. non_recursive : [eval_foo_bb0_in/4] 0.06/0.19 5. non_recursive : [eval_foo_start/4] 0.06/0.19 0.06/0.19 #### Obtained direct recursion through partial evaluation 0.06/0.19 0. SCC is partially evaluated into eval_foo_bb1_in/4 0.06/0.19 1. SCC is completely evaluated into other SCCs 0.06/0.19 2. SCC is completely evaluated into other SCCs 0.06/0.19 3. SCC is completely evaluated into other SCCs 0.06/0.19 4. SCC is partially evaluated into eval_foo_bb0_in/4 0.06/0.19 5. SCC is partially evaluated into eval_foo_start/4 0.06/0.19 0.06/0.19 Control-Flow Refinement of Cost Relations 0.06/0.19 ===================================== 0.06/0.19 0.06/0.19 ### Specialization of cost equations eval_foo_bb1_in/4 0.06/0.19 * CE 5 is refined into CE [8] 0.06/0.19 * CE 6 is refined into CE [9] 0.06/0.19 * CE 7 is refined into CE [10] 0.06/0.19 * CE 3 is refined into CE [11] 0.06/0.19 * CE 4 is refined into CE [12] 0.06/0.19 0.06/0.19 0.06/0.19 ### Cost equations --> "Loop" of eval_foo_bb1_in/4 0.06/0.19 * CEs [11] --> Loop 8 0.06/0.19 * CEs [12] --> Loop 9 0.06/0.19 * CEs [8] --> Loop 10 0.06/0.19 * CEs [9] --> Loop 11 0.06/0.19 * CEs [10] --> Loop 12 0.06/0.19 0.06/0.19 ### Ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 0.06/0.19 0.06/0.19 #### Partial ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 0.06/0.19 * Partial RF of phase [8,9]: 0.06/0.19 - RF of loop [8:1]: 0.06/0.19 V__0 depends on loops [9:1] 0.06/0.19 - RF of loop [9:1]: 0.06/0.19 V__01 0.06/0.19 V__03 depends on loops [8:1] 0.06/0.19 0.06/0.19 0.06/0.19 ### Specialization of cost equations eval_foo_bb0_in/4 0.06/0.19 * CE 2 is refined into CE [13,14,15,16] 0.06/0.19 0.06/0.19 0.06/0.19 ### Cost equations --> "Loop" of eval_foo_bb0_in/4 0.06/0.19 * CEs [16] --> Loop 13 0.06/0.19 * CEs [13] --> Loop 14 0.06/0.19 * CEs [14] --> Loop 15 0.06/0.19 * CEs [15] --> Loop 16 0.06/0.19 0.06/0.19 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_d,B) 0.06/0.19 0.06/0.19 #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_d,B) 0.06/0.19 0.06/0.19 0.06/0.19 ### Specialization of cost equations eval_foo_start/4 0.06/0.19 * CE 1 is refined into CE [17,18,19,20] 0.06/0.19 0.06/0.19 0.06/0.19 ### Cost equations --> "Loop" of eval_foo_start/4 0.06/0.19 * CEs [20] --> Loop 17 0.06/0.19 * CEs [19] --> Loop 18 0.06/0.19 * CEs [18] --> Loop 19 0.06/0.19 * CEs [17] --> Loop 20 0.06/0.19 0.06/0.19 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_d,B) 0.06/0.19 0.06/0.19 #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_d,B) 0.06/0.19 0.06/0.19 0.06/0.19 Computing Bounds 0.06/0.19 ===================================== 0.06/0.19 0.06/0.19 #### Cost of chains of eval_foo_bb1_in(V__03,V__01,V__0,B): 0.06/0.19 * Chain [[8,9],12]: 1*it(8)+1*it(9)+0 0.06/0.19 Such that:it(9) =< V__01 0.06/0.19 0.06/0.19 with precondition: [B=2,V__03>=1,V__01>=1,V__0>=1] 0.06/0.19 0.06/0.19 * Chain [[8,9],11]: 1*it(8)+1*it(9)+0 0.06/0.19 Such that:it(9) =< V__01 0.06/0.19 0.06/0.19 with precondition: [B=2,V__03>=1,V__01>=1,V__0>=1] 0.06/0.19 0.06/0.19 * Chain [[8,9],10]: 1*it(8)+1*it(9)+0 0.06/0.19 Such that:it(9) =< V__01 0.06/0.19 0.06/0.19 with precondition: [B=2,V__03>=1,V__01>=1,V__0>=1] 0.06/0.19 0.06/0.19 * Chain [12]: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38