Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738921
details
property
value
status
complete
benchmark
n-37.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
23.8635931015 seconds
cpu usage
44.392280048
max memory
3.07728384E8
stage attributes
key
value
output-size
8905
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l7, true> <l1, l2, (undef2 = (0 + x_5^0)) /\ (undef8 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, __cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}> <l3, l2, (undef10 = (0 + x_5^0)) /\ (undef16 = (0 + undef10)) /\ (undef9 = undef9), par{Result_4^0 -> undef9, __cil_tmp2_6^0 -> undef10, selected_11^0 -> (0 + undef16)}> <l4, l5, (undef19 = (0 + selected_11^0)), par{Result_4^0 -> (0 + undef19), __cil_tmp6_12^0 -> undef19}> <l4, l2, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{Result_4^0 -> undef24, __cil_tmp2_6^0 -> undef25, selected_11^0 -> (0 + undef31)}> <l2, l4, true, par{retryCount_10^0 -> (1 + retryCount_10^0)}> <l6, l4, true, par{maxRetries_9^0 -> 4, retryCount_10^0 -> 0, selected_11^0 -> 0}> <l7, l6, true> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (retryCount_10^0 = 0) /\ (selected_11^0 = 0)> <l4, l5, (undef19 = (0 + selected_11^0))> <l4, l4, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{retryCount_10^0 -> (1 + retryCount_10^0), selected_11^0 -> (0 + undef31)}> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}> Graph 2 <l4, l5, selected_11^0 = undef19, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002357
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634