Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer Transition Systems pair #487525223
details
property
value
status
complete
benchmark
test_byron_2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.062294960022 seconds
cpu usage
0.059086053
max memory
1970176.0
stage attributes
key
value
output-size
6666
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Initial ITS Start location: l5 0: l0 -> l1 : n^0'=n^post0, x^0'=x^post0, (x^0-x^post0 == 0 /\ n^0-n^post0 == 0), cost: 1 1: l1 -> l0 : n^0'=n^post1, x^0'=x^post1, (-x^post1+x^0 == 0 /\ n^0-n^post1 == 0), cost: 1 2: l2 -> l0 : n^0'=n^post2, x^0'=x^post2, (n^0 <= 0 /\ n^0-n^post2 == 0 /\ x^10 == 0 /\ -1+x^post2 == 0), cost: 1 3: l2 -> l3 : n^0'=n^post3, x^0'=x^post3, (1-n^0 <= 0 /\ n^0-n^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1 4: l3 -> l2 : n^0'=n^post4, x^0'=x^post4, (n^0-n^post4 == 0 /\ -x^post4+x^0 == 0), cost: 1 5: l4 -> l2 : n^0'=n^post5, x^0'=x^post5, (0 == 0 /\ -1+x^post5 == 0), cost: 1 6: l5 -> l4 : n^0'=n^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ n^0-n^post6 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : n^0'=n^post0, x^0'=x^post0, (x^0-x^post0 == 0 /\ n^0-n^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : n^0'=n^post1, x^0'=x^post1, (-x^post1+x^0 == 0 /\ n^0-n^post1 == 0), cost: 1 New rule: l1 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : n^0'=n^post2, x^0'=x^post2, (n^0 <= 0 /\ n^0-n^post2 == 0 /\ x^10 == 0 /\ -1+x^post2 == 0), cost: 1 New rule: l2 -> l0 : x^0'=1, n^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : n^0'=n^post3, x^0'=x^post3, (1-n^0 <= 0 /\ n^0-n^post3 == 0 /\ -x^post3+x^0 == 0), cost: 1 New rule: l2 -> l3 : -1+n^0 >= 0, cost: 1 Applied preprocessing Original rule: l3 -> l2 : n^0'=n^post4, x^0'=x^post4, (n^0-n^post4 == 0 /\ -x^post4+x^0 == 0), cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l2 : n^0'=n^post5, x^0'=x^post5, (0 == 0 /\ -1+x^post5 == 0), cost: 1 New rule: l4 -> l2 : n^0'=n^post5, x^0'=1, 0 == 0, cost: 1 Applied preprocessing Original rule: l5 -> l4 : n^0'=n^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ n^0-n^post6 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : TRUE, cost: 1 8: l1 -> l0 : TRUE, cost: 1 9: l2 -> l0 : x^0'=1, n^0 <= 0, cost: 1 10: l2 -> l3 : -1+n^0 >= 0, cost: 1 11: l3 -> l2 : TRUE, cost: 1 12: l4 -> l2 : n^0'=n^post5, x^0'=1, 0 == 0, cost: 1 13: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l2 : n^0'=n^post5, x^0'=1, 0 == 0, cost: 1 New rule: l5 -> l2 : n^0'=n^post5, x^0'=1, 0 == 0, cost: 2 Applied deletion Removed the following rules: 12 13 Eliminating location l3 by chaining: Applied chaining First rule: l2 -> l3 : -1+n^0 >= 0, cost: 1 Second rule: l3 -> l2 : TRUE, cost: 1 New rule: l2 -> l2 : -1+n^0 >= 0, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l1 by chaining:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer Transition Systems