Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099536
details
property
value
status
complete
benchmark
CAppE.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0864559 seconds
cpu usage
0.087764
user time
0.070533
system time
0.017231
max virtual memory
113188.0
max residence set size
18788.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(0),?)
output
WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f171_0_createList_Return -> f231_0_random_ArrayAccess : arg1'=arg1P0, arg2'=arg2P0, arg1 > 0, cost: 1 4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1 > 0 /\ arg1P4 > 0), cost: 1 1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1+arg2 == 0), cost: 1 2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1P2 > 0), cost: 1 3: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0), cost: 1 5: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Removed unreachable rules and leafs Start location: __init 4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1 > 0 /\ arg1P4 > 0), cost: 1 1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1+arg2 == 0), cost: 1 2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1P2 > 0), cost: 1 3: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0), cost: 1 5: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg1P1, arg2'=arg2P1, (arg1 > 0 /\ -arg1P1+arg2 == 0), cost: 1 New rule: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P1, arg1 > 0, cost: 1 Applied preprocessing Original rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1P3, arg2'=arg2P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0), cost: 1 New rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 Applied preprocessing Original rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1P5, arg2'=arg2P5, (arg1 > 0 /\ -1+arg1-arg1P5 == 0), cost: 1 New rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 Simplified rules Start location: __init 4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1 > 0 /\ arg1P4 > 0), cost: 1 2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1P2 > 0), cost: 1 7: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P1, arg1 > 0, cost: 1 8: f197_0_createList_LE -> f197_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 9: f352_0_appE_GT -> f352_0_appE_GT : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 6: __init -> f1_0_main_Load : arg1'=arg1P6, arg2'=arg2P6, TRUE, cost: 1 Applied acceleration Original rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P3, arg1 > 0, cost: 1 New rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1-n0, arg2'=arg2P3, (-1+n0 >= 0 /\ 1+arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1-n0, arg2'=arg2P3, (-1+n0 >= 0 /\ 1+arg1-n0 > 0), cost: n0 New rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=0, arg2'=arg2P3, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 Applied simplification Original rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=0, arg2'=arg2P3, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 New rule: f197_0_createList_LE -> f197_0_createList_LE : arg1'=0, arg2'=arg2P3, -1+arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 8 Applied acceleration Original rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=-1+arg1, arg2'=arg2P5, arg1 > 0, cost: 1 New rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1-n3, arg2'=arg2P5, (1+arg1-n3 > 0 /\ -1+n3 >= 0), cost: n3 Applied instantiation Original rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1-n3, arg2'=arg2P5, (1+arg1-n3 > 0 /\ -1+n3 >= 0), cost: n3 New rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=0, arg2'=arg2P5, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 Applied simplification Original rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=0, arg2'=arg2P5, (1 > 0 /\ -1+arg1 >= 0), cost: arg1 New rule: f352_0_appE_GT -> f352_0_appE_GT : arg1'=0, arg2'=arg2P5, -1+arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 9 Accelerated simple loops Start location: __init 4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P4, arg2'=arg2P4, (-1+arg1 > 0 /\ arg1P4 > 0), cost: 1 2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P2, arg2'=arg2P2, (arg1 > 0 /\ 1+arg2 > 0 /\ 1+arg1P2 > 0), cost: 1 7: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P1, arg1 > 0, cost: 1 11: f197_0_createList_LE -> f197_0_createList_LE : arg1'=0, arg2'=arg2P3, -1+arg1 >= 0, cost: arg1 13: f352_0_appE_GT -> f352_0_appE_GT : arg1'=0, arg2'=arg2P5, -1+arg1 >= 0, cost: arg1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS