Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099728
details
property
value
status
complete
benchmark
Velroyen08-sunset.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.266242 seconds
cpu usage
0.27123
user time
0.232487
system time
0.038743
max virtual memory
113188.0
max residence set size
19160.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: __init 0: f1_0_main_Load -> f66_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 1: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-31+arg1 < 0 /\ -1+arg1-arg1P1 == 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1 2: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-31+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -25+arg1 > 0), cost: 1 3: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (25-arg1 == 0 /\ 29-arg1P3 == 0), cost: 1 4: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (20-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 -> f66_0_loop_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1P0+arg2 == 0 /\ 1+arg2 > 0), cost: 1 New rule: f1_0_main_Load -> f66_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P1, arg2'=arg2P1, (-31+arg1 < 0 /\ -1+arg1-arg1P1 == 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 25-arg1 > 0), cost: 1 Applied preprocessing Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P2, arg2'=arg2P2, (-31+arg1 < 0 /\ -1+arg1-arg1P2 == 0 /\ -25+arg1 > 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (31-arg1 > 0 /\ -25+arg1 > 0), cost: 1 Applied preprocessing Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P3, arg2'=arg2P3, (25-arg1 == 0 /\ 29-arg1P3 == 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2P3, -25+arg1 == 0, cost: 1 Applied preprocessing Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1P4, arg2'=arg2P4, (20-arg1P4 == 0 /\ -30+arg1 > 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2P4, -30+arg1 > 0, cost: 1 Simplified rules Start location: __init 6: f1_0_main_Load -> f66_0_loop_LE : arg1'=arg2, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 7: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 25-arg1 > 0), cost: 1 8: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (31-arg1 > 0 /\ -25+arg1 > 0), cost: 1 9: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2P3, -25+arg1 == 0, cost: 1 10: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2P4, -30+arg1 > 0, cost: 1 5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1 Applied acceleration Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P1, (-10+arg1 > 0 /\ 25-arg1 > 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n3, arg2'=arg2P1, (25-arg1 > 0 /\ -1+n3 >= 0 /\ -9+arg1-n3 > 0), cost: n3 Applied instantiation Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n3, arg2'=arg2P1, (25-arg1 > 0 /\ -1+n3 >= 0 /\ -9+arg1-n3 > 0), cost: n3 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=10, arg2'=arg2P1, (1 > 0 /\ 25-arg1 > 0 /\ -11+arg1 >= 0), cost: -10+arg1 Applied acceleration Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2P2, (31-arg1 > 0 /\ -25+arg1 > 0), cost: 1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n5, arg2'=arg2P2, (31-arg1 > 0 /\ -24+arg1-n5 > 0 /\ -1+n5 >= 0), cost: n5 Applied instantiation Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n5, arg2'=arg2P2, (31-arg1 > 0 /\ -24+arg1-n5 > 0 /\ -1+n5 >= 0), cost: n5 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, (1 > 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0), cost: -25+arg1 Applied chaining First rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2P3, -25+arg1 == 0, cost: 1 Second rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, (1 > 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0), cost: -25+arg1 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, -25+arg1 == 0, cost: 5 Applied nonterm Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, -25+arg1 == 0, cost: 5 New rule: f66_0_loop_LE -> [3] : (25-arg1 >= 0 /\ -25+arg1 >= 0), cost: NONTERM Applied acceleration Original rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, -25+arg1 == 0, cost: 5 New rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, (25-arg1 >= 0 /\ -25+arg1 >= 0), cost: 5*n12 Applied chaining First rule: f66_0_loop_LE -> f66_0_loop_LE : arg1'=25, arg2'=arg2P2, (1 > 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0), cost: -25+arg1 Second rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS