About the Execution of GreatSPN+red for FlexibleBarrier-PT-14b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11779.008 | 3600000.00 | 6972843.00 | 8845.40 | ?FFFTFFFFF?TF?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r179-tall-171640600800092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FlexibleBarrier-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716421765099
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:49:26] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-05-22 23:49:26] [INFO ] Transformed 2678 places.
[2024-05-22 23:49:26] [INFO ] Transformed 3085 transitions.
[2024-05-22 23:49:26] [INFO ] Found NUPN structural information;
[2024-05-22 23:49:26] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1074 places :
Symmetric choice reduction at 0 with 1074 rule applications. Total rules 1074 place count 1604 transition count 2011
Iterating global reduction 0 with 1074 rules applied. Total rules applied 2148 place count 1604 transition count 2011
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 2648 place count 1104 transition count 1511
Iterating global reduction 0 with 500 rules applied. Total rules applied 3148 place count 1104 transition count 1511
Discarding 314 places :
Symmetric choice reduction at 0 with 314 rule applications. Total rules 3462 place count 790 transition count 1197
Iterating global reduction 0 with 314 rules applied. Total rules applied 3776 place count 790 transition count 1197
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 0 with 149 rules applied. Total rules applied 3925 place count 790 transition count 1048
Applied a total of 3925 rules in 690 ms. Remains 790 /2678 variables (removed 1888) and now considering 1048/3085 (removed 2037) transitions.
// Phase 1: matrix 1048 rows 790 cols
[2024-05-22 23:49:27] [INFO ] Computed 16 invariants in 44 ms
[2024-05-22 23:49:27] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-05-22 23:49:27] [INFO ] Invariant cache hit.
[2024-05-22 23:49:28] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Running 1047 sub problems to find dead transitions.
[2024-05-22 23:49:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-05-22 23:49:52] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 41 ms to minimize.
[2024-05-22 23:49:52] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1838 variables, and 18 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1047/1047 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1047 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/790 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 4 (OVERLAPS) 1048/1838 variables, 790/808 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 1047/1855 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1838/1838 variables, and 1855 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1047/1047 constraints, Known Traps: 2/2 constraints]
After SMT, in 61004ms problems are : Problem set: 0 solved, 1047 unsolved
Search for dead transitions found 0 dead transitions in 61054ms
Starting structural reductions in LTL mode, iteration 1 : 790/2678 places, 1048/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62967 ms. Remains : 790/2678 places, 1048/3085 transitions.
Support contains 44 out of 790 places after structural reductions.
[2024-05-22 23:50:29] [INFO ] Flatten gal took : 93 ms
[2024-05-22 23:50:30] [INFO ] Flatten gal took : 50 ms
[2024-05-22 23:50:30] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 41 out of 790 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (396 resets) in 2795 ms. (14 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
[2024-05-22 23:50:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 675/711 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 79/790 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1048/1838 variables, 790/806 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:32] [INFO ] Deduced a trap composed of 225 places in 197 ms of which 4 ms to minimize.
[2024-05-22 23:50:32] [INFO ] Deduced a trap composed of 224 places in 196 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 2/808 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/1838 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1838/1838 variables, and 808 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3058 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 675/711 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/711 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:34] [INFO ] Deduced a trap composed of 220 places in 213 ms of which 5 ms to minimize.
[2024-05-22 23:50:34] [INFO ] Deduced a trap composed of 253 places in 193 ms of which 4 ms to minimize.
[2024-05-22 23:50:35] [INFO ] Deduced a trap composed of 220 places in 170 ms of which 4 ms to minimize.
[2024-05-22 23:50:35] [INFO ] Deduced a trap composed of 224 places in 200 ms of which 4 ms to minimize.
[2024-05-22 23:50:35] [INFO ] Deduced a trap composed of 222 places in 197 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/711 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:36] [INFO ] Deduced a trap composed of 221 places in 225 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/711 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:36] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/711 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/711 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 79/790 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:37] [INFO ] Deduced a trap composed of 115 places in 80 ms of which 2 ms to minimize.
[2024-05-22 23:50:37] [INFO ] Deduced a trap composed of 224 places in 223 ms of which 4 ms to minimize.
[2024-05-22 23:50:38] [INFO ] Deduced a trap composed of 227 places in 224 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1048/1838 variables, 790/818 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1838 variables, 24/842 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-22 23:50:39] [INFO ] Deduced a trap composed of 253 places in 223 ms of which 4 ms to minimize.
SMT process timed out in 8164ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 687 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 8 ms
Free SCC test removed 66 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 724 transition count 901
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 657 transition count 901
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 135 place count 657 transition count 871
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 195 place count 627 transition count 871
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 222 place count 600 transition count 844
Iterating global reduction 2 with 27 rules applied. Total rules applied 249 place count 600 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 600 transition count 843
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 254 place count 596 transition count 839
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 596 transition count 839
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 440 place count 505 transition count 748
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 453 place count 505 transition count 735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 455 place count 504 transition count 735
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 457 place count 504 transition count 733
Free-agglomeration rule applied 357 times.
Iterating global reduction 4 with 357 rules applied. Total rules applied 814 place count 504 transition count 376
Reduce places removed 357 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 4 with 451 rules applied. Total rules applied 1265 place count 147 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 1283 place count 147 transition count 264
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1285 place count 147 transition count 264
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1286 place count 147 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1287 place count 146 transition count 263
Applied a total of 1287 rules in 677 ms. Remains 146 /790 variables (removed 644) and now considering 263/1048 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 146/790 places, 263/1048 transitions.
RANDOM walk for 40000 steps (353 resets) in 1128 ms. (35 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (50 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2024-05-22 23:50:40] [INFO ] Flow matrix only has 217 transitions (discarded 46 similar events)
// Phase 1: matrix 217 rows 146 cols
[2024-05-22 23:50:40] [INFO ] Computed 16 invariants in 12 ms
[2024-05-22 23:50:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/113 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 178/291 variables, 86/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/339 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:50:40] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 24/363 variables, 32/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/113 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 178/291 variables, 86/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/339 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 16/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 24/363 variables, 32/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:50:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/363 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/363 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 340 place count 546 transition count 798
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 546 transition count 798
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 360 place count 546 transition count 788
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 534 place count 457 transition count 699
Iterating global reduction 4 with 4 rules applied. Total rules applied 538 place count 457 transition count 699
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 456 transition count 680
Applied a total of 557 rules in 374 ms. Remains 456 /790 variables (removed 334) and now considering 680/1048 (removed 368) transitions.
[2024-05-22 23:50:41] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
// Phase 1: matrix 653 rows 456 cols
[2024-05-22 23:50:41] [INFO ] Computed 16 invariants in 17 ms
[2024-05-22 23:50:41] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 23:50:41] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:50:41] [INFO ] Invariant cache hit.
[2024-05-22 23:50:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:50:42] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2024-05-22 23:50:42] [INFO ] Redundant transitions in 34 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-22 23:50:42] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:50:42] [INFO ] Invariant cache hit.
[2024-05-22 23:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/1109 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 473 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 509/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/1109 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 982 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 680/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61605 ms. Remains : 456/790 places, 680/1048 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-00
Product exploration explored 100000 steps with 4430 reset in 717 ms.
Product exploration explored 100000 steps with 4425 reset in 593 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/456 stabilizing places and 2/680 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 513 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1816 resets) in 759 ms. (52 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2024-05-22 23:51:45] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:51:45] [INFO ] Invariant cache hit.
[2024-05-22 23:51:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/284 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 482/766 variables, 284/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 342/1108 variables, 172/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1108 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1108 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1109 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/284 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 482/766 variables, 284/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 342/1108 variables, 172/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1108 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1108 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1108 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1109 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1109 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 671 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-22 23:51:46] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:51:46] [INFO ] Invariant cache hit.
[2024-05-22 23:51:46] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-05-22 23:51:47] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-22 23:51:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:51:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-05-22 23:51:48] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-22 23:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:51:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2024-05-22 23:51:48] [INFO ] Computed and/alt/rep : 284/666/284 causal constraints (skipped 198 transitions) in 44 ms.
[2024-05-22 23:51:48] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 680/680 transitions.
Applied a total of 0 rules in 85 ms. Remains 456 /456 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-05-22 23:51:48] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:51:48] [INFO ] Invariant cache hit.
[2024-05-22 23:51:48] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 23:51:48] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:51:48] [INFO ] Invariant cache hit.
[2024-05-22 23:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:51:49] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-22 23:51:49] [INFO ] Redundant transitions in 7 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-22 23:51:49] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:51:49] [INFO ] Invariant cache hit.
[2024-05-22 23:51:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/1109 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 473 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 509/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/1109 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 982 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61208 ms. Remains : 456/456 places, 680/680 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/456 stabilizing places and 2/680 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 496 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 32137 steps (1454 resets) in 199 ms. (160 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 587 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-05-22 23:52:51] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:52:51] [INFO ] Invariant cache hit.
[2024-05-22 23:52:51] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-05-22 23:52:51] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-05-22 23:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:52:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2024-05-22 23:52:52] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-22 23:52:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:52:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-22 23:52:52] [INFO ] Computed and/alt/rep : 284/666/284 causal constraints (skipped 198 transitions) in 41 ms.
[2024-05-22 23:52:52] [INFO ] Added : 0 causal constraints over 0 iterations in 109 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 4446 reset in 559 ms.
Product exploration explored 100000 steps with 4422 reset in 558 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 680/680 transitions.
Applied a total of 0 rules in 29 ms. Remains 456 /456 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2024-05-22 23:52:53] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:52:54] [INFO ] Invariant cache hit.
[2024-05-22 23:52:54] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 23:52:54] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:52:54] [INFO ] Invariant cache hit.
[2024-05-22 23:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:52:54] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-22 23:52:54] [INFO ] Redundant transitions in 4 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-22 23:52:54] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-22 23:52:54] [INFO ] Invariant cache hit.
[2024-05-22 23:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/1109 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 473 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 509/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/1109 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 982 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61140 ms. Remains : 456/456 places, 680/680 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-00 finished in 194126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 208 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-22 23:53:55] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-22 23:53:55] [INFO ] Computed 16 invariants in 9 ms
[2024-05-22 23:53:55] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-22 23:53:55] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-22 23:53:55] [INFO ] Invariant cache hit.
[2024-05-22 23:53:56] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
[2024-05-22 23:53:56] [INFO ] Redundant transitions in 3 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-22 23:53:56] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-22 23:53:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 649/1103 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/1103 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1104 variables, and 470 constraints, problems are : Problem set: 0 solved, 297 unsolved in 19317 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 649/1103 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 297/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 23:54:22] [INFO ] Deduced a trap composed of 188 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1104 variables, and 768 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
After SMT, in 49606ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 49609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50459 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-01 finished in 50545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 738 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 718 transition count 897
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 640 transition count 897
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 157 place count 640 transition count 866
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 219 place count 609 transition count 866
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 270 place count 558 transition count 815
Iterating global reduction 2 with 51 rules applied. Total rules applied 321 place count 558 transition count 815
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 325 place count 558 transition count 811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 558 transition count 810
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 557 transition count 810
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 337 place count 547 transition count 800
Iterating global reduction 3 with 10 rules applied. Total rules applied 347 place count 547 transition count 800
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 523 place count 464 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 459 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 459 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 459 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 459 transition count 683
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 459 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 556 place count 457 transition count 681
Applied a total of 556 rules in 162 ms. Remains 457 /790 variables (removed 333) and now considering 681/1048 (removed 367) transitions.
[2024-05-22 23:54:45] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
// Phase 1: matrix 656 rows 457 cols
[2024-05-22 23:54:45] [INFO ] Computed 16 invariants in 16 ms
[2024-05-22 23:54:46] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 23:54:46] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-22 23:54:46] [INFO ] Invariant cache hit.
[2024-05-22 23:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:54:46] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-05-22 23:54:46] [INFO ] Redundant transitions in 3 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-22 23:54:46] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-22 23:54:46] [INFO ] Invariant cache hit.
[2024-05-22 23:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 15/457 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 655/1112 variables, 457/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1112 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1112/1113 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19735 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 457/457 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 15/457 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 655/1112 variables, 457/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 300/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/1112 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1112/1113 variables, and 774 constraints, problems are : Problem set: 0 solved, 300 unsolved in 26615 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 457/457 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 46622ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 46625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 457/790 places, 681/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47471 ms. Remains : 457/790 places, 681/1048 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-02 finished in 47537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&X(p1)) U G(p2)) U !p1))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 741 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 723 transition count 901
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 644 transition count 901
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 159 place count 644 transition count 868
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 225 place count 611 transition count 868
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 273 place count 563 transition count 820
Iterating global reduction 2 with 48 rules applied. Total rules applied 321 place count 563 transition count 820
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 326 place count 563 transition count 815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 563 transition count 814
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 562 transition count 814
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 552 transition count 804
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 552 transition count 804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 552 transition count 794
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 534 place count 464 transition count 706
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 537 place count 461 transition count 703
Iterating global reduction 4 with 3 rules applied. Total rules applied 540 place count 461 transition count 703
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 543 place count 461 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 545 place count 460 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 560 place count 460 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 562 place count 458 transition count 683
Applied a total of 562 rules in 156 ms. Remains 458 /790 variables (removed 332) and now considering 683/1048 (removed 365) transitions.
[2024-05-22 23:55:33] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
// Phase 1: matrix 657 rows 458 cols
[2024-05-22 23:55:33] [INFO ] Computed 16 invariants in 8 ms
[2024-05-22 23:55:33] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-22 23:55:33] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-22 23:55:33] [INFO ] Invariant cache hit.
[2024-05-22 23:55:34] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-22 23:55:34] [INFO ] Redundant transitions in 10 ms returned []
Running 315 sub problems to find dead transitions.
[2024-05-22 23:55:34] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-22 23:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 14/458 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 656/1114 variables, 458/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/1114 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1115 variables, and 474 constraints, problems are : Problem set: 0 solved, 315 unsolved in 19835 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 458/458 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 14/458 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 656/1114 variables, 458/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 315/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/1114 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 789 constraints, problems are : Problem set: 0 solved, 315 unsolved in 26547 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 458/458 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
After SMT, in 46643ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 46646ms
Starting structural reductions in SI_LTL mode, iteration 1 : 458/790 places, 683/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47455 ms. Remains : 458/790 places, 683/1048 transitions.
Stuttering acceptance computed with spot in 246 ms :[p1, true, true, (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-03 finished in 47723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(F((p1||G(p2)))))||G(F((p1||G(p2))))))))'
Support contains 5 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 765 transition count 1019
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 747 transition count 1001
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 747 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 101 place count 747 transition count 990
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 740 transition count 983
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 740 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 740 transition count 980
Applied a total of 118 rules in 55 ms. Remains 740 /790 variables (removed 50) and now considering 980/1048 (removed 68) transitions.
// Phase 1: matrix 980 rows 740 cols
[2024-05-22 23:56:21] [INFO ] Computed 16 invariants in 16 ms
[2024-05-22 23:56:21] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 23:56:21] [INFO ] Invariant cache hit.
[2024-05-22 23:56:21] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 979 sub problems to find dead transitions.
[2024-05-22 23:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1720 variables, and 16 constraints, problems are : Problem set: 0 solved, 979 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 979/979 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 979 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 3 (OVERLAPS) 980/1720 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 979/1735 constraints. Problems are: Problem set: 0 solved, 979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1735 constraints, problems are : Problem set: 0 solved, 979 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 979/979 constraints, Known Traps: 0/0 constraints]
After SMT, in 60828ms problems are : Problem set: 0 solved, 979 unsolved
Search for dead transitions found 0 dead transitions in 60839ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 980/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61805 ms. Remains : 740/790 places, 980/1048 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 202 ms.
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 16 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-04 finished in 62465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 144 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-22 23:57:23] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-22 23:57:23] [INFO ] Computed 16 invariants in 13 ms
[2024-05-22 23:57:23] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-22 23:57:23] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-22 23:57:23] [INFO ] Invariant cache hit.
[2024-05-22 23:57:24] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-22 23:57:24] [INFO ] Redundant transitions in 9 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-22 23:57:24] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-22 23:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-22 23:57:28] [INFO ] Deduced a trap composed of 188 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 649/1103 variables, 454/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1104 variables, and 471 constraints, problems are : Problem set: 0 solved, 297 unsolved in 20865 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 649/1103 variables, 454/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 297/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1104 variables, and 768 constraints, problems are : Problem set: 0 solved, 297 unsolved in 24209 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
After SMT, in 45352ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 45357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46087 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-05 finished in 46149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(G(p0))))))))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 740 transition count 978
Applied a total of 120 rules in 58 ms. Remains 740 /790 variables (removed 50) and now considering 978/1048 (removed 70) transitions.
// Phase 1: matrix 978 rows 740 cols
[2024-05-22 23:58:09] [INFO ] Computed 16 invariants in 18 ms
[2024-05-22 23:58:09] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-22 23:58:09] [INFO ] Invariant cache hit.
[2024-05-22 23:58:10] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 977 sub problems to find dead transitions.
[2024-05-22 23:58:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1718 variables, and 16 constraints, problems are : Problem set: 0 solved, 977 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 977/977 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 977 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 3 (OVERLAPS) 978/1718 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 977/1733 constraints. Problems are: Problem set: 0 solved, 977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 1733 constraints, problems are : Problem set: 0 solved, 977 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 977/977 constraints, Known Traps: 0/0 constraints]
After SMT, in 60917ms problems are : Problem set: 0 solved, 977 unsolved
Search for dead transitions found 0 dead transitions in 60929ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 978/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61851 ms. Remains : 740/790 places, 978/1048 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-06 finished in 62062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 740 transition count 979
Applied a total of 119 rules in 48 ms. Remains 740 /790 variables (removed 50) and now considering 979/1048 (removed 69) transitions.
// Phase 1: matrix 979 rows 740 cols
[2024-05-22 23:59:11] [INFO ] Computed 16 invariants in 15 ms
[2024-05-22 23:59:12] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 23:59:12] [INFO ] Invariant cache hit.
[2024-05-22 23:59:12] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 978 sub problems to find dead transitions.
[2024-05-22 23:59:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1719 variables, and 16 constraints, problems are : Problem set: 0 solved, 978 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 978/978 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 978 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 3 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 978/1734 constraints. Problems are: Problem set: 0 solved, 978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 1734 constraints, problems are : Problem set: 0 solved, 978 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 978/978 constraints, Known Traps: 0/0 constraints]
After SMT, in 60808ms problems are : Problem set: 0 solved, 978 unsolved
Search for dead transitions found 0 dead transitions in 60818ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 979/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61723 ms. Remains : 740/790 places, 979/1048 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-07
Product exploration explored 100000 steps with 994 reset in 216 ms.
Product exploration explored 100000 steps with 997 reset in 240 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (394 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (34 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 713294 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 713294 steps, saw 234703 distinct states, run finished after 3009 ms. (steps per millisecond=237 ) properties seen :0
[2024-05-23 00:00:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 647/740 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1719 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1719 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 647/740 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1719 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1719 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1719 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 757 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-07 finished in 66361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p2))))&&p1))))'
Support contains 7 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 739 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 270 place count 559 transition count 816
Iterating global reduction 2 with 49 rules applied. Total rules applied 319 place count 559 transition count 816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 322 place count 559 transition count 813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 559 transition count 812
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 558 transition count 812
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 548 transition count 802
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 548 transition count 802
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 353 place count 548 transition count 793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 523 place count 463 transition count 708
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 458 transition count 703
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 458 transition count 703
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 458 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 458 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 456 transition count 682
Applied a total of 554 rules in 138 ms. Remains 456 /790 variables (removed 334) and now considering 682/1048 (removed 366) transitions.
[2024-05-23 00:00:18] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
// Phase 1: matrix 655 rows 456 cols
[2024-05-23 00:00:18] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 00:00:18] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-23 00:00:18] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 00:00:18] [INFO ] Invariant cache hit.
[2024-05-23 00:00:18] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-23 00:00:18] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:00:18] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 00:00:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 654/1110 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1111 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18874 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 654/1110 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1110 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1111 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23917 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 43034ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 43037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 682/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43806 ms. Remains : 456/790 places, 682/1048 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND p0 (NOT p2)), (NOT p2), p0, p0]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-09
Product exploration explored 100000 steps with 4890 reset in 658 ms.
Product exploration explored 100000 steps with 4889 reset in 677 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 111 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p2), (AND (NOT p2) p0), p0]
RANDOM walk for 40000 steps (1999 resets) in 1282 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
[2024-05-23 00:01:04] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-23 00:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 409/641 variables, 232/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 359/1000 variables, 158/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 66/1066 variables, 11/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 22/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 44/1110 variables, 44/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1111 variables, and 472 constraints, problems are : Problem set: 0 solved, 3 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 409/641 variables, 232/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 359/1000 variables, 158/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 66/1066 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1066 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 44/1110 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1110 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1111 variables, and 475 constraints, problems are : Problem set: 0 solved, 3 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 115 steps, including 3 resets, run visited all 3 properties in 5 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 5 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p2)))
Knowledge based reduction with 21 factoid took 245 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-09 finished in 47467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(F(p1))))||G(p0)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 748 transition count 991
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 741 transition count 984
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 741 transition count 984
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 741 transition count 981
Applied a total of 116 rules in 55 ms. Remains 741 /790 variables (removed 49) and now considering 981/1048 (removed 67) transitions.
// Phase 1: matrix 981 rows 741 cols
[2024-05-23 00:01:05] [INFO ] Computed 16 invariants in 17 ms
[2024-05-23 00:01:05] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-23 00:01:05] [INFO ] Invariant cache hit.
[2024-05-23 00:01:06] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Running 980 sub problems to find dead transitions.
[2024-05-23 00:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 1 (OVERLAPS) 1/741 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/1722 variables, and 16 constraints, problems are : Problem set: 0 solved, 980 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/741 constraints, PredecessorRefiner: 980/980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 1 (OVERLAPS) 1/741 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 3 (OVERLAPS) 981/1722 variables, 741/757 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 980/1737 constraints. Problems are: Problem set: 0 solved, 980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 1737 constraints, problems are : Problem set: 0 solved, 980 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 constraints, PredecessorRefiner: 980/980 constraints, Known Traps: 0/0 constraints]
After SMT, in 60812ms problems are : Problem set: 0 solved, 980 unsolved
Search for dead transitions found 0 dead transitions in 60824ms
Starting structural reductions in LTL mode, iteration 1 : 741/790 places, 981/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61759 ms. Remains : 741/790 places, 981/1048 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10
Product exploration explored 100000 steps with 997 reset in 216 ms.
Product exploration explored 100000 steps with 997 reset in 237 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (394 resets) in 540 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 198893 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 6
Probabilistic random walk after 198893 steps, saw 91940 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-23 00:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/177 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 564/741 variables, 15/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 4 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 205 places in 206 ms of which 4 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:02:12] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/741 variables, 6/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 981/1722 variables, 741/763 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1722 variables, 0/763 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1722 variables, 0/763 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 763 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 175/177 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 564/741 variables, 15/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/741 variables, 6/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 00:02:13] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 203 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 4/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 981/1722 variables, 741/767 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1722 variables, 5/772 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1722 variables, 1/773 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1722 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1722 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 773 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 3492ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 661 steps, including 6 resets, run visited all 5 properties in 14 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 16 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 355 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 2 out of 741 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 741/741 places, 981/981 transitions.
Graph (trivial) has 695 edges and 741 vertex of which 85 / 741 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 669 transition count 840
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 601 transition count 840
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 137 place count 601 transition count 810
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 571 transition count 810
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 224 place count 544 transition count 783
Iterating global reduction 2 with 27 rules applied. Total rules applied 251 place count 544 transition count 783
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 423 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 437 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 456 transition count 681
Applied a total of 439 rules in 115 ms. Remains 456 /741 variables (removed 285) and now considering 681/981 (removed 300) transitions.
[2024-05-23 00:02:16] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 00:02:16] [INFO ] Computed 16 invariants in 15 ms
[2024-05-23 00:02:16] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-23 00:02:16] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:02:16] [INFO ] Invariant cache hit.
[2024-05-23 00:02:17] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-05-23 00:02:17] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:02:17] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 19109 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23871 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 43255ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 43260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/741 places, 681/981 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44056 ms. Remains : 456/741 places, 681/981 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 112 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (1991 resets) in 1203 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 27 ms. (1428 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 21 ms. (1818 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 20 ms. (1904 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 27 ms. (1428 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 369690 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 6
Probabilistic random walk after 369690 steps, saw 88668 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-23 00:03:04] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:03:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 84/1106 variables, 84/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1109 variables, 2/471 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 1/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 1 solved, 5 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/476 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 477 constraints, problems are : Problem set: 1 solved, 5 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1356ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 200 steps, including 6 resets, run visited all 5 properties in 10 ms. (steps per millisecond=20 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 345 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4863 reset in 637 ms.
Product exploration explored 100000 steps with 4893 reset in 653 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 22 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 00:03:08] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:03:08] [INFO ] Invariant cache hit.
[2024-05-23 00:03:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-23 00:03:08] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:03:08] [INFO ] Invariant cache hit.
[2024-05-23 00:03:08] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-23 00:03:08] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:03:08] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18903 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23441 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42594ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42598ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43212 ms. Remains : 456/456 places, 681/681 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 165939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 743 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 339 place count 547 transition count 799
Iterating global reduction 3 with 9 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 527 place count 462 transition count 705
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 532 place count 457 transition count 700
Iterating global reduction 4 with 5 rules applied. Total rules applied 537 place count 457 transition count 700
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 558 place count 455 transition count 679
Applied a total of 558 rules in 130 ms. Remains 455 /790 variables (removed 335) and now considering 679/1048 (removed 369) transitions.
[2024-05-23 00:03:51] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
// Phase 1: matrix 653 rows 455 cols
[2024-05-23 00:03:51] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:03:51] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-23 00:03:51] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-23 00:03:51] [INFO ] Invariant cache hit.
[2024-05-23 00:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:03:52] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-23 00:03:52] [INFO ] Redundant transitions in 3 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-23 00:03:52] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-23 00:03:52] [INFO ] Invariant cache hit.
[2024-05-23 00:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 15/455 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 652/1107 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/1107 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 472 constraints, problems are : Problem set: 0 solved, 298 unsolved in 19137 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 15/455 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 652/1107 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 298/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/1107 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 770 constraints, problems are : Problem set: 0 solved, 298 unsolved in 25577 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 44982ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 44986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 455/790 places, 679/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45757 ms. Remains : 455/790 places, 679/1048 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-12 finished in 45862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G((F(p3)||p2))))))'
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 749 transition count 1002
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 749 transition count 1002
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 98 place count 749 transition count 991
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 743 transition count 985
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 743 transition count 985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 743 transition count 983
Applied a total of 112 rules in 51 ms. Remains 743 /790 variables (removed 47) and now considering 983/1048 (removed 65) transitions.
// Phase 1: matrix 983 rows 743 cols
[2024-05-23 00:04:37] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:04:37] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-23 00:04:37] [INFO ] Invariant cache hit.
[2024-05-23 00:04:38] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 982 sub problems to find dead transitions.
[2024-05-23 00:04:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/1726 variables, and 16 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 982 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 3 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1726 variables, 982/1741 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1726/1726 variables, and 1741 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 0/0 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 982 unsolved
Search for dead transitions found 0 dead transitions in 60806ms
Starting structural reductions in LTL mode, iteration 1 : 743/790 places, 983/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61700 ms. Remains : 743/790 places, 983/1048 transitions.
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13
Product exploration explored 100000 steps with 995 reset in 198 ms.
Product exploration explored 100000 steps with 989 reset in 216 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 128 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (396 resets) in 333 ms. (119 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (38 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (38 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2024-05-23 00:05:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 473/743 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1726 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1726 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1726/1726 variables, and 759 constraints, problems are : Problem set: 0 solved, 2 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/743 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1726 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1726 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1726 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1726/1726 variables, and 761 constraints, problems are : Problem set: 0 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 79 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 19 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 743 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 983/983 transitions.
Graph (trivial) has 690 edges and 743 vertex of which 79 / 743 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 676 transition count 849
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 610 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 609 transition count 848
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 135 place count 609 transition count 816
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 199 place count 577 transition count 816
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 224 place count 552 transition count 791
Iterating global reduction 3 with 25 rules applied. Total rules applied 249 place count 552 transition count 791
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 551 transition count 790
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 551 transition count 790
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 425 place count 464 transition count 703
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 438 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 441 place count 462 transition count 688
Applied a total of 441 rules in 130 ms. Remains 462 /743 variables (removed 281) and now considering 688/983 (removed 295) transitions.
[2024-05-23 00:05:41] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-23 00:05:41] [INFO ] Computed 16 invariants in 14 ms
[2024-05-23 00:05:41] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-23 00:05:41] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:05:41] [INFO ] Invariant cache hit.
[2024-05-23 00:05:42] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-05-23 00:05:42] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-23 00:05:42] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 20446 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/1124 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 797 constraints, problems are : Problem set: 0 solved, 319 unsolved in 24866 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 45558ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 45560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 462/743 places, 688/983 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46328 ms. Remains : 462/743 places, 688/983 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1950 resets) in 486 ms. (82 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-23 00:06:28] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4763 reset in 606 ms.
Product exploration explored 100000 steps with 4773 reset in 629 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 43 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-23 00:06:30] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-23 00:06:30] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 00:06:31] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-23 00:06:31] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 00:06:31] [INFO ] Invariant cache hit.
[2024-05-23 00:06:31] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-23 00:06:31] [INFO ] Redundant transitions in 3 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-23 00:06:31] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 00:06:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1119/1120 variables, and 476 constraints, problems are : Problem set: 0 solved, 317 unsolved in 19635 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 317/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1119/1120 variables, and 793 constraints, problems are : Problem set: 0 solved, 317 unsolved in 24642 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
After SMT, in 44521ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 44524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45219 ms. Remains : 460/462 places, 686/688 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 158737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(G(p1)))))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 748 transition count 990
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 742 transition count 984
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 742 transition count 984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 742 transition count 982
Applied a total of 114 rules in 51 ms. Remains 742 /790 variables (removed 48) and now considering 982/1048 (removed 66) transitions.
// Phase 1: matrix 982 rows 742 cols
[2024-05-23 00:07:16] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 00:07:16] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-23 00:07:16] [INFO ] Invariant cache hit.
[2024-05-23 00:07:17] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Running 981 sub problems to find dead transitions.
[2024-05-23 00:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (OVERLAPS) 1/742 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1724 variables, and 16 constraints, problems are : Problem set: 0 solved, 981 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/742 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 981 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (OVERLAPS) 1/742 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 3 (OVERLAPS) 982/1724 variables, 742/758 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1724 variables, 981/1739 constraints. Problems are: Problem set: 0 solved, 981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 1739 constraints, problems are : Problem set: 0 solved, 981 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 742/742 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 0/0 constraints]
After SMT, in 60754ms problems are : Problem set: 0 solved, 981 unsolved
Search for dead transitions found 0 dead transitions in 60763ms
Starting structural reductions in LTL mode, iteration 1 : 742/790 places, 982/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61716 ms. Remains : 742/790 places, 982/1048 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-14 finished in 61970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))||G(p2))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 69 place count 750 transition count 1003
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 750 transition count 1003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 750 transition count 993
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 744 transition count 987
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 744 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 744 transition count 984
Applied a total of 110 rules in 49 ms. Remains 744 /790 variables (removed 46) and now considering 984/1048 (removed 64) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-23 00:08:18] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 00:08:18] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 00:08:18] [INFO ] Invariant cache hit.
[2024-05-23 00:08:18] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-23 00:08:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60816ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60824ms
Starting structural reductions in LTL mode, iteration 1 : 744/790 places, 984/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61729 ms. Remains : 744/790 places, 984/1048 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-15
Product exploration explored 100000 steps with 25069 reset in 147 ms.
Product exploration explored 100000 steps with 25010 reset in 182 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (398 resets) in 606 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (39 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (42 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 256069 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 7
Probabilistic random walk after 256069 steps, saw 113431 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-23 00:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 00:09:24] [INFO ] Deduced a trap composed of 206 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 761 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 768 constraints, problems are : Problem set: 0 solved, 7 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2044ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 3663 steps, including 30 resets, run visited all 1 properties in 9 ms. (steps per millisecond=407 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 83 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 10 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2024-05-23 00:09:27] [INFO ] Invariant cache hit.
[2024-05-23 00:09:27] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-23 00:09:27] [INFO ] Invariant cache hit.
[2024-05-23 00:09:27] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-23 00:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60782ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Finished structural reductions in LTL mode , in 1 iterations and 61672 ms. Remains : 744/744 places, 984/984 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (397 resets) in 674 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (39 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 208987 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 7
Probabilistic random walk after 208987 steps, saw 95915 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-23 00:10:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 00:10:32] [INFO ] Deduced a trap composed of 206 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 761 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 768 constraints, problems are : Problem set: 0 solved, 7 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2004ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 1812 steps, including 15 resets, run visited all 7 properties in 17 ms. (steps per millisecond=106 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 20 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25062 reset in 157 ms.
Product exploration explored 100000 steps with 24991 reset in 193 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Graph (trivial) has 696 edges and 744 vertex of which 85 / 744 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 673 transition count 912
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 56 place count 673 transition count 912
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 97 place count 673 transition count 912
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 163 place count 607 transition count 846
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 229 place count 607 transition count 846
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 606 transition count 845
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 606 transition count 845
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 307 place count 606 transition count 873
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 339 place count 574 transition count 841
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 371 place count 574 transition count 841
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 385 place count 574 transition count 869
Deduced a syphon composed of 115 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 413 place count 574 transition count 841
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 413 rules in 326 ms. Remains 574 /744 variables (removed 170) and now considering 841/984 (removed 143) transitions.
[2024-05-23 00:10:36] [INFO ] Redundant transitions in 6 ms returned []
Running 840 sub problems to find dead transitions.
[2024-05-23 00:10:36] [INFO ] Flow matrix only has 814 transitions (discarded 27 similar events)
// Phase 1: matrix 814 rows 574 cols
[2024-05-23 00:10:36] [INFO ] Computed 16 invariants in 12 ms
[2024-05-23 00:10:36] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (OVERLAPS) 1/574 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-23 00:10:52] [INFO ] Deduced a trap composed of 173 places in 108 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
[2024-05-23 00:10:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
[2024-05-23 00:10:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
[2024-05-23 00:10:55] [INFO ] Deduced a trap composed of 189 places in 135 ms of which 2 ms to minimize.
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
[2024-05-23 00:10:58] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
Problem TDEAD754 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 17/33 constraints. Problems are: Problem set: 157 solved, 683 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 0/33 constraints. Problems are: Problem set: 157 solved, 683 unsolved
SMT process timed out in 31253ms, After SMT, problems are : Problem set: 157 solved, 683 unsolved
Search for dead transitions found 157 dead transitions in 31261ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 574/744 places, 684/984 transitions.
Graph (complete) has 1947 edges and 574 vertex of which 459 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.2 ms
Discarding 115 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 459 /574 variables (removed 115) and now considering 684/684 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 459/744 places, 684/984 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31649 ms. Remains : 459/744 places, 684/984 transitions.
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 11 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-23 00:11:08] [INFO ] Computed 16 invariants in 8 ms
[2024-05-23 00:11:08] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-23 00:11:08] [INFO ] Invariant cache hit.
[2024-05-23 00:11:09] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-23 00:11:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Finished structural reductions in LTL mode , in 1 iterations and 61749 ms. Remains : 744/744 places, 984/984 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-15 finished in 231984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(F(p1))))||G(p0)))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-10
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 548 transition count 800
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 548 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 548 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 524 place count 463 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 458 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 458 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 539 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 553 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 456 transition count 681
Applied a total of 555 rules in 98 ms. Remains 456 /790 variables (removed 334) and now considering 681/1048 (removed 367) transitions.
[2024-05-23 00:12:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-23 00:12:10] [INFO ] Computed 16 invariants in 16 ms
[2024-05-23 00:12:10] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-23 00:12:10] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:12:10] [INFO ] Invariant cache hit.
[2024-05-23 00:12:11] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-05-23 00:12:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18459 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23110 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 41848ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 41851ms
Starting structural reductions in LI_LTL mode, iteration 1 : 456/790 places, 681/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 42558 ms. Remains : 456/790 places, 681/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10
Product exploration explored 100000 steps with 4871 reset in 632 ms.
Product exploration explored 100000 steps with 4883 reset in 640 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1999 resets) in 1055 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 27 ms. (1428 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 23 ms. (1666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 338779 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 6
Probabilistic random walk after 338779 steps, saw 82903 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 00:12:58] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 84/1106 variables, 84/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1109 variables, 2/471 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 1/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 1 solved, 5 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/476 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 477 constraints, problems are : Problem set: 1 solved, 5 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1331ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 948 steps, including 30 resets, run visited all 5 properties in 14 ms. (steps per millisecond=67 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 14 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 39 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 00:13:00] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:00] [INFO ] Invariant cache hit.
[2024-05-23 00:13:00] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-23 00:13:00] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:00] [INFO ] Invariant cache hit.
[2024-05-23 00:13:00] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-23 00:13:00] [INFO ] Redundant transitions in 5 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:13:00] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18812 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23438 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42505ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42509ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43167 ms. Remains : 456/456 places, 681/681 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 150 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (2008 resets) in 1058 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 348970 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 6
Probabilistic random walk after 348970 steps, saw 84869 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-23 00:13:47] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 189 places in 136 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 1/386 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/470 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 473 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1022 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 84/1106 variables, 84/475 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1106 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1109 variables, 2/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 1/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1109 variables, 0/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1109 variables, 0/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 478 constraints, problems are : Problem set: 1 solved, 5 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1687ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=13 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 349 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4879 reset in 629 ms.
Product exploration explored 100000 steps with 4867 reset in 638 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 22 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-23 00:13:51] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:51] [INFO ] Invariant cache hit.
[2024-05-23 00:13:51] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-23 00:13:51] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:51] [INFO ] Invariant cache hit.
[2024-05-23 00:13:52] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-23 00:13:52] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-23 00:13:52] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-23 00:13:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18603 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23973 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42833ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42836ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43473 ms. Remains : 456/456 places, 681/681 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 145002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1||G((F(p3)||p2))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-13
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 737 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 723 transition count 905
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 648 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 647 transition count 904
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 153 place count 647 transition count 871
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 219 place count 614 transition count 871
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 267 place count 566 transition count 823
Iterating global reduction 3 with 48 rules applied. Total rules applied 315 place count 566 transition count 823
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 320 place count 566 transition count 818
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 320 place count 566 transition count 816
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 564 transition count 816
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 334 place count 554 transition count 806
Iterating global reduction 4 with 10 rules applied. Total rules applied 344 place count 554 transition count 806
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 353 place count 554 transition count 797
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 525 place count 468 transition count 711
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 529 place count 464 transition count 707
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 464 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 537 place count 464 transition count 703
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 550 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 553 place count 462 transition count 688
Applied a total of 553 rules in 99 ms. Remains 462 /790 variables (removed 328) and now considering 688/1048 (removed 360) transitions.
[2024-05-23 00:14:35] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-23 00:14:35] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 00:14:36] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 00:14:36] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:14:36] [INFO ] Invariant cache hit.
[2024-05-23 00:14:36] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-23 00:14:36] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:14:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 20240 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-23 00:15:03] [INFO ] Deduced a trap composed of 189 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 798 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 1/1 constraints]
After SMT, in 50523ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 50526ms
Starting structural reductions in LI_LTL mode, iteration 1 : 462/790 places, 688/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51333 ms. Remains : 462/790 places, 688/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13
Product exploration explored 100000 steps with 4783 reset in 600 ms.
Product exploration explored 100000 steps with 4774 reset in 627 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 172 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1966 resets) in 711 ms. (56 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (18 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-05-23 00:15:28] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:15:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 60 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 462 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Applied a total of 0 rules in 27 ms. Remains 462 /462 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2024-05-23 00:15:30] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:15:30] [INFO ] Invariant cache hit.
[2024-05-23 00:15:30] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 00:15:30] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:15:30] [INFO ] Invariant cache hit.
[2024-05-23 00:15:30] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-23 00:15:30] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-23 00:15:30] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:15:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 20243 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 189 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 798 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 1/1 constraints]
After SMT, in 50521ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 50525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51168 ms. Remains : 462/462 places, 688/688 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1971 resets) in 763 ms. (52 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2024-05-23 00:16:21] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-23 00:16:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4794 reset in 630 ms.
Product exploration explored 100000 steps with 4815 reset in 607 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 30 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-23 00:16:24] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-23 00:16:24] [INFO ] Computed 16 invariants in 6 ms
[2024-05-23 00:16:24] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-23 00:16:24] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 00:16:24] [INFO ] Invariant cache hit.
[2024-05-23 00:16:24] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-23 00:16:24] [INFO ] Redundant transitions in 4 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-23 00:16:24] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-23 00:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1119/1120 variables, and 476 constraints, problems are : Problem set: 0 solved, 317 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 317/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1119/1120 variables, and 793 constraints, problems are : Problem set: 0 solved, 317 unsolved in 25420 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
After SMT, in 45723ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 45726ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46377 ms. Remains : 460/462 places, 686/688 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 155496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))||G(p2))))'
[2024-05-23 00:17:10] [INFO ] Flatten gal took : 40 ms
[2024-05-23 00:17:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-23 00:17:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 790 places, 1048 transitions and 3063 arcs took 7 ms.
Total runtime 1664569 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FlexibleBarrier-PT-14b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 790
TRANSITIONS: 1048
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.000s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2848
MODEL NAME: /home/mcc/execution/408/model
790 places, 1048 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-14b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FlexibleBarrier-PT-14b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;