Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098750
details
property
value
status
complete
benchmark
6.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.026756 seconds
cpu usage
0.027359
user time
0.015866
system time
0.011493
max virtual memory
113188.0
max residence set size
7196.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l5 0: l0 -> l1 : pc_Loop^0'=pc_Loop^post0, -2+pc_Loop^post0 == 0, cost: 1 1: l1 -> l0 : pc_Loop^0'=pc_Loop^post1, pc_Loop^0-pc_Loop^post1 == 0, cost: 1 2: l2 -> l3 : pc_Loop^0'=pc_Loop^post2, (-3+pc_Loop^10 == 0 /\ -2+pc_Loop^post2 == 0), cost: 1 3: l3 -> l2 : pc_Loop^0'=pc_Loop^post3, pc_Loop^0-pc_Loop^post3 == 0, cost: 1 4: l4 -> l2 : pc_Loop^0'=pc_Loop^post4, -2+pc_Loop^post4 == 0, cost: 1 5: l5 -> l4 : pc_Loop^0'=pc_Loop^post5, pc_Loop^0-pc_Loop^post5 == 0, cost: 1 Removed unreachable rules and leafs Start location: l5 2: l2 -> l3 : pc_Loop^0'=pc_Loop^post2, (-3+pc_Loop^10 == 0 /\ -2+pc_Loop^post2 == 0), cost: 1 3: l3 -> l2 : pc_Loop^0'=pc_Loop^post3, pc_Loop^0-pc_Loop^post3 == 0, cost: 1 4: l4 -> l2 : pc_Loop^0'=pc_Loop^post4, -2+pc_Loop^post4 == 0, cost: 1 5: l5 -> l4 : pc_Loop^0'=pc_Loop^post5, pc_Loop^0-pc_Loop^post5 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l3 : pc_Loop^0'=pc_Loop^post2, (-3+pc_Loop^10 == 0 /\ -2+pc_Loop^post2 == 0), cost: 1 New rule: l2 -> l3 : pc_Loop^0'=2, TRUE, cost: 1 Applied preprocessing Original rule: l3 -> l2 : pc_Loop^0'=pc_Loop^post3, pc_Loop^0-pc_Loop^post3 == 0, cost: 1 New rule: l3 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l2 : pc_Loop^0'=pc_Loop^post4, -2+pc_Loop^post4 == 0, cost: 1 New rule: l4 -> l2 : pc_Loop^0'=2, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l4 : pc_Loop^0'=pc_Loop^post5, pc_Loop^0-pc_Loop^post5 == 0, cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 6: l2 -> l3 : pc_Loop^0'=2, TRUE, cost: 1 7: l3 -> l2 : TRUE, cost: 1 8: l4 -> l2 : pc_Loop^0'=2, TRUE, cost: 1 9: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l2 : pc_Loop^0'=2, TRUE, cost: 1 New rule: l5 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 Applied deletion Removed the following rules: 8 9 Eliminating location l3 by chaining: Applied chaining First rule: l2 -> l3 : pc_Loop^0'=2, TRUE, cost: 1 Second rule: l3 -> l2 : TRUE, cost: 1 New rule: l2 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 Applied deletion Removed the following rules: 6 7 Eliminated locations on linear paths Start location: l5 11: l2 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 10: l5 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 Applied nonterm Original rule: l2 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 New rule: l2 -> [6] : TRUE, cost: NONTERM Applied acceleration Original rule: l2 -> l2 : pc_Loop^0'=2, TRUE, cost: 2 New rule: l2 -> l2 : pc_Loop^0'=2, TRUE, cost: 2*n0 Applied deletion Removed the following rules: 11 Accelerated simple loops
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS