Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099845
details
property
value
status
complete
benchmark
Velroyen08-whileBreak.jar-obl-8.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_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
1.31478 seconds
cpu usage
1.31223
user time
1.24697
system time
0.065265
max virtual memory
278168.0
max residence set size
51512.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f1_0_main_Load -> f53_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f53_0_loop_LE -> f74_0_loop_NE : arg1'=arg1P1, arg2'=arg2P1, (-1+arg1-arg1P1 == 0 /\ -10+arg1 > 0 /\ -21+arg1 < 0), cost: 1 2: f53_0_loop_LE -> f74_0_loop_NE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1-arg1P2 == 0 /\ -20+arg1 > 0), cost: 1 3: f74_0_loop_NE -> f53_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1-arg1P3 == 0 /\ -30+arg1 < 0), cost: 1 4: f74_0_loop_NE -> f53_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1-arg1P4 == 0 /\ -30+arg1 > 0), cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f53_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f53_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=arg1P1, arg2'=arg2P1, (-1+arg1-arg1P1 == 0 /\ -10+arg1 > 0 /\ -21+arg1 < 0), cost: 1 New rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 21-arg1 > 0), cost: 1 Applied preprocessing Original rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=arg1P2, arg2'=arg2P2, (1+arg1-arg1P2 == 0 /\ -20+arg1 > 0), cost: 1 New rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=1+arg1, arg2'=arg2P2, -20+arg1 > 0, cost: 1 Applied preprocessing Original rule: f74_0_loop_NE -> f53_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1-arg1P3 == 0 /\ -30+arg1 < 0), cost: 1 New rule: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P3, 30-arg1 > 0, cost: 1 Applied preprocessing Original rule: f74_0_loop_NE -> f53_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (arg1-arg1P4 == 0 /\ -30+arg1 > 0), cost: 1 New rule: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P4, -30+arg1 > 0, cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f53_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f53_0_loop_LE -> f74_0_loop_NE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 21-arg1 > 0), cost: 1 8: f53_0_loop_LE -> f74_0_loop_NE : arg1'=1+arg1, arg2'=arg2P2, -20+arg1 > 0, cost: 1 9: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P3, 30-arg1 > 0, cost: 1 10: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P4, -30+arg1 > 0, cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Second rule: f1_0_main_Load -> f53_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 New rule: __init -> f53_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2 Applied deletion Removed the following rules: 5 6 Eliminated locations on linear paths Start location: __init 7: f53_0_loop_LE -> f74_0_loop_NE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 21-arg1 > 0), cost: 1 8: f53_0_loop_LE -> f74_0_loop_NE : arg1'=1+arg1, arg2'=arg2P2, -20+arg1 > 0, cost: 1 9: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P3, 30-arg1 > 0, cost: 1 10: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P4, -30+arg1 > 0, cost: 1 11: __init -> f53_0_loop_LE : arg1'=arg2P5, arg2'=arg2P0, (1+arg2P5 > 0 /\ arg1P5 > 0), cost: 2 Eliminating location f74_0_loop_NE by chaining: Applied chaining First rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 21-arg1 > 0), cost: 1 Second rule: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P3, 30-arg1 > 0, cost: 1 New rule: f53_0_loop_LE -> f53_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, (-10+arg1 > 0 /\ 31-arg1 > 0 /\ 21-arg1 > 0), cost: 2 Applied simplification Original rule: f53_0_loop_LE -> f53_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, (-10+arg1 > 0 /\ 31-arg1 > 0 /\ 21-arg1 > 0), cost: 2 New rule: f53_0_loop_LE -> f53_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P3, (-10+arg1 > 0 /\ 21-arg1 > 0), cost: 2 Applied chaining First rule: f53_0_loop_LE -> f74_0_loop_NE : arg1'=1+arg1, arg2'=arg2P2, -20+arg1 > 0, cost: 1 Second rule: f74_0_loop_NE -> f53_0_loop_LE : arg2'=arg2P3, 30-arg1 > 0, cost: 1 New rule: f53_0_loop_LE -> f53_0_loop_LE : arg1'=1+arg1, arg2'=arg2P3, (29-arg1 > 0 /\ -20+arg1 > 0), cost: 2 Applied chaining First rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS