Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487100013
details
property
value
status
complete
benchmark
ex08_rec.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)
0.424001 seconds
cpu usage
0.435733
user time
0.390619
system time
0.045114
max virtual memory
113188.0
max residence set size
19608.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_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 10*arg2-arg3P0 == 0 /\ -arg2P0 == 0 /\ 1+arg2 > 0 /\ -arg1P0 == 0), cost: 1 1: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-1+arg3 > 0 /\ -10+arg3 < 0 /\ arg1-arg1P1 == 0 /\ arg2-arg3P1 == 0 /\ arg3-arg2P1 == 0), cost: 1 2: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-10+arg3 > 0 /\ arg1-arg1P2 == 0 /\ -arg3P2+arg2 == 0 /\ arg3-arg2P2 == 0), cost: 1 4: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1-arg3 == 0 /\ 1-arg2P4 == 0 /\ 1-arg1P4 == 0 /\ -2+arg1 < 0 /\ 2-arg3P4 == 0), cost: 1 5: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-arg2P5 == 0 /\ -arg1P5 == 0 /\ 9-arg3P5 == 0 /\ -2+arg1 < 0 /\ 10-arg3 == 0), cost: 1 3: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3 == 0 /\ -arg1P3 == 0 /\ -1+arg2 > 0 /\ -2+arg1 < 0 /\ -1-arg3P3+arg2 == 0 /\ -arg2P3 == 0), cost: 1 6: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (1-arg3 == 0 /\ 1-arg1P6 == 0 /\ -1+arg2 > 0 /\ 1-arg3P6+arg2 == 0 /\ -2+arg1 < 0 /\ 1-arg2P6 == 0), cost: 1 7: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ 10*arg2-arg3P0 == 0 /\ -arg2P0 == 0 /\ 1+arg2 > 0 /\ -arg1P0 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=0, arg3'=10*arg2, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-1+arg3 > 0 /\ -10+arg3 < 0 /\ arg1-arg1P1 == 0 /\ arg2-arg3P1 == 0 /\ arg3-arg2P1 == 0), cost: 1 New rule: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, (-1+arg3 > 0 /\ 10-arg3 > 0), cost: 1 Applied preprocessing Original rule: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (-10+arg3 > 0 /\ arg1-arg1P2 == 0 /\ -arg3P2+arg2 == 0 /\ arg3-arg2P2 == 0), cost: 1 New rule: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, -10+arg3 > 0, cost: 1 Applied preprocessing Original rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (-arg3 == 0 /\ -arg1P3 == 0 /\ -1+arg2 > 0 /\ -2+arg1 < 0 /\ -1-arg3P3+arg2 == 0 /\ -arg2P3 == 0), cost: 1 New rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=0, arg3'=-1+arg2, arg2'=0, (2-arg1 > 0 /\ arg3 == 0 /\ -1+arg2 > 0), cost: 1 Applied preprocessing Original rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, (1-arg3 == 0 /\ 1-arg2P4 == 0 /\ 1-arg1P4 == 0 /\ -2+arg1 < 0 /\ 2-arg3P4 == 0), cost: 1 New rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=1, arg3'=2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0), cost: 1 Applied preprocessing Original rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=arg1P5, arg3'=arg3P5, arg2'=arg2P5, (-arg2P5 == 0 /\ -arg1P5 == 0 /\ 9-arg3P5 == 0 /\ -2+arg1 < 0 /\ 10-arg3 == 0), cost: 1 New rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=0, arg3'=9, arg2'=0, (2-arg1 > 0 /\ -10+arg3 == 0), cost: 1 Applied preprocessing Original rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=arg1P6, arg3'=arg3P6, arg2'=arg2P6, (1-arg3 == 0 /\ 1-arg1P6 == 0 /\ -1+arg2 > 0 /\ 1-arg3P6+arg2 == 0 /\ -2+arg1 < 0 /\ 1-arg2P6 == 0), cost: 1 New rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=1, arg3'=1+arg2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0 /\ -1+arg2 > 0), cost: 1 Simplified rules Start location: __init 8: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=0, arg3'=10*arg2, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, (-1+arg3 > 0 /\ 10-arg3 > 0), cost: 1 10: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, -10+arg3 > 0, cost: 1 12: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=1, arg3'=2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0), cost: 1 13: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=0, arg3'=9, arg2'=0, (2-arg1 > 0 /\ -10+arg3 == 0), cost: 1 11: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=0, arg3'=-1+arg2, arg2'=0, (2-arg1 > 0 /\ arg3 == 0 /\ -1+arg2 > 0), cost: 1 14: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=1, arg3'=1+arg2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0 /\ -1+arg2 > 0), cost: 1 7: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Accelerated simple loops Start location: __init 8: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=0, arg3'=10*arg2, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 9: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, (-1+arg3 > 0 /\ 10-arg3 > 0), cost: 1 10: f99_0_loop_aux_LE -> f128_0_loop_aux_EQ : arg3'=arg2, arg2'=arg3, -10+arg3 > 0, cost: 1 12: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=1, arg3'=2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0), cost: 1 13: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=0, arg3'=9, arg2'=0, (2-arg1 > 0 /\ -10+arg3 == 0), cost: 1 11: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=0, arg3'=-1+arg2, arg2'=0, (2-arg1 > 0 /\ arg3 == 0 /\ -1+arg2 > 0), cost: 1 14: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=1, arg3'=1+arg2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0 /\ -1+arg2 > 0), cost: 1 7: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P7, arg3'=arg3P7, arg2'=arg2P7, TRUE, cost: 1 Applied chaining First rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=0, arg3'=-1+arg2, arg2'=0, (2-arg1 > 0 /\ arg3 == 0 /\ -1+arg2 > 0), cost: 1 Second rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=1, arg3'=2, arg2'=1, (-1+arg3 == 0 /\ 2-arg1 > 0), cost: 1 New rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=1, arg3'=2, arg2'=1, (2-arg1 > 0 /\ arg3 == 0 /\ -2+arg2 == 0), cost: 2 Applied chaining First rule: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=0, arg3'=10*arg2, arg2'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1 Second rule: f99_0_loop_aux_LE -> f99_0_loop_aux_LE : arg1'=0, arg3'=9, arg2'=0, (2-arg1 > 0 /\ -10+arg3 == 0), cost: 1 New rule: f1_0_main_ConstantStackPush -> f99_0_loop_aux_LE : arg1'=0, arg3'=9, arg2'=0, (arg1 > 0 /\ -1+arg2 == 0), cost: 2 Applied chaining First rule: f128_0_loop_aux_EQ -> f99_0_loop_aux_LE : arg1'=0, arg3'=-1+arg2, arg2'=0, (2-arg1 > 0 /\ arg3 == 0 /\ -1+arg2 > 0), cost: 1 Second rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS