Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487099866
details
property
value
status
complete
benchmark
FactSum.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.0663609 seconds
cpu usage
0.067543
user time
0.044331
system time
0.023212
max virtual memory
113188.0
max residence set size
18692.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 -> f149_0_doSum_LT : arg1'=arg1P0, 10-arg1P0 == 0, cost: 1 1: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=arg1P1, (1+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 2: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=arg1P2, (1+arg1 > 0 /\ -1+arg1-arg1P2 == 0), cost: 1 3: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=arg1P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0 /\ -1 < 0), cost: 1 4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, TRUE, cost: 1 Applied preprocessing Original rule: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=arg1P0, 10-arg1P0 == 0, cost: 1 New rule: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, TRUE, cost: 1 Applied preprocessing Original rule: f149_0_doSum_LT -> f163_0_factorial_GT : arg1'=arg1P1, (1+arg1 > 0 /\ arg1-arg1P1 == 0), cost: 1 New rule: f149_0_doSum_LT -> f163_0_factorial_GT : 1+arg1 > 0, cost: 1 Applied preprocessing Original rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=arg1P2, (1+arg1 > 0 /\ -1+arg1-arg1P2 == 0), cost: 1 New rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 Applied preprocessing Original rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=arg1P3, (arg1 > 0 /\ -1+arg1-arg1P3 == 0 /\ -1 < 0), cost: 1 New rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=-1+arg1, arg1 > 0, cost: 1 Simplified rules Start location: __init 5: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, TRUE, cost: 1 6: f149_0_doSum_LT -> f163_0_factorial_GT : 1+arg1 > 0, cost: 1 7: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 8: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=-1+arg1, arg1 > 0, cost: 1 4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, TRUE, cost: 1 Applied acceleration Original rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1+arg1, 1+arg1 > 0, cost: 1 New rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=arg1-n0, (n0 >= 0 /\ 2+arg1-n0 > 0), cost: n0 Applied instantiation Original rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=arg1-n0, (n0 >= 0 /\ 2+arg1-n0 > 0), cost: n0 New rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, (1 > 0 /\ 1+arg1 >= 0), cost: 1+arg1 Applied simplification Original rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, (1 > 0 /\ 1+arg1 >= 0), cost: 1+arg1 New rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1 Applied deletion Removed the following rules: 7 Applied acceleration Original rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=-1+arg1, arg1 > 0, cost: 1 New rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=arg1-n3, (n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3 Applied instantiation Original rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=arg1-n3, (n3 >= 0 /\ 1+arg1-n3 > 0), cost: n3 New rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=0, (arg1 >= 0 /\ 1 > 0), cost: arg1 Applied simplification Original rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=0, (arg1 >= 0 /\ 1 > 0), cost: arg1 New rule: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=0, arg1 >= 0, cost: arg1 Applied deletion Removed the following rules: 8 Accelerated simple loops Start location: __init 5: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, TRUE, cost: 1 6: f149_0_doSum_LT -> f163_0_factorial_GT : 1+arg1 > 0, cost: 1 10: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1 12: f163_0_factorial_GT -> f163_0_factorial_GT : arg1'=0, arg1 >= 0, cost: arg1 4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, TRUE, cost: 1 Applied chaining First rule: f1_0_main_ConstantStackPush -> f149_0_doSum_LT : arg1'=10, TRUE, cost: 1 Second rule: f149_0_doSum_LT -> f149_0_doSum_LT : arg1'=-1, 1+arg1 >= 0, cost: 1+arg1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS