Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737794
details
property
value
status
complete
benchmark
upAndDown_rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n111.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
34.6891689301 seconds
cpu usage
84.689589825
max memory
1.180254208E9
stage attributes
key
value
output-size
4292
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, l3, true> <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> arg2}> <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}> <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}> <l3, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}> Fresh variables: undef16, undef17, undef18, Undef variables: undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = undef17) /\ (undef16 > 0) /\ (undef17 > ~(1))> <l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}> <l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}> <l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}> <l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}> Fresh variables: undef16, undef17, undef18, Undef variables: undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}> <l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}> <l2, l2, arg1 <= 1 /\ arg3 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 0 <= undef17 /\ 1 <= undef16 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = undef17, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.382253 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634