Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736638
details
property
value
status
complete
benchmark
gcd1_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.059100151062 seconds
cpu usage
0.085696392
max memory
1.3713408E7
stage attributes
key
value
output-size
8700
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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l2, (main_x < 0)> <l1, l4, not((main_x < 0))> <l2, l3, true, seq{main_x -> ~(main_x)}> <l3, l4, true> <l4, l5, (main_y < 0)> <l4, l7, not((main_y < 0))> <l5, l6, true, seq{main_y -> ~(main_y)}> <l6, l7, true> <l7, l8, true> <l8, l16, not((main_y > 0))> <l8, l9, (main_y > 0)> <l9, l10, true, seq{main_r -> main_x}> <l10, l11, true> <l11, l14, not((main_r >= main_y))> <l11, l12, (main_r >= main_y)> <l12, l13, true, seq{main_r -> (main_r - main_y)}> <l13, l11, true> <l14, l15, true, seq{main_x -> main_y, main_y -> main_r}> <l15, l8, true> <l16, l17, 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, l18, true, seq{main__func_return_ -> 0}> <l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l19, l20, true, seq{main_x -> varCall_1}> <l20, l21, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l21, l1, true, seq{main_y -> varCall_2}> <l1, l2, (main_x < 0)> <l1, l4, not((main_x < 0))> <l2, l3, true, seq{main_x -> ~(main_x)}> <l3, l4, true> <l4, l5, (main_y < 0)> <l4, l7, not((main_y < 0))> <l5, l6, true, seq{main_y -> ~(main_y)}> <l6, l7, true> <l7, l8, true> <l8, l9, (main_y > 0)> <l8, l16, not((main_y > 0))> <l9, l10, true, seq{main_r -> main_x}> <l10, l11, true> <l11, l12, (main_r >= main_y)> <l11, l14, not((main_r >= main_y))> <l12, l13, true, seq{main_r -> (main_r - main_y)}> <l13, l11, true> <l14, l15, true, seq{main_x -> main_y, main_y -> main_r}> <l15, l8, true> <l16, l17, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 17, Accepting locations:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257