Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736575
details
property
value
status
complete
benchmark
DivWithoutMinus.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n006.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
31.6205451488 seconds
cpu usage
66.192551647
max memory
6.61819392E8
stage attributes
key
value
output-size
23925
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' while (z > 0 && (y == 0 || y > 0 && x > 0)) { ~~ ~~~~~~^~~~~~~~ /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning while (z > 0 && (y == 0 || y > 0 && x > 0)) { ^ ( ) 1 warning generated. /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' while (z > 0 && (y == 0 || y > 0 && x > 0)) { ~~ ~~~~~~^~~~~~~~ /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning while (z > 0 && (y == 0 || y > 0 && x > 0)) { ^ ( ) 2 warnings generated. ******************************************************************************************* *********************** 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> main_y, main_res -> 0}> <l1, l2, true> <l2, l12, not((main_z > 0))> <l2, l3, (main_z > 0)> <l3, l4, not((main_y = 0))> <l3, l6, (main_y = 0)> <l4, l12, not((main_y > 0))> <l4, l5, (main_y > 0)> <l5, l12, not((main_x > 0))> <l5, l6, (main_x > 0)> <l6, l7, (main_y = 0)> <l6, l9, not((main_y = 0))> <l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}> <l8, l11, true> <l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}> <l10, l11, true> <l11, l2, true> <l12, l13, 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, l14, true, seq{main__func_return_ -> 0}> <l14, l15, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l15, l16, true, seq{main_x -> varCall_1}> <l16, l17, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l17, l1, true, seq{main_y -> varCall_2, main_z -> main_y, main_res -> 0}> <l1, l2, true> <l2, l3, (main_z > 0)> <l2, l12, not((main_z > 0))> <l3, l6, (main_y = 0)> <l3, l4, not((main_y = 0))> <l4, l5, (main_y > 0)> <l4, l12, not((main_y > 0))> <l5, l6, (main_x > 0)> <l5, l12, not((main_x > 0))> <l6, l7, (main_y = 0)> <l6, l9, not((main_y = 0))> <l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}> <l8, l11, true> <l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}> <l10, l11, true> <l11, l2, true> <l12, l13, true, seq{main__func_return_ -> 0}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257