Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736545
details
property
value
status
complete
benchmark
Toulouse-MultiBranchesToLoop_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n100.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.123413801193 seconds
cpu usage
0.235529289
max memory
5.00736E7
stage attributes
key
value
output-size
13160
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_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l2, not((¿functionCall(__VERIFIER_nondet_int) = 0))> <l1, l4, (¿functionCall(__VERIFIER_nondet_int) = 0)> <l2, l3, true, seq{main_x -> 1}> <l3, l6, true> <l4, l5, true, seq{main_x -> ~(1)}> <l5, l6, true> <l6, l7, (main_x > 0)> <l6, l9, not((main_x > 0))> <l7, l8, true, seq{main_x -> (main_x + 1)}> <l8, l11, true> <l9, l10, true, seq{main_x -> (main_x - 1)}> <l10, l11, true> <l11, l12, (main_x > 0)> <l11, l14, not((main_x > 0))> <l12, l13, true, seq{main_x -> (main_x + 1)}> <l13, l16, true> <l14, l15, true, seq{main_x -> (main_x - 1)}> <l15, l16, true> <l16, l17, (main_x > 0)> <l16, l19, not((main_x > 0))> <l17, l18, true, seq{main_x -> (main_x + 1)}> <l18, l21, true> <l19, l20, true, seq{main_x -> (main_x - 1)}> <l20, l21, true> <l21, l22, (main_x > 0)> <l21, l24, not((main_x > 0))> <l22, l23, true, seq{main_x -> (main_x + 1)}> <l23, l26, true> <l24, l25, true, seq{main_x -> (main_x - 1)}> <l25, l26, true> <l26, l27, (main_x > 0)> <l26, l29, not((main_x > 0))> <l27, l28, true, seq{main_x -> (main_x + 1)}> <l28, l31, true> <l29, l30, true, seq{main_x -> (main_x - 1)}> <l30, l31, true> <l31, l32, (main_x > 0)> <l31, l34, not((main_x > 0))> <l32, l33, true, seq{main_x -> (main_x + 1)}> <l33, l36, true> <l34, l35, true, seq{main_x -> (main_x - 1)}> <l35, l36, true> <l36, l37, (main_x > 0)> <l36, l39, not((main_x > 0))> <l37, l38, true, seq{main_x -> (main_x + 1)}> <l38, l41, true> <l39, l40, true, seq{main_x -> (main_x - 1)}> <l40, l41, true> <l41, l42, (main_x > 0)> <l41, l44, not((main_x > 0))> <l42, l43, true, seq{main_x -> (main_x + 1)}> <l43, l46, true> <l44, l45, true, seq{main_x -> (main_x - 1)}> <l45, l46, true> <l46, l47, true> <l47, l51, not((main_y < 100))> <l47, l48, (main_y < 100)> <l48, l51, not((main_z < 100))> <l48, l49, (main_z < 100)> <l49, l50, true, seq{main_y -> (main_y + main_x), main_z -> (main_z - main_x)}> <l50, l47, true> <l51, l52, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257