Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099446
details
property
value
status
complete
benchmark
GCD2.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
6.19233 seconds
cpu usage
6.16818
user time
6.12539
system time
0.04279
max virtual memory
278520.0
max residence set size
28680.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f152_0_gcd_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1P1, arg2'=arg2P1, (-arg2P1+arg2 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 > 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg2P2+arg2 == 0 /\ arg1-arg1P2 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 < 0 /\ arg2 > 0), cost: 1 4: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ arg1-arg1P4 == 0 /\ arg1-arg2 == 0 /\ -arg2P4 == 0), cost: 1 3: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ arg1-arg1P3-arg2 == 0 /\ -arg1+arg2 < 0 /\ arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 5: f198_0_mod_LE -> f152_0_gcd_EQ : arg1'=arg1P5, arg2'=arg2P5, (arg1-arg2P5 == 0 /\ -arg1P5+arg2 == 0 /\ arg1-arg2 < 0), cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied preprocessing Original rule: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1P1, arg2'=arg2P1, (-arg2P1+arg2 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 > 0 /\ arg2 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f152_0_gcd_EQ -> f198_0_mod_LE : (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg2P2+arg2 == 0 /\ arg1-arg1P2 == 0 /\ 1+arg1 > 0 /\ -arg1+arg2 < 0 /\ arg2 > 0), cost: 1 New rule: f152_0_gcd_EQ -> f198_0_mod_LE : (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Applied preprocessing Original rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ arg1-arg1P3-arg2 == 0 /\ -arg1+arg2 < 0 /\ arg2 > 0 /\ arg2-arg2P3 == 0), cost: 1 New rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Applied preprocessing Original rule: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg1'=arg1P4, arg2'=arg2P4, (arg1 > 0 /\ arg1-arg1P4 == 0 /\ arg1-arg2 == 0 /\ -arg2P4 == 0), cost: 1 New rule: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg2'=0, (arg1 > 0 /\ arg1-arg2 == 0), cost: 1 Applied preprocessing Original rule: f198_0_mod_LE -> f152_0_gcd_EQ : arg1'=arg1P5, arg2'=arg2P5, (arg1-arg2P5 == 0 /\ -arg1P5+arg2 == 0 /\ arg1-arg2 < 0), cost: 1 New rule: f198_0_mod_LE -> f152_0_gcd_EQ : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f152_0_gcd_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 7: f152_0_gcd_EQ -> f198_0_mod_LE : (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 8: f152_0_gcd_EQ -> f198_0_mod_LE : (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 10: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg2'=0, (arg1 > 0 /\ arg1-arg2 == 0), cost: 1 9: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 11: f198_0_mod_LE -> f152_0_gcd_EQ : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied acceleration Original rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-arg2, (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 New rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: n2 Applied deletion Removed the following rules: 9 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f152_0_gcd_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 7: f152_0_gcd_EQ -> f198_0_mod_LE : (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 8: f152_0_gcd_EQ -> f198_0_mod_LE : (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 10: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg2'=0, (arg1 > 0 /\ arg1-arg2 == 0), cost: 1 11: f198_0_mod_LE -> f152_0_gcd_EQ : arg1'=arg2, arg2'=arg1, -arg1+arg2 > 0, cost: 1 12: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: n2 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied chaining First rule: f1_0_main_Load -> f152_0_gcd_EQ : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f152_0_gcd_EQ -> f152_0_gcd_EQ : arg2'=0, (arg1 > 0 /\ arg1-arg2 == 0), cost: 1 New rule: f1_0_main_Load -> f152_0_gcd_EQ : arg1'=arg2P0, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0 /\ arg2P0 > 0), cost: 2 Applied deletion Removed the following rules: 10 Applied chaining First rule: f152_0_gcd_EQ -> f198_0_mod_LE : (1+arg1 > 0 /\ -arg1+arg2 > 0), cost: 1 Second rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: n2 New rule: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ -arg1+arg2 > 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: 1+n2 Applied chaining First rule: f152_0_gcd_EQ -> f198_0_mod_LE : (arg2 > 0 /\ arg1-arg2 > 0), cost: 1 Second rule: f198_0_mod_LE -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: n2 New rule: f152_0_gcd_EQ -> f198_0_mod_LE : arg1'=arg1-n2*arg2, (n2 >= 0 /\ arg2 > 0 /\ arg1-arg2 > 0 /\ arg1-arg2-(-1+n2)*arg2 > 0), cost: 1+n2
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS