Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745584
details
property
value
status
complete
benchmark
Loopus2011_ex2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
Loopus
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
2.50854897499 seconds
cpu usage
2.440632452
max memory
1.2189696E7
stage attributes
key
value
output-size
11445
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_Loopus2011_ex2_0/6,eval_Loopus2011_ex2_1/7,eval_Loopus2011_ex2_bb10_in/8,eval_Loopus2011_ex2_bb11_in/10,eval_Loopus2011_ex2_bb1_in/6,eval_Loopus2011_ex2_bb2_in/7,eval_Loopus2011_ex2_bb3_in/7,eval_Loopus2011_ex2_bb4_in/8,eval_Loopus2011_ex2_bb5_in/8,eval_Loopus2011_ex2_bb6_in/8,eval_Loopus2011_ex2_bb7_in/10,eval_Loopus2011_ex2_bb8_in/8,eval_Loopus2011_ex2_bb9_in/8] 1. non_recursive : [eval_Loopus2011_ex2_stop/1] 2. non_recursive : [eval_Loopus2011_ex2_bb12_in/1] 3. non_recursive : [eval_Loopus2011_ex2_bb1_in_loop_cont/2] 4. non_recursive : [eval_Loopus2011_ex2_bb0_in/3] 5. non_recursive : [eval_Loopus2011_ex2_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_Loopus2011_ex2_bb1_in/6 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_Loopus2011_ex2_bb0_in/3 5. SCC is partially evaluated into eval_Loopus2011_ex2_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_Loopus2011_ex2_bb1_in/6 * CE 34 is refined into CE [56] * CE 8 is refined into CE [57] * CE 30 is discarded (unfeasible) * CE 4 is discarded (unfeasible) * CE 36 is discarded (unfeasible) * CE 10 is discarded (unfeasible) * CE 32 is discarded (unfeasible) * CE 6 is discarded (unfeasible) * CE 55 is refined into CE [58] * CE 12 is discarded (unfeasible) * CE 38 is discarded (unfeasible) * CE 40 is discarded (unfeasible) * CE 14 is discarded (unfeasible) * CE 15 is refined into CE [59] * CE 45 is discarded (unfeasible) * CE 19 is refined into CE [60] * CE 53 is discarded (unfeasible) * CE 27 is discarded (unfeasible) * CE 21 is discarded (unfeasible) * CE 20 is refined into CE [61] * CE 28 is discarded (unfeasible) * CE 46 is refined into CE [62] * CE 54 is discarded (unfeasible) * CE 41 is refined into CE [63] * CE 48 is discarded (unfeasible) * CE 47 is discarded (unfeasible) * CE 22 is discarded (unfeasible) * CE 7 is refined into CE [64] * CE 3 is discarded (unfeasible) * CE 9 is discarded (unfeasible) * CE 5 is discarded (unfeasible) * CE 33 is refined into CE [65] * CE 29 is discarded (unfeasible) * CE 35 is discarded (unfeasible) * CE 31 is discarded (unfeasible) * CE 11 is discarded (unfeasible) * CE 13 is discarded (unfeasible) * CE 37 is discarded (unfeasible) * CE 39 is discarded (unfeasible) * CE 17 is refined into CE [66] * CE 25 is discarded (unfeasible) * CE 18 is refined into CE [67] * CE 26 is discarded (unfeasible) * CE 43 is discarded (unfeasible) * CE 51 is discarded (unfeasible) * CE 44 is refined into CE [68] * CE 52 is discarded (unfeasible) * CE 42 is refined into CE [69] * CE 50 is discarded (unfeasible) * CE 49 is discarded (unfeasible) * CE 16 is refined into CE [70] * CE 24 is discarded (unfeasible) * CE 23 is discarded (unfeasible) ### Cost equations --> "Loop" of eval_Loopus2011_ex2_bb1_in/6 * CEs [64] --> Loop 56 * CEs [65] --> Loop 57 * CEs [68] --> Loop 58 * CEs [66] --> Loop 59 * CEs [69] --> Loop 60 * CEs [70] --> Loop 61 * CEs [67] --> Loop 62 * CEs [57] --> Loop 63 * CEs [56] --> Loop 64 * CEs [58] --> Loop 65 * CEs [62] --> Loop 66 * CEs [59] --> Loop 67 * CEs [63] --> Loop 68
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445