About the Execution of GreatSPN+red for FlexibleBarrier-PT-16b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12099.296 | 3600000.00 | 7545978.00 | 8150.10 | ?FFTFFF?FF?FTFTT | 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-171640600800107.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-16b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 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 945K 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-16b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716423785165
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 00:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 00:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:23:06] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-23 00:23:06] [INFO ] Transformed 3472 places.
[2024-05-23 00:23:06] [INFO ] Transformed 4001 transitions.
[2024-05-23 00:23:06] [INFO ] Found NUPN structural information;
[2024-05-23 00:23:06] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1426 places :
Symmetric choice reduction at 0 with 1426 rule applications. Total rules 1426 place count 2046 transition count 2575
Iterating global reduction 0 with 1426 rules applied. Total rules applied 2852 place count 2046 transition count 2575
Discarding 665 places :
Symmetric choice reduction at 0 with 665 rule applications. Total rules 3517 place count 1381 transition count 1910
Iterating global reduction 0 with 665 rules applied. Total rules applied 4182 place count 1381 transition count 1910
Discarding 426 places :
Symmetric choice reduction at 0 with 426 rule applications. Total rules 4608 place count 955 transition count 1484
Iterating global reduction 0 with 426 rules applied. Total rules applied 5034 place count 955 transition count 1484
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 0 with 205 rules applied. Total rules applied 5239 place count 955 transition count 1279
Applied a total of 5239 rules in 669 ms. Remains 955 /3472 variables (removed 2517) and now considering 1279/4001 (removed 2722) transitions.
// Phase 1: matrix 1279 rows 955 cols
[2024-05-23 00:23:07] [INFO ] Computed 18 invariants in 44 ms
[2024-05-23 00:23:08] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-23 00:23:08] [INFO ] Invariant cache hit.
[2024-05-23 00:23:09] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
Running 1278 sub problems to find dead transitions.
[2024-05-23 00:23:09] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 31432ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 31461ms
Starting structural reductions in LTL mode, iteration 1 : 955/3472 places, 1279/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33736 ms. Remains : 955/3472 places, 1279/4001 transitions.
Support contains 31 out of 955 places after structural reductions.
[2024-05-23 00:23:40] [INFO ] Flatten gal took : 110 ms
[2024-05-23 00:23:40] [INFO ] Flatten gal took : 60 ms
[2024-05-23 00:23:41] [INFO ] Input system was already deterministic with 1279 transitions.
Support contains 29 out of 955 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (357 resets) in 1805 ms. (22 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (33 resets) in 366 ms. (109 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (33 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (35 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (33 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (33 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 88 ms. (449 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (34 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (34 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (32 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (34 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (32 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (31 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
[2024-05-23 00:23:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 716/741 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 214/955 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1279/2234 variables, 955/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2234 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/2234 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2234/2234 variables, and 973 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 955/955 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 716/741 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 278 places in 323 ms of which 48 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 312 places in 273 ms of which 5 ms to minimize.
[2024-05-23 00:23:44] [INFO ] Deduced a trap composed of 278 places in 258 ms of which 5 ms to minimize.
[2024-05-23 00:23:45] [INFO ] Deduced a trap composed of 314 places in 231 ms of which 4 ms to minimize.
[2024-05-23 00:23:45] [INFO ] Deduced a trap composed of 276 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/741 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 214/955 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1279/2234 variables, 955/978 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2234 variables, 13/991 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 00:23:46] [INFO ] Deduced a trap composed of 171 places in 277 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2234 variables, 1/992 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 00:23:47] [INFO ] Deduced a trap composed of 369 places in 290 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2234 variables, 1/993 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2234 variables, 0/993 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2234/2234 variables, and 993 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 955/955 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
After SMT, in 6557ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 874 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 4 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 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 874 transition count 1113
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 806 transition count 1113
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 137 place count 806 transition count 1075
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 213 place count 768 transition count 1075
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 246 place count 735 transition count 1042
Iterating global reduction 2 with 33 rules applied. Total rules applied 279 place count 735 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 735 transition count 1041
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 287 place count 728 transition count 1034
Iterating global reduction 3 with 7 rules applied. Total rules applied 294 place count 728 transition count 1034
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 296 place count 728 transition count 1032
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 500 place count 626 transition count 930
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 532 place count 626 transition count 898
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 548 place count 610 transition count 882
Iterating global reduction 5 with 16 rules applied. Total rules applied 564 place count 610 transition count 882
Free-agglomeration rule applied 496 times.
Iterating global reduction 5 with 496 rules applied. Total rules applied 1060 place count 610 transition count 386
Reduce places removed 496 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Iterating post reduction 5 with 687 rules applied. Total rules applied 1747 place count 114 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1751 place count 114 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1752 place count 113 transition count 190
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 79 edges and 112 vertex of which 32 / 112 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1754 place count 96 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 1786 place count 96 transition count 158
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 1786 place count 96 transition count 143
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 1816 place count 81 transition count 143
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1831 place count 81 transition count 128
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1863 place count 65 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1864 place count 65 transition count 111
Free-agglomeration rule applied 16 times.
Iterating global reduction 9 with 16 rules applied. Total rules applied 1880 place count 65 transition count 95
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 1923 place count 44 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 1942 place count 44 transition count 54
Applied a total of 1942 rules in 407 ms. Remains 44 /955 variables (removed 911) and now considering 54/1279 (removed 1225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 44/955 places, 54/1279 transitions.
RANDOM walk for 1511 steps (33 resets) in 17 ms. (83 steps per ms) remains 0/13 properties
Computed a total of 18 stabilizing places and 18 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' '!(X((X((p1&&G(p2)))||p0)))'
Support contains 9 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 938 transition count 1262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 938 transition count 1262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 938 transition count 1260
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 49 place count 925 transition count 1247
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 925 transition count 1247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 925 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 922 transition count 1237
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 922 transition count 1237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 922 transition count 1234
Applied a total of 78 rules in 96 ms. Remains 922 /955 variables (removed 33) and now considering 1234/1279 (removed 45) transitions.
// Phase 1: matrix 1234 rows 922 cols
[2024-05-23 00:23:49] [INFO ] Computed 18 invariants in 23 ms
[2024-05-23 00:23:49] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 00:23:49] [INFO ] Invariant cache hit.
[2024-05-23 00:23:50] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-23 00:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
SMT process timed out in 31329ms, After SMT, problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 31343ms
Starting structural reductions in LTL mode, iteration 1 : 922/955 places, 1234/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32515 ms. Remains : 922/955 places, 1234/1279 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-00
Product exploration explored 100000 steps with 889 reset in 380 ms.
Product exploration explored 100000 steps with 891 reset in 320 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (354 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (36 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512523 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512523 steps, saw 185242 distinct states, run finished after 3003 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 00:24:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2156/2156 variables, and 940 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2156/2156 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 922 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 1234/1234 transitions.
Applied a total of 0 rules in 23 ms. Remains 922 /922 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 00:24:27] [INFO ] Invariant cache hit.
[2024-05-23 00:24:28] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 00:24:28] [INFO ] Invariant cache hit.
[2024-05-23 00:24:28] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-23 00:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
SMT process timed out in 31275ms, After SMT, problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 31290ms
Finished structural reductions in LTL mode , in 1 iterations and 32477 ms. Remains : 922/922 places, 1234/1234 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (355 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (33 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 521874 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 521874 steps, saw 187599 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 00:25:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2156/2156 variables, and 940 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2156/2156 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 900ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 892 reset in 244 ms.
Product exploration explored 100000 steps with 890 reset in 236 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 922 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 922/922 places, 1234/1234 transitions.
Graph (trivial) has 868 edges and 922 vertex of which 97 / 922 are part of one of the 16 SCC in 5 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 841 transition count 1152
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 65 place count 841 transition count 1152
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 111 place count 841 transition count 1152
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 192 place count 760 transition count 1071
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 273 place count 760 transition count 1071
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 274 place count 760 transition count 1070
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 757 transition count 1067
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 757 transition count 1067
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 282 place count 757 transition count 1065
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 3 with 86 rules applied. Total rules applied 368 place count 757 transition count 1097
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 406 place count 719 transition count 1059
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 444 place count 719 transition count 1059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 445 place count 719 transition count 1058
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 4 with 16 rules applied. Total rules applied 461 place count 719 transition count 1090
Deduced a syphon composed of 130 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 493 place count 719 transition count 1058
Deduced a syphon composed of 130 places in 1 ms
Applied a total of 493 rules in 446 ms. Remains 719 /922 variables (removed 203) and now considering 1058/1234 (removed 176) transitions.
[2024-05-23 00:25:06] [INFO ] Redundant transitions in 56 ms returned []
Running 1057 sub problems to find dead transitions.
[2024-05-23 00:25:06] [INFO ] Flow matrix only has 1027 transitions (discarded 31 similar events)
// Phase 1: matrix 1027 rows 719 cols
[2024-05-23 00:25:06] [INFO ] Computed 18 invariants in 20 ms
[2024-05-23 00:25:06] [INFO ] State equation strengthened by 129 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
At refinement iteration 1 (OVERLAPS) 1/719 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1057 unsolved
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 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:25:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
Problem TDEAD482 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
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
Problem TDEAD505 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
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
Problem TDEAD552 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Problem TDEAD575 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
[2024-05-23 00:25:36] [INFO ] Deduced a trap composed of 230 places in 126 ms of which 3 ms to minimize.
Problem TDEAD681 is UNSAT
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 719/1746 variables, and 35 constraints, problems are : Problem set: 144 solved, 913 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/719 constraints, ReadFeed: 0/129 constraints, PredecessorRefiner: 1057/1057 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 144 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 144 solved, 913 unsolved
At refinement iteration 1 (OVERLAPS) 97/719 variables, 18/18 constraints. Problems are: Problem set: 144 solved, 913 unsolved
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/719 variables, 17/35 constraints. Problems are: Problem set: 177 solved, 880 unsolved
[2024-05-23 00:25:55] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 4 ms to minimize.
Problem TDEAD959 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/719 variables, 1/36 constraints. Problems are: Problem set: 178 solved, 879 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/719 variables, 0/36 constraints. Problems are: Problem set: 178 solved, 879 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1745 variables, 719/755 constraints. Problems are: Problem set: 178 solved, 879 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1745 variables, 128/883 constraints. Problems are: Problem set: 178 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1745/1746 variables, and 1762 constraints, problems are : Problem set: 178 solved, 879 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 719/719 constraints, ReadFeed: 128/129 constraints, PredecessorRefiner: 879/1057 constraints, Known Traps: 18/18 constraints]
After SMT, in 62668ms problems are : Problem set: 178 solved, 879 unsolved
Search for dead transitions found 178 dead transitions in 62680ms
Found 178 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 178 transitions
Dead transitions reduction (with SMT) removed 178 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 719/922 places, 880/1234 transitions.
Graph (complete) has 2520 edges and 719 vertex of which 589 are kept as prefixes of interest. Removing 130 places using SCC suffix rule.3 ms
Discarding 130 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 46 ms. Remains 589 /719 variables (removed 130) and now considering 880/880 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/922 places, 880/1234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63243 ms. Remains : 589/922 places, 880/1234 transitions.
Support contains 4 out of 922 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 1234/1234 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 917 transition count 1229
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 917 transition count 1229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 917 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 913 transition count 1224
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 913 transition count 1224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 913 transition count 1221
Applied a total of 22 rules in 140 ms. Remains 913 /922 variables (removed 9) and now considering 1221/1234 (removed 13) transitions.
// Phase 1: matrix 1221 rows 913 cols
[2024-05-23 00:26:09] [INFO ] Computed 18 invariants in 19 ms
[2024-05-23 00:26:09] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-23 00:26:09] [INFO ] Invariant cache hit.
[2024-05-23 00:26:10] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 1220 sub problems to find dead transitions.
[2024-05-23 00:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/912 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
SMT process timed out in 31325ms, After SMT, problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 31340ms
Starting structural reductions in LTL mode, iteration 1 : 913/922 places, 1221/1234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32550 ms. Remains : 913/922 places, 1221/1234 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-00 finished in 172547 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)))'
Support contains 1 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 930 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 930 transition count 1254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 930 transition count 1251
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 910 transition count 1231
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 910 transition count 1231
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 106 place count 910 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 907 transition count 1215
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 907 transition count 1215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 907 transition count 1212
Applied a total of 115 rules in 112 ms. Remains 907 /955 variables (removed 48) and now considering 1212/1279 (removed 67) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-23 00:26:42] [INFO ] Computed 18 invariants in 12 ms
[2024-05-23 00:26:42] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-23 00:26:42] [INFO ] Invariant cache hit.
[2024-05-23 00:26:43] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-23 00:26:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 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 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61393ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61404ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1212/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62837 ms. Remains : 907/955 places, 1212/1279 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-01
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-01 finished in 62961 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 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 930 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 930 transition count 1254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 930 transition count 1251
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 910 transition count 1231
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 910 transition count 1231
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 107 place count 910 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 907 transition count 1214
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 907 transition count 1214
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 907 transition count 1211
Applied a total of 116 rules in 104 ms. Remains 907 /955 variables (removed 48) and now considering 1211/1279 (removed 68) transitions.
// Phase 1: matrix 1211 rows 907 cols
[2024-05-23 00:27:45] [INFO ] Computed 18 invariants in 12 ms
[2024-05-23 00:27:45] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-23 00:27:45] [INFO ] Invariant cache hit.
[2024-05-23 00:27:46] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Running 1210 sub problems to find dead transitions.
[2024-05-23 00:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2118 variables, and 18 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2118 variables, and 18 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 0/0 constraints]
After SMT, in 61221ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 61232ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1211/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62636 ms. Remains : 907/955 places, 1211/1279 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 21049 steps with 188 reset in 48 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-02 finished in 62791 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)||G(p1))))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 901 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 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 873 transition count 1121
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 798 transition count 1121
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 151 place count 798 transition count 1078
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 237 place count 755 transition count 1078
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 290 place count 702 transition count 1025
Iterating global reduction 2 with 53 rules applied. Total rules applied 343 place count 702 transition count 1025
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 346 place count 702 transition count 1022
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 360 place count 688 transition count 1008
Iterating global reduction 3 with 14 rules applied. Total rules applied 374 place count 688 transition count 1008
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 387 place count 688 transition count 995
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 583 place count 590 transition count 897
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 585 place count 588 transition count 895
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 588 transition count 895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 589 place count 588 transition count 893
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 605 place count 588 transition count 877
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 607 place count 586 transition count 875
Applied a total of 607 rules in 227 ms. Remains 586 /955 variables (removed 369) and now considering 875/1279 (removed 404) transitions.
[2024-05-23 00:28:47] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2024-05-23 00:28:47] [INFO ] Computed 18 invariants in 17 ms
[2024-05-23 00:28:48] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-23 00:28:48] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-23 00:28:48] [INFO ] Invariant cache hit.
[2024-05-23 00:28:48] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2024-05-23 00:28:48] [INFO ] Redundant transitions in 14 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 00:28:48] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-23 00:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 843/1429 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1429 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1429/1430 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 843/1429 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 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 1429/1430 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/955 places, 875/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61457 ms. Remains : 586/955 places, 875/1279 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-06 finished in 61599 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)||G(p1))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 902 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 873 transition count 1120
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 797 transition count 1120
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 153 place count 797 transition count 1077
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 239 place count 754 transition count 1077
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 293 place count 700 transition count 1023
Iterating global reduction 2 with 54 rules applied. Total rules applied 347 place count 700 transition count 1023
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 350 place count 700 transition count 1020
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 363 place count 687 transition count 1007
Iterating global reduction 3 with 13 rules applied. Total rules applied 376 place count 687 transition count 1007
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 389 place count 687 transition count 994
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 585 place count 589 transition count 896
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 588 place count 586 transition count 893
Iterating global reduction 4 with 3 rules applied. Total rules applied 591 place count 586 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 594 place count 586 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 610 place count 586 transition count 874
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 612 place count 584 transition count 872
Applied a total of 612 rules in 216 ms. Remains 584 /955 variables (removed 371) and now considering 872/1279 (removed 407) transitions.
[2024-05-23 00:29:49] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
// Phase 1: matrix 841 rows 584 cols
[2024-05-23 00:29:49] [INFO ] Computed 18 invariants in 20 ms
[2024-05-23 00:29:49] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-23 00:29:49] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:29:49] [INFO ] Invariant cache hit.
[2024-05-23 00:29:50] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2024-05-23 00:29:50] [INFO ] Redundant transitions in 10 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 00:29:50] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 29978 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in SI_LTL mode, iteration 1 : 584/955 places, 872/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61419 ms. Remains : 584/955 places, 872/1279 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-07
Product exploration explored 100000 steps with 4451 reset in 977 ms.
Product exploration explored 100000 steps with 4432 reset in 906 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 (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 116 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1812 resets) in 878 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 399551 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 6
Probabilistic random walk after 399551 steps, saw 97788 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-05-23 00:30:56] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:30:56] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
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) 227/229 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 96/1325 variables, 16/503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1325 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 96/1421 variables, 96/599 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1424 variables, 2/601 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1424 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 1 solved, 5 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 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
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 227/229 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 4/491 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/491 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 96/1325 variables, 16/507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-23 00:30:58] [INFO ] Deduced a trap composed of 247 places in 161 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 1/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 96/1421 variables, 96/604 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1421 variables, 0/604 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/1424 variables, 2/606 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 1/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1424 variables, 0/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1424 variables, 0/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 607 constraints, problems are : Problem set: 2 solved, 4 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1951ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 96 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 4 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 277 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[false]
Stuttering acceptance computed with spot in 26 ms :[false]
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 872/872 transitions.
Applied a total of 0 rules in 41 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-23 00:30:58] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:30:58] [INFO ] Invariant cache hit.
[2024-05-23 00:30:59] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 00:30:59] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:30:59] [INFO ] Invariant cache hit.
[2024-05-23 00:30:59] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2024-05-23 00:30:59] [INFO ] Redundant transitions in 10 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 00:30:59] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:30:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61217 ms. Remains : 584/584 places, 872/872 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[false]
RANDOM walk for 40000 steps (1818 resets) in 381 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 670170 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 670170 steps, saw 157576 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2024-05-23 00:32:03] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:32:03] [INFO ] Invariant cache hit.
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) 227/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1325 variables, 16/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1325 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1421 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/1424 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1424 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 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) 227/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1325 variables, 16/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/1421 variables, 96/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1421 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1424 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1424 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 603 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 328 steps, including 15 resets, run visited all 1 properties in 2 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[false]
Stuttering acceptance computed with spot in 44 ms :[false]
Stuttering acceptance computed with spot in 30 ms :[false]
Product exploration explored 100000 steps with 4462 reset in 765 ms.
Product exploration explored 100000 steps with 4458 reset in 769 ms.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 872/872 transitions.
Applied a total of 0 rules in 37 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-23 00:32:06] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:32:06] [INFO ] Invariant cache hit.
[2024-05-23 00:32:06] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-23 00:32:06] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:32:06] [INFO ] Invariant cache hit.
[2024-05-23 00:32:06] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-23 00:32:06] [INFO ] Redundant transitions in 7 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 00:32:06] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 00:32:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 29946 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 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 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60333ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61216 ms. Remains : 584/584 places, 872/872 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-07 finished in 197973 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 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 904 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 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 873 transition count 1119
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 796 transition count 1119
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 155 place count 796 transition count 1076
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 241 place count 753 transition count 1076
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 297 place count 697 transition count 1020
Iterating global reduction 2 with 56 rules applied. Total rules applied 353 place count 697 transition count 1020
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 697 transition count 1017
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 370 place count 683 transition count 1003
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 683 transition count 1003
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 398 place count 683 transition count 989
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 594 place count 585 transition count 891
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 597 place count 582 transition count 888
Iterating global reduction 4 with 3 rules applied. Total rules applied 600 place count 582 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 603 place count 582 transition count 885
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 619 place count 582 transition count 869
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 621 place count 580 transition count 867
Applied a total of 621 rules in 195 ms. Remains 580 /955 variables (removed 375) and now considering 867/1279 (removed 412) transitions.
[2024-05-23 00:33:07] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
// Phase 1: matrix 836 rows 580 cols
[2024-05-23 00:33:07] [INFO ] Computed 18 invariants in 26 ms
[2024-05-23 00:33:07] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 00:33:07] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-23 00:33:07] [INFO ] Invariant cache hit.
[2024-05-23 00:33:08] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2024-05-23 00:33:08] [INFO ] Redundant transitions in 7 ms returned []
Running 369 sub problems to find dead transitions.
[2024-05-23 00:33:08] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-23 00:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 16/580 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 835/1415 variables, 580/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1415 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/1415 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1415/1416 variables, and 598 constraints, problems are : Problem set: 0 solved, 369 unsolved in 29475 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 16/580 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 835/1415 variables, 580/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1415 variables, 369/967 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1415/1416 variables, and 967 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints]
After SMT, in 59852ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 59856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/955 places, 867/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60915 ms. Remains : 580/955 places, 867/1279 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-08 finished in 61049 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(F(p0))||(p1&&G(p2)))))'
Support contains 5 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 899 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 4 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 873 transition count 1122
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 149 place count 799 transition count 1122
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 149 place count 799 transition count 1079
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 235 place count 756 transition count 1079
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 288 place count 703 transition count 1026
Iterating global reduction 2 with 53 rules applied. Total rules applied 341 place count 703 transition count 1026
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 344 place count 703 transition count 1023
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 358 place count 689 transition count 1009
Iterating global reduction 3 with 14 rules applied. Total rules applied 372 place count 689 transition count 1009
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 385 place count 689 transition count 996
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 581 place count 591 transition count 898
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 584 place count 588 transition count 895
Iterating global reduction 4 with 3 rules applied. Total rules applied 587 place count 588 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 590 place count 588 transition count 892
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 606 place count 588 transition count 876
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 608 place count 586 transition count 874
Applied a total of 608 rules in 206 ms. Remains 586 /955 variables (removed 369) and now considering 874/1279 (removed 405) transitions.
[2024-05-23 00:34:08] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
// Phase 1: matrix 843 rows 586 cols
[2024-05-23 00:34:08] [INFO ] Computed 18 invariants in 19 ms
[2024-05-23 00:34:08] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 00:34:08] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:34:08] [INFO ] Invariant cache hit.
[2024-05-23 00:34:09] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2024-05-23 00:34:09] [INFO ] Redundant transitions in 8 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 00:34:09] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/955 places, 874/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61520 ms. Remains : 586/955 places, 874/1279 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-10
Product exploration explored 100000 steps with 33272 reset in 1544 ms.
Product exploration explored 100000 steps with 33389 reset in 1548 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 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1814 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 335688 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 4
Probabilistic random walk after 335688 steps, saw 83398 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-23 00:35:16] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:35:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 473/1298 variables, 211/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 4 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 473/1298 variables, 211/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1298 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 78/1376 variables, 13/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 26/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1376 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 52/1428 variables, 52/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1428 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1428 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 608 constraints, problems are : Problem set: 0 solved, 4 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1159ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 541 steps, including 15 resets, run visited all 4 properties in 7 ms. (steps per millisecond=77 )
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 4 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 39 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-23 00:35:18] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:35:18] [INFO ] Invariant cache hit.
[2024-05-23 00:35:18] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-23 00:35:18] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:35:18] [INFO ] Invariant cache hit.
[2024-05-23 00:35:18] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2024-05-23 00:35:18] [INFO ] Redundant transitions in 7 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 00:35:18] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:35:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60378ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61271 ms. Remains : 586/586 places, 874/874 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) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1812 resets) in 1002 ms. (39 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
[2024-05-23 00:36:19] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:36:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 473/1298 variables, 211/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 3 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 473/1298 variables, 211/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1298 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 78/1376 variables, 13/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 26/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1376 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 52/1428 variables, 52/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
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 2 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33325 reset in 1537 ms.
Product exploration explored 100000 steps with 33485 reset in 1507 ms.
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 35 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-23 00:36:24] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:36:24] [INFO ] Invariant cache hit.
[2024-05-23 00:36:24] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 00:36:24] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:36:24] [INFO ] Invariant cache hit.
[2024-05-23 00:36:25] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2024-05-23 00:36:25] [INFO ] Redundant transitions in 8 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 00:36:25] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 00:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61320 ms. Remains : 586/586 places, 874/874 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-10 finished in 197453 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(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 935 transition count 1259
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 935 transition count 1259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 935 transition count 1258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 918 transition count 1241
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 918 transition count 1241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 87 place count 918 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 917 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 917 transition count 1228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 917 transition count 1227
Applied a total of 90 rules in 97 ms. Remains 917 /955 variables (removed 38) and now considering 1227/1279 (removed 52) transitions.
// Phase 1: matrix 1227 rows 917 cols
[2024-05-23 00:37:25] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 00:37:26] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-23 00:37:26] [INFO ] Invariant cache hit.
[2024-05-23 00:37:27] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 1226 sub problems to find dead transitions.
[2024-05-23 00:37:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (OVERLAPS) 1/917 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/2144 variables, and 18 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (OVERLAPS) 1/917 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 917/2144 variables, and 18 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 0/1226 constraints, Known Traps: 0/0 constraints]
After SMT, in 61248ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 61261ms
Starting structural reductions in LTL mode, iteration 1 : 917/955 places, 1227/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62479 ms. Remains : 917/955 places, 1227/1279 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-13
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-13 finished in 62658 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((p1&&G(p2)))||p0)))'
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)||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' '!(G((X(F(p0))||(p1&&G(p2)))))'
[2024-05-23 00:38:28] [INFO ] Flatten gal took : 48 ms
[2024-05-23 00:38:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 00:38:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 955 places, 1279 transitions and 3779 arcs took 9 ms.
Total runtime 922572 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FlexibleBarrier-PT-16b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 955
TRANSITIONS: 1279
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.007s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 1381
MODEL NAME: /home/mcc/execution/412/model
955 places, 1279 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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-16b"
export BK_EXAMINATION="LTLCardinality"
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-16b, examination is LTLCardinality"
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-171640600800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;