Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381740075
details
property
value
status
complete
benchmark
java_Ackermann.c.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0804350376129 seconds
cpu usage
0.076570984
max memory
8716288.0
stage attributes
key
value
output-size
13815
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l9, true> <l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> <l1, l3, (undef7 = (0 + x0^0)) /\ (undef9 = undef9), par{oldX0^0 -> undef7, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef9, x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}> <l1, l3, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}> <l4, l2, (undef21 = undef21) /\ (undef22 = undef22), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> <l4, l3, (undef25 = (0 + x0^0)), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), x0^0 -> (~(1) + undef25), x1^0 -> 1}> <l5, l1, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)), par{oldX0^0 -> undef31, oldX1^0 -> undef32, x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}> <l5, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0), par{oldX0^0 -> undef37, oldX1^0 -> undef38, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38)}> <l6, l2, (undef45 = undef45) /\ (undef46 = undef46), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, oldX3^0 -> undef46, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> <l7, l5, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)), par{oldX0^0 -> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}> <l7, l6, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((0 + undef55) <= 0), par{oldX0^0 -> undef55, oldX1^0 -> undef56, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56)}> <l3, l7, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)), par{oldX0^0 -> undef61, oldX1^0 -> undef62, x0^0 -> (0 + undef61), x1^0 -> (0 + undef62)}> <l8, l1, true> <l8, l4, true> <l8, l2, true> <l8, l5, true> <l8, l6, true> <l8, l7, true> <l8, l3, true> <l9, l8, true> Fresh variables: undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, Undef variables: undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> <l0, l3, (undef7 = (0 + x0^0)) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}> <l0, l3, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}> <l0, l2, (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> <l0, l3, (undef25 = (0 + x0^0)), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}> <l0, l2, true> <l0, l2, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> <l0, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}> <l0, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}> <l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> <l0, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}> <l0, l2, (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> <l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> <l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}> <l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}> <l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> <l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}> <l0, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((0 + undef55) <= 0) /\ (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> <l0, l3, true> <l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}> <l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}> <l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}> <l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}> <l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}> <l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef55 = (0 + (0 + undef61))) /\ (undef56 = (0 + (0 + undef62))) /\ ((0 + undef55) <= 0) /\ (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}> Fresh variables: undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, Undef variables: undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634