Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer Transition Systems pair #487528727
details
property
value
status
complete
benchmark
PastaB16.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.162375926971 seconds
cpu usage
0.161616597
max memory
1.26976E7
stage attributes
key
value
output-size
9937
starexec-result
WORST_CASE(Omega(0),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: __init 0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 1: f142_0_main_LE -> f153_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg2 > 0 /\ -arg1P1+arg2 == 0), cost: 1 2: f153_0_main_LE -> f142_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1P2 == 0 /\ -1+arg1-arg2P2 == 0 /\ -arg2 == 0), cost: 1 3: f153_0_main_LE -> f153_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ arg1-arg1P3 == 0 /\ arg2 > 0), cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied preprocessing Original rule: f142_0_main_LE -> f153_0_main_LE : arg1'=arg1P1, arg2'=arg2P1, (arg1-arg2P1 == 0 /\ arg2 > 0 /\ -arg1P1+arg2 == 0), cost: 1 New rule: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=arg1, arg2 > 0, cost: 1 Applied preprocessing Original rule: f153_0_main_LE -> f142_0_main_LE : arg1'=arg1P2, arg2'=arg2P2, (-arg1P2 == 0 /\ -1+arg1-arg2P2 == 0 /\ -arg2 == 0), cost: 1 New rule: f153_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=-1+arg1, arg2 == 0, cost: 1 Applied preprocessing Original rule: f153_0_main_LE -> f153_0_main_LE : arg1'=arg1P3, arg2'=arg2P3, (-1+arg2-arg2P3 == 0 /\ arg1-arg1P3 == 0 /\ arg2 > 0), cost: 1 New rule: f153_0_main_LE -> f153_0_main_LE : arg2'=-1+arg2, arg2 > 0, cost: 1 Simplified rules Start location: __init 0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=arg1, arg2 > 0, cost: 1 6: f153_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=-1+arg1, arg2 == 0, cost: 1 7: f153_0_main_LE -> f153_0_main_LE : arg2'=-1+arg2, arg2 > 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied acceleration Original rule: f153_0_main_LE -> f153_0_main_LE : arg2'=-1+arg2, arg2 > 0, cost: 1 New rule: f153_0_main_LE -> f153_0_main_LE : arg2'=-n0+arg2, (n0 >= 0 /\ 1-n0+arg2 > 0), cost: n0 Applied instantiation Original rule: f153_0_main_LE -> f153_0_main_LE : arg2'=-n0+arg2, (n0 >= 0 /\ 1-n0+arg2 > 0), cost: n0 New rule: f153_0_main_LE -> f153_0_main_LE : arg2'=0, (1 > 0 /\ arg2 >= 0), cost: arg2 Applied simplification Original rule: f153_0_main_LE -> f153_0_main_LE : arg2'=0, (1 > 0 /\ arg2 >= 0), cost: arg2 New rule: f153_0_main_LE -> f153_0_main_LE : arg2'=0, arg2 >= 0, cost: arg2 Applied deletion Removed the following rules: 7 Accelerated simple loops Start location: __init 0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=arg1, arg2 > 0, cost: 1 6: f153_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=-1+arg1, arg2 == 0, cost: 1 9: f153_0_main_LE -> f153_0_main_LE : arg2'=0, arg2 >= 0, cost: arg2 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Applied chaining First rule: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=arg1, arg2 > 0, cost: 1 Second rule: f153_0_main_LE -> f153_0_main_LE : arg2'=0, arg2 >= 0, cost: arg2 New rule: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=0, (arg1 >= 0 /\ arg2 > 0), cost: 1+arg1 Applied deletion Removed the following rules: 9 Chained accelerated rules with incoming rules Start location: __init 0: f1_0_main_Load -> f142_0_main_LE : arg1'=arg1P0, arg2'=arg2P0, (arg1 > 0 /\ 1+arg2P0 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2 > 0), cost: 1 5: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=arg1, arg2 > 0, cost: 1 10: f142_0_main_LE -> f153_0_main_LE : arg1'=arg2, arg2'=0, (arg1 >= 0 /\ arg2 > 0), cost: 1+arg1 6: f153_0_main_LE -> f142_0_main_LE : arg1'=0, arg2'=-1+arg1, arg2 == 0, cost: 1 4: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Eliminating location f1_0_main_Load by chaining: Applied chaining First rule: __init -> f1_0_main_Load : arg1'=arg1P4, arg2'=arg2P4, TRUE, cost: 1 Second rule:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer Transition Systems