Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736635
details
property
value
status
complete
benchmark
ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0641601085663 seconds
cpu usage
0.059900744
max memory
1.3266944E7
stage attributes
key
value
output-size
7963
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_N -> 10, main_x -> 0, main_y -> 0, main_i -> 0}> <l1, l2, true> <l2, l23, not((main_i < main_N))> <l2, l3, (main_i < main_N)> <l3, l4, true, seq{main_i -> (main_i + 1), main_r -> ¿functionCall(__VERIFIER_nondet_int)}> <l4, l22, not((main_r >= 0))> <l4, l5, (main_r >= 0)> <l5, l6, (main_r <= 3)> <l5, l22, not((main_r <= 3))> <l6, l7, (main_r = 0)> <l6, l9, not((main_r = 0))> <l7, l8, true, seq{main_x -> (main_x + 1)}> <l8, l21, true> <l9, l10, (main_r = 1)> <l9, l12, not((main_r = 1))> <l10, l11, true, seq{main_x -> (main_x - 1)}> <l11, l20, true> <l12, l13, (main_r = 2)> <l12, l15, not((main_r = 2))> <l13, l14, true, seq{main_y -> (main_y + 1)}> <l14, l19, true> <l15, l16, (main_r = 3)> <l15, l18, not((main_r = 3))> <l16, l17, true, seq{main_y -> (main_y - 1)}> <l17, l18, true> <l18, l19, true> <l19, l20, true> <l20, l21, true> <l21, l22, true> <l22, l2, true> <l23, l24, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_N -> 10, main_x -> 0, main_y -> 0, main_i -> 0}> <l1, l2, true> <l2, l3, (main_i < main_N)> <l2, l23, not((main_i < main_N))> <l3, l25, true, seq{main_i -> (main_i + 1)}> <l25, l26, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l26, l4, true, seq{main_r -> varCall_1}> <l4, l5, (main_r >= 0)> <l4, l22, not((main_r >= 0))> <l5, l6, (main_r <= 3)> <l5, l22, not((main_r <= 3))> <l6, l7, (main_r = 0)> <l6, l9, not((main_r = 0))> <l7, l8, true, seq{main_x -> (main_x + 1)}> <l8, l21, true> <l9, l10, (main_r = 1)> <l9, l12, not((main_r = 1))> <l10, l11, true, seq{main_x -> (main_x - 1)}> <l11, l20, true> <l12, l13, (main_r = 2)> <l12, l15, not((main_r = 2))> <l13, l14, true, seq{main_y -> (main_y + 1)}> <l14, l19, true> <l15, l16, (main_r = 3)> <l15, l18, not((main_r = 3))> <l16, l17, true, seq{main_y -> (main_y - 1)}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257